Cited by 60Quantum many-body systemsQuantum Computing Algorithms and ArchitectureQuantum Information and Cryptography

Computational Difficulty of Finding Matrix Product Ground States

Open access
Schuch, Norbert, Cirac, Ignacio, Verstraete, Frank·2008·Physical Review Letters

Abstract

We determine the computational difficulty of finding ground states of one-dimensional (1D) Hamiltonians, which are known to be matrix product states (MPS). To this end, we construct a class of 1D frustration-free Hamiltonians with unique MPS ground states and a polynomial gap above, for which finding the ground state is at least as hard as factoring. Without the uniqueness of the ground state, the problem becomes NP complete, and thus for these Hamiltonians it cannot even be certified that the ground state has been found. This poses new bounds on convergence proofs for variational methods that use MPS.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1103/physrevlett.100.250501

Cites

11 of 11 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Decoherence and analog timing errors can make a hybrid universal Hamiltonian simulator via the Trotter construction inefficient.

    “They found that decoherence and analog timing errors can make this inefficient for a Hamiltonian simulator.”

    From Can one trust quantum simulators? (2012) · cites this paper as [138]

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 6

  1. S. R. White, Phys. Rev. Lett. 69, 2863 (1992).
  2. U. Schollwo ¨ck, Rev. Mod. Phys. 77, 259 (2005).
  3. F. Verstraete, D. Porras, and J. I. Cirac, Phys. Rev. Lett. 93, 227205 (2004).
  4. J. Eisert, Phys. Rev. Lett. 97, 260501 (2006).
  5. D. Aharonov, D. Gottesman, S. Irani, and J. Kempe, arXiv:0705.4077. · arXiv
  6. K. Vollbrecht and I. Cirac, Phys. Rev. Lett. 100, 010501 (2008).

Cited by

Sorted by citations

Authors
Schuch, N., Cirac, I., & Verstraete, F.
Affiliations
  • Max Planck Society (DE)
  • University of Vienna (AT)
Venue
Physical Review Letters
Published
2008-06-27
Volume
100
Issue
25
Pages
250501-250501
ISSN
  • 0031-9007 (ISSN-L)
  • 1079-7114
OpenAlex
W2105313913
Cited by
60
References
9
Citations by year
2026: 1 · 2025: 3 · 2024: 3 · 2023: 3 · 2022: 2 · 2021: 1 · 2020: 2 · 2018: 2 · 2015: 6 · 2014: 2 · 2013: 5 · 2012: 5
FWCI
4.84
Type
journal article
Language
en
Open access
Locations
  • Physical Review Letters (publishedVersion)
  • PubMed (publishedVersion)
  • arXiv (Cornell University) (acceptedVersion)
  • Ghent University Academic Bibliography (Ghent University) (submittedVersion, other-oa)
  • Max Planck Institute for Plasma Physics (submittedVersion)
  • MPG.PuRe (Max Planck Society) (submittedVersion)
  • arXiv (Cornell University)
Funders
Deutsche Forschungsgemeinschaft
Topics
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
Keywords
matrix product states, ground state calculation, frustration-free Hamiltonians, one-dimensional Hamiltonians, computational complexity, NP-completeness, ground state uniqueness, variational convergence, quantum many-body systems

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review