Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1406.6355

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

Yichen Huang

Published Jun 24, 2014• 19 citations
arXivHTMLPDF

Abstract

A (deterministic) polynomial-time algorithm is proposed for approximating the ground state of (general) one-dimensional gapped Hamiltonians. Let $ε,n,η$ be the energy gap, the system size, and the desired precision, respectively. Neglecting $ε$-dependent subpolynomial (in $n$) and constant factors, the running time of the algorithm is $n^{O(1)}$ for $η=n^{-O(1)}$.

DOI
10.48550/arxiv.1406.6355

Related papers

An efficient algorithm for finding the ground state of 1D gapped local hamiltonians

Zeph A. Landau, Umesh V. Vazirani, Thomas Vidick

Computing ground states of local Hamiltonians is a fundamental problem in condensed matter physics. The problem is known to be QMA-complete, even for one-dimensional Hamiltonians [1]. This means that we do not even expect that there is a sub-exponential size description of the ground state that allows efficient computation of local observables such as the energy. In sharp contrast, the heuristic density matrix renormalization group (DMRG) algorithm invented two decades ago [5] has been remarkably successful in practice on one-dimensional problems. The situation is reminiscent of the unexplained success of the simplex algorithm before the advent of ellipsoid and interior-point methods. Is there a principled explanation for this, in the form of a large class of one-dimensional Hamiltonians whose ground states can be provably efficiently approximated? Here we give such an algorithm for gapped one-dimensional Hamiltonians: our algorithm outputs an (inverse-polynomial) approximation to the ground state, expressed as a matrix product state (MPS) of polynomial bond dimension. The running time of the algorithm is polynomial in the number of qudits n and the approximation quality δ, for a fixed local dimension d and gap Δ > 0.

Conference on Innovations in Theoretical Computer Science•Jan 12, 2014•6 citations

Efficient algorithm for approximating one-dimensional ground states

Dorit Aharonov, Itai Arad, Sandy Irani

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.

arXiv:0910.5055•Physical Review A•Jul 16, 2010•26 citations

Rigorous RG Algorithms and Area Laws for Low Energy Eigenstates in 1D

Itai Arad, Zeph Landau, Umesh Vazirani +1 more

One of the central challenges in the study of quantum many-body systems is the complexity of simulating them on a classical computer. A recent advance (Landau et al. in Nat Phys, 2015) gave a polynomial time algorithm to compute a succinct classical description for unique ground states of gapped 1D quantum systems. Despite this progress many questions remained unsolved, including whether there exist efficient algorithms when the ground space is degenerate (and of polynomial dimension in the system size), or for the polynomially many lowest energy states, or even whether such states admit succinct classical descriptions or area laws. In this paper we give a new algorithm, based on a rigorously justified RG type transformation, for finding low energy states for 1D Hamiltonians acting on a chain of n particles. In the process we resolve some of the aforementioned open questions, including giving a polynomial time algorithm for poly(n) degenerate ground spaces and an n O(log n) algorithm for the poly(n) lowest energy states (under a mild density condition). For these classes of systems the existence of a succinct classical description and area laws were not rigorously proved before this work. The algorithms are natural and efficient, and for the case of finding unique ground states for frustration-free Hamiltonians the running time is $${\tilde{O}(nM(n))}$$ , where M(n) is the time required to multiply two n × n matrices.

arXiv:1602.08828•Communications in Mathematical Physics•Aug 2, 2017•92 citations

Locally accurate MPS approximations for ground states of one-dimensional gapped local Hamiltonians

Alexander M. Dalzell, Fernando G. S. L. Brandão

A key feature of ground states of gapped local 1D Hamiltonians is their relatively low entanglement --- they are well approximated by matrix product states (MPS) with bond dimension scaling polynomially in the length N of the chain, while general states require a bond dimension scaling exponentially. We show that the bond dimension of these MPS approximations can be improved to a constant, independent of the chain length, if we relax our notion of approximation to be more local: for all length- k segments of the chain, the reduced density matrices of our approximations are ϵ -close to those of the exact state. If the state is a ground state of a gapped local Hamiltonian, the bond dimension of the approximation scales like (k/ϵ)1+o(1) , and at the expense of worse but still poly (k,1/ϵ) scaling of the bond dimension, we give an alternate construction with the additional features that it can be generated by a constant-depth quantum circuit with nearest-neighbor gates, and that it applies generally for any state with exponentially decaying correlations. For a completely general state, we give an approximation with bond dimension exp⁡(O(k/ϵ)) , which is exponentially worse, but still independent of N . Then, we consider the prospect of designing an algorithm to find a local approximation for ground states of gapped local 1D Hamiltonians. When the Hamiltonian is translationally invariant, we show that the ability to find O(1) -accurate local approximations to the ground state in T(N) time implies the ability to estimate the ground state energy to O(1) precision in O(T(N)log⁡(N)) time.

arXiv:1903.10241•Quantum•Sep 23, 2019•37 citations

Computing energy density in one dimension

Yichen Huang

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.

arXiv:1505.00772•May 4, 2015•31 citations

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

Zeph A. Landau, Umesh V. Vazirani, Thomas Vidick

arXiv:1307.5143•Nature Physics•May 30, 2015•174 citations
A (deterministic) polynomial-time algorithm is proposed for approximating the ground state of (general) one-dimensional gapped Hamiltonians. Let ε,n,ηε,n,ηε,n,η be the energy gap, the system size, and the desired precision, respectively. Neglecting εεε-dependent subpolynomial (in nnn) and constant factors, the running time of the algorithm is nO(1)n^{O(1)}nO(1) for η=n−O(1)η=n^{-O(1)}η=n−O(1).
Computing ground states of local Hamiltonians is a fundamental problem in condensed matter physics. The problem is known to be QMA-complete, even for one-dimensional Hamiltonians [1]. This means that we do not even expect that there is a sub-exponential size description of the ground state that allows efficient computation of local observables such as the energy. In sharp contrast, the heuristic density matrix renormalization group (DMRG) algorithm invented two decades ago [5] has been remarkably successful in practice on one-dimensional problems. The situation is reminiscent of the unexplained success of the simplex algorithm before the advent of ellipsoid and interior-point methods. Is there a principled explanation for this, in the form of a large class of one-dimensional Hamiltonians whose ground states can be provably efficiently approximated? Here we give such an algorithm for gapped one-dimensional Hamiltonians: our algorithm outputs an (inverse-polynomial) approximation to the ground state, expressed as a matrix product state (MPS) of polynomial bond dimension. The running time of the algorithm is polynomial in the number of qudits n and the approximation quality δ, for a fixed local dimension d and gap Δ > 0.
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 DDD whose energy approximates the minimal energy such states can achieve. The running time is exponential in DDD, and so the algorithm can be considered tractable even for DDD, 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.
One of the central challenges in the study of quantum many-body systems is the complexity of simulating them on a classical computer. A recent advance (Landau et al. in Nat Phys, 2015) gave a polynomial time algorithm to compute a succinct classical description for unique ground states of gapped 1D quantum systems. Despite this progress many questions remained unsolved, including whether there exist efficient algorithms when the ground space is degenerate (and of polynomial dimension in the system size), or for the polynomially many lowest energy states, or even whether such states admit succinct classical descriptions or area laws. In this paper we give a new algorithm, based on a rigorously justified RG type transformation, for finding low energy states for 1D Hamiltonians acting on a chain of n particles. In the process we resolve some of the aforementioned open questions, including giving a polynomial time algorithm for poly(n) degenerate ground spaces and an n O(log n) algorithm for the poly(n) lowest energy states (under a mild density condition). For these classes of systems the existence of a succinct classical description and area laws were not rigorously proved before this work. The algorithms are natural and efficient, and for the case of finding unique ground states for frustration-free Hamiltonians the running time is O~(nM(n)){\tilde{O}(nM(n))}O~(nM(n)) , where M(n) is the time required to multiply two n × n matrices.
A key feature of ground states of gapped local 1D Hamiltonians is their relatively low entanglement --- they are well approximated by matrix product states (MPS) with bond dimension scaling polynomially in the length N of the chain, while general states require a bond dimension scaling exponentially. We show that the bond dimension of these MPS approximations can be improved to a constant, independent of the chain length, if we relax our notion of approximation to be more local: for all length- k segments of the chain, the reduced density matrices of our approximations are ϵ -close to those of the exact state. If the state is a ground state of a gapped local Hamiltonian, the bond dimension of the approximation scales like (k/ϵ)1+o(1) , and at the expense of worse but still poly (k,1/ϵ) scaling of the bond dimension, we give an alternate construction with the additional features that it can be generated by a constant-depth quantum circuit with nearest-neighbor gates, and that it applies generally for any state with exponentially decaying correlations. For a completely general state, we give an approximation with bond dimension exp⁡(O(k/ϵ)) , which is exponentially worse, but still independent of N . Then, we consider the prospect of designing an algorithm to find a local approximation for ground states of gapped local 1D Hamiltonians. When the Hamiltonian is translationally invariant, we show that the ability to find O(1) -accurate local approximations to the ground state in T(N) time implies the ability to estimate the ground state energy to O(1) precision in O(T(N)log⁡(N)) time.
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.