Computational Complexity of Projected Entangled Pair States
From MaRDI portal
Abstract: 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 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 to use existing results from quantum compexity.
Recommendations
- Computational complexity of the quantum separability problem
- ALGORITHMIC COMPLEXITY OF QUANTUM STATES
- Criticality, the Area Law, and the Computational Power of Projected Entangled Pair States
- State complexity and quantum computation
- The complexity of quantum disjointness
- Computing complexity measures for quantum states based on exponential families
- Quantum Complexity Theory
- Quantum computation in correlation space and extremal entanglement
- Computable lower bounds on the entanglement cost of quantum channels
Cites work
Cited in
(38)- Physical consequences of P NP and the density matrix renormalization group annealing conjecture
- Criticality, the Area Law, and the Computational Power of Projected Entangled Pair States
- On traces of tensor representations of diagrams
- Superselection-resolved entanglement in lattice gauge theories: a tensor network approach
- Representations of hypergraph states with neural networks*
- A construction of combinatorial NLTS
- Representations of graph states with neural networks
- Bipartite entanglement and hypergraph states
- Computations in quantum tensor networks
- Two-dimensional local Hamiltonian problem with area laws is \textsf{QMA}-complete
- Collective Monte Carlo updates through tensor network renormalization
- Gauging tensor networks with belief propagation
- Entropic measure and hypergraph states
- A practical introduction to tensor networks: Matrix product states and projected entangled pair states
- PROJECTED ENTANGLED STATES: PROPERTIES AND APPLICATIONS
- Algorithms and Computation
- PEPS as unique ground states of local Hamiltonians
- Approximating the ground state of gapped quantum spin systems
- Topological crystals and soliton lattices in a Gross-Neveu model with Hilbert-space fragmentation
- Entanglement Hamiltonian of the quantum Néel state
- Unifying variational methods for simulating quantum many-body systems
- Hand-waving and interpretive dance: an introductory course on tensor networks
- Guidable local Hamiltonian problems with implications to heuristic ansatz state preparation and the quantum PCP conjecture
- The quantum detection of projectors in finite-dimensional algebras and holography
- Gauging a superposition of fermionic Gaussian projected entangled pair states to get lattice gauge theory eigenstates
- On efficiently solvable cases of quantum \(k\)-SAT
- Colloquium: area laws for the entanglement entropy
- Practical learning method for multi-scale entangled states
- Renormalization Group Circuits for Weakly Interacting Continuum Field Theories
- Simulation of quantum many-body systems on Amazon cloud
- Unifying projected entangled pair state contractions
- A complete characterization of unitary quantum space
- Characterizing symmetries in a projected entangled pair state
- Disentanglement approach to quantum spin ground states: field theory and stochastic simulation
- PEPS as ground states: degeneracy and topology
- Probabilistic nonunitary gate in imaginary time evolution
- Mathematical open problems in projected entangled pair states
- Twisted injectivity in projected entangled pair states and the classification of quantum phases
This page was built for publication: Computational Complexity of Projected Entangled Pair States
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3107793)
