A polynomial-time algorithm for the ground state of 1D gapped local Hamiltonians

R. P. Feynman, “Simulating physics with computers,” International journal of theoretical physics

1982

Earlier work this paper cites.

S. R. White, “Density matrix formulation for quantum renormalization groups,” Phys. Rev. Lett

1992

Earlier work this paper cites.

G. Vidal, “Efficient classical simulation of slightly entangled quantum computations,” Phys. Rev. Lett

2003

Earlier work this paper cites.

J. Eisert, “Computational difficulty of global variations in the density matrix renormalization group,” Phys. Rev. Lett

Original

2006

Earlier work this paper cites.

M. B. Hastings, “An area law for one-dimensional quantum systems,” Journal of Statistical Mechanics: Theory and Experiment

2007

Earlier work this paper cites.

D. Perez-Garcia, F. Verstraete, M. M. Wolf, and J. I. Cirac, “Matrix product state representations,” Quantum Info. Comput

2007

Cited alongside, same era.

N. Schuch, I. Cirac, and F. Verstraete, “Computational difficulty of finding matrix product ground states,” Phys. Rev. Lett

2008

Cited alongside, same era.

D. Aharonov, D. Gottesman, S. Irani, and J. Kempe, “The power of quantum systems on a line,” Communications in Mathematical Physics

2009

Cited alongside, same era.

N. Schuch and J. I. Cirac, “Matrix product state and mean-field solutions for one-dimensional systems can be found efficiently,” Phys. Rev. A

2010

Cited alongside, same era.

D. Aharonov, I. Arad, and S. Irani, “Efficient algorithm for approximating one-dimensional ground states,” Phys. Rev. A

2010

Cited alongside, same era.

I. Arad, Z. Landau, and U. Vazirani, “Improved one-dimensional area law for frustration-free systems,” Phys. Rev. B

2012

Later among the works it cites.

J. A. Tropp, “User-friendly tail bounds for sums of random matrices,” Foundations of Computational Mathematics

2012

Later among the works it cites.

D. Gottesman and S. Irani, “The quantum and classical complexity of translationally invariant tiling and hamiltonian problems,” Theory of Computing

2013

Closest in time.

I. Arad, A. Kitaev, Z. Landau, and U. Vazirani, “An area law and sub-exponential algorithm for 1D systems,” in Proceedings of the 4th Innovations in Theoretical Computer Science (ITCS)

2013

Closest in time.