Computational difficulty of finding matrix product ground states

Schuch, Norbert; Cirac, J. Ignacio; Verstraete, Frank

doi:10.1103/PhysRevLett.100.250501

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

Computational difficulty of finding matrix product ground states

MPS-Authors

/persons/resource/persons60830

Schuch, Norbert
Theory, Max Planck Institute of Quantum Optics, Max Planck Society;

/persons/resource/persons60441

Cirac, J. Ignacio
Theory, Max Planck Institute of Quantum Optics, Max Planck Society;

/persons/resource/persons60905

Verstraete, Frank
Theory, Max Planck Institute of Quantum Optics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Schuch, N., Cirac, J. I., & Verstraete, F. (2008). Computational difficulty of finding matrix product ground states. Physical Review Letters, 100(25): 250501. doi:10.1103/PhysRevLett.100.250501.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-B559-C

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.