Computational difficulty of finding matrix product ground states.

  title={Computational difficulty of finding matrix product ground states.},
  author={Norbert Schuch and J. Ignacio Cirac and Frank Verstraete},
  journal={Physical review letters},
  volume={100 25},
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… CONTINUE READING

From This Paper

Topics from this paper.


Publications referenced by this paper.
Showing 1-7 of 7 references

and M

A. Y. Kitaev, A. H. Shen
N. Vyalyi, Classical and Quantum Computation • 2002
View 6 Excerpts
Highly Influenced


S. R. White
Rev. Lett. 69, 2863 • 1992
View 4 Excerpts
Highly Influenced


A. Kay
Rev. A 76, 030307(R) (2007); K. Vollbrecht and I. Cirac, Phys. Rev. Lett. 100, 010501 (2008). PRL 100, 250501 • 2008


M. B. Hastings, J. Stat
View 1 Excerpt


J. Eisert
Rev. Lett. 97, 260501 • 2006


U. Schollwöck
Mod. Phys. 77, 259 • 2005
View 1 Excerpt


F. Verstraete, D. Porras, J. I. Cirac
Rev. Lett. 93, 227205 • 2004