Efficient algorithm for approximating one-dimensional ground states

The density-matrix renormalization-group method is very effective at finding ground states of one-dimensional (1D) quantum systems in practice, but it is a heuristic method, and there is no known proof for when it works. In this article we describe an efficient classical algorithm which provably finds a good approximation of the ground state of 1D systems under well-defined conditions. More precisely, our algorithm finds a matrix product state of bond dimension D whose energy approximates the minimal energy such states can achieve. The running time is exponential in D, and so the algorithm can be considered tractable even for D, which is logarithmic in the size of the chain. The result also implies trivially that the ground state of any local commuting Hamiltonian in 1D can be approximated efficiently; we improve this to an exact algorithm.

[1]  White,et al.  Density-matrix algorithms for quantum renormalization groups. , 1993, Physical review. B, Condensed matter.

[2]  Östlund,et al.  Thermodynamic limit of density matrix renormalization. , 1995, Physical review letters.

[3]  White,et al.  Density matrix formulation for quantum renormalization groups. , 1992, Physical review letters.

[4]  Igor L. Markov,et al.  Simulating Quantum Computation by Contracting Tensor Networks , 2008, SIAM J. Comput..

[5]  Mikhail N. Vyalyi,et al.  Commutative version of the local Hamiltonian problem and common eigenspace problem , 2005, Quantum Inf. Comput..

[6]  Mikhail N. Vyalyi,et al.  Classical and Quantum Computation , 2002, Graduate studies in mathematics.

[7]  M. Hastings,et al.  An area law for one-dimensional quantum systems , 2007, 0705.2024.

[8]  Computational difficulty of global variations in the density matrix renormalization group. , 2006, Physical review letters.

[9]  Seth Lloyd,et al.  Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation , 2007, SIAM J. Comput..

[10]  Zeph Landau,et al.  Quantum Computation and the Evaluation of Tensor Networks , 2008, SIAM J. Comput..

[11]  S. Rommer,et al.  CLASS OF ANSATZ WAVE FUNCTIONS FOR ONE-DIMENSIONAL SPIN SYSTEMS AND THEIR RELATION TO THE DENSITY MATRIX RENORMALIZATION GROUP , 1997 .

[12]  Erik D. Demaine,et al.  The Open Problems Project , 2007 .

[13]  W. Marsden.  I and J , 2012 .

[14]  Jianbo Qian,et al.  How much precision is needed to compare two sums of square roots of integers? , 2006, Inf. Process. Lett..

[15]  G. Vidal.  Efficient classical simulation of slightly entangled quantum computations. , 2003, Physical review letters.

[16]  J. Ignacio Cirac,et al.  Matrix product state and mean-field solutions for one-dimensional systems can be found efficiently , 2010 .

[17]  Norbert Schuch,et al.  Computational difficulty of finding matrix product ground states. , 2008, Physical review letters.

[18]  U. Schollwoeck.  The density-matrix renormalization group , 2004, cond-mat/0409292.