In recent years quantum simulation has made great strides, culminating in experiments that existing supercomputers cannot easily simulate. Although this raises the possibility that special purpose analog quantum simulators may be able to perform computational tasks that existing computers cannot, it also introduces a major challenge: certifying that the quantum simulator is in fact simulating the correct quantum dynamics. We provide an algorithm that, under relatively weak assumptions, can be used to efficiently infer the Hamiltonian of a large but untrusted quantum simulator using a trusted quantum simulator. We illustrate the power of this approach by showing numerically that it can inexpensively learn the Hamiltonians for large frustrated Ising models, demonstrating that quantum resources can make certifying analog quantum simulators tractable.
Download full-text PDF |
Source |
---|---|
http://dx.doi.org/10.1103/PhysRevLett.112.190501 | DOI Listing |
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!