Computational Complexity of Projected Entangled Pair States

DOI10.1103/PhysRevLett.98.140506zbMath1228.81134arXivquant-ph/0611050WikidataQ59458713 ScholiaQ59458713MaRDI QIDQ3107793

J. Ignacio Cirac, Norbert Schuch, Frank Verstraete, Michael M. Wolf

Publication date: 26 December 2011

Published in: Physical Review Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/0611050

Mathematics Subject Classification ID

81P68: Quantum computation

81P15: Quantum measurement theory, state operations, state preparations

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

Related Items

Hand-waving and interpretive dance: an introductory course on tensor networks, A practical introduction to tensor networks: Matrix product states and projected entangled pair states, Twisted injectivity in projected entangled pair states and the classification of quantum phases, PEPS as ground states: degeneracy and topology, Computations in quantum tensor networks, Bipartite entanglement and hypergraph states, Mathematical open problems in projected entangled pair states, On traces of tensor representations of diagrams, Entropic measure and hypergraph states, Characterizing symmetries in a projected entangled pair state, Colloquium: Area laws for the entanglement entropy, Unifying Variational Methods for Simulating Quantum Many-Body Systems, Entanglement Hamiltonian of the quantum Néel state, Physical consequences of P≠NP and the density matrix renormalization group annealing conjecture, Approximating the ground state of gapped quantum spin systems

Cites Work

• Limitations of Quantum Advice and One-Way Communication
• The density-matrix renormalization group
• Criticality, the Area Law, and the Computational Power of Projected Entangled Pair States
• Quantum computing, postselection, and probabilistic polynomial-time