Computing energy density in one dimension
Author:
Preprint
Abstract
We study the problem of computing energy density in one-dimensional quantum systems. We show that the ground-state energy per site or per bond can be computed in time (i) independent of the system size and subexponential in the desired precision if the ground state satisfies area laws for the Renyi entanglement entropy (this is the first rigorous formulation of the folklore that area laws imply efficient matrix-product-state algorithms); (ii) independent of the system size and polynomial in the desired precision if the system is gapped. As a by-product, we prove that in the presence of area laws (or even an energy gap) the ground state can be approximated by a positive semidefinite matrix product operator of bond dimension independent of the system size and subpolynomial in the desired precision of local properties.Keywords
All Related Versions
This publication has 11 references indexed in Scilit:
- Hamiltonian complexityReports on Progress in Physics, 2012
- Matrix product state and mean-field solutions for one-dimensional systems can be found efficientlyPhysical Review A, 2010
- Efficient algorithm for approximating one-dimensional ground statesPhysical Review A, 2010
- Quantum Adiabatic Computation with a Constant Gap Is Not Useful in One DimensionPhysical Review Letters, 2009
- Entropy Scaling and Simulability by Matrix Product StatesPhysical Review Letters, 2008
- Efficient Approximation of the Dynamics of One-Dimensional Quantum Spin SystemsPhysical Review Letters, 2006
- Matrix product states represent ground states faithfullyPhysical Review B, 2006
- Density-matrix algorithms for quantum renormalization groupsPhysical Review B, 1993
- Density matrix formulation for quantum renormalization groupsPhysical Review Letters, 1992
- Finitely correlated states on quantum spin chainsCommunications in Mathematical Physics, 1992