2006/01/31 by Tobias J. Osborne · 9 citations
Computer Science · Physics and Astronomy · #Quantum Computing Algorithms and Architecture #Quantum and electron transport phenomena #Quantum many-body systems #cond-mat.str-el #quant-ph
paper · pdf · doi:10.1103/physreva.75.032321
published as Phys. Rev. A 75, 032321 (2007) · 13 pages, 2 figures, minor changes
arxiv created 2007/02/08 · openalex publication_date 2007/03/14 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We show that adiabatic evolution of a low-dimensional lattice of quantum spins with a spectral gap can be simulated efficiently. In particular, we show that as long as the spectral gap \ensuremathΔE between the ground state and the first excited state is any constant independent of n, the total number of spins, then the ground-state expectation values of local operators, such as correlation functions, can be computed using polynomial space and time resources. Our results also imply that the local ground-state properties of any two spin models in the same quantum phase can be efficiently obtained from each other. A consequence of these results is that adiabatic quantum algorithms can be simulated efficiently if the spectral gap does not scale with n. The simulation method we describe takes place in the Heisenberg picture and does not make use of the finitely correlated state--matrix product state formalism.