Journal
PHYSICAL REVIEW LETTERS
Volume 98, Issue 14, Pages -Publisher
AMERICAN PHYSICAL SOC
DOI: 10.1103/PhysRevLett.98.140506
Keywords
-
Categories
Ask authors/readers for more resources
We determine the computational power of preparing projected entangled pair states (PEPS), as well as the complexity of classically simulating them, and generally the complexity of contracting tensor networks. While creating PEPS allows us to solve PP problems, the latter two tasks are both proven to be #P-complete. We further show how PEPS can be used to approximate ground states of gapped Hamiltonians and that creating them is easier than creating arbitrary PEPS. The main tool for our proofs is a duality between PEPS and postselection which allows us to use existing results from quantum complexity.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available