A polynomial time algorithm for the ground state of one-dimensional gapped local Hamiltonians

By Zeph Landau, Umesh V. Vazirani, Thomas Vidick. Nature Physics, 2015

142 citations recorded by the source corpus.

Subfields: Atomic and Molecular Physics, and Optics, Condensed Matter Physics

View Paper: https://www.semanticscholar.org/paper/12063415d9fd32959e3a516e5ec4de63b35720f5

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Atomic and Molecular Physics, and Optics

1. Tameem Albash
2. Daniel A. Lidar
3. Göran Wendin
4. Martin Kliesch
5. Lennart Bittel

In Condensed Matter Physics

1. Göran Wendin
2. Daniel A. Lidar
3. Martin Kliesch
4. Tameem Albash

Citations in the corpus

• Quantum information processing with superconducting circuits: a review (2016, background): “Although, the many­body problem is tractable for quantum spin chains [95, 96].”
• Adiabatic Quantum Computing (2016, background): “…the existence of a polynomial time algorithm for the ground state of 1D gapped local Hamiltonians with constant ground-state energy (Huang, 2014; Landau et al., 2015), and the fact that 1D quantum many-body states satisfying exponential decay of correlations always fulfill an area law (Brandao…”
• Training Variational Quantum Algorithms Is NP-Hard. (2021, background): “However, hardness holds only for errors scaling as the inverse of the bond dimension and there are variants where convergence can be rigorously guaranteed [23].”