Computing the Degenerate Ground Space of Gapped Spin Chains in Polynomial Time
arXiv:1502.06967 · doi:10.4086/cjtcs.2016.009
Abstract
Given a gapped Hamiltonian of a spin chain, we give a polynomial-time algorithm for finding the degenerate ground space projector. The output is an orthonormal set of matrix product states that approximate the true ground space projector up to an inverse polynomial error in any Schatten norm, with a runtime exponential in the degeneracy. Our algorithm is an extension of the recent algorithm of Landau, Vazirani, and Vidick for the nondegenerate case, and it includes the recent improvements due to Huang. The main new idea is to incorporate the local distinguishability of ground states on the half-chain to ensure that the algorithm returns a complete set of global ground states.
arXiv comment33 pages
References in corpus (14)
- Matrix Product States, Projected Entangled Pair States, and variational renormalization group methods for quantum spin systems
- An Area Law for One Dimensional Quantum Systems
- Matrix product states represent ground states faithfully
- Renormalization algorithms for Quantum-Many Body Systems in two and higher dimensions
- The Dynamics of 1D Quantum Spin Systems Can Be Approximated Efficiently
- Stochastic Error Cancellation in Analog Quantum Simulation
- An improved 1D area law for frustration-free systems
- Matrix Product State and mean field solutions for one-dimensional systems can be found efficiently
- A polynomial-time algorithm for the ground state of 1D gapped local Hamiltonians
- Area law in one dimension: Degenerate ground states and Renyi entanglement entropy
- An Efficient Algorithm for approximating 1D Ground States
- A polynomial-time algorithm for the ground state of one-dimensional gapped Hamiltonians
- Quantum Hamiltonian complexity and the detectability lemma
- The Detectability Lemma and Quantum Gap Amplification
Cited by in corpus (9)
- Hand-waving and Interpretive Dance: An Introductory Course on Tensor Networks
- Quantum Hamiltonian Complexity
- Computing energy density in one dimension
- A polynomial-time algorithm for the ground state of one-dimensional gapped Hamiltonians
- Frustration-free Hamiltonians supporting Majorana zero edge modes
- Approximate symmetries of Hamiltonians
- Two-dimensional local Hamiltonian problem with area laws is QMA-complete
- Gapped and gapless phases of frustration-free spin-1/2 chains
- Locally accurate tensor networks for thermal states and time evolution