Commutative version of the local Hamiltonian problem and common eigenspace problem
From MaRDI portal
Recommendations
- The Complexity of the Local Hamiltonian Problem
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Complexity classification of local Hamiltonian problems
- THE 2-LOCAL HAMILTONIAN PROBLEM ENCOMPASSES NP
- The commuting local Hamiltonian problem on locally expanding graphs is approximable in \(\mathsf{NP}\)
Cited in
(14)- Matrix product density operators: Renormalization fixed points and boundary theories
- The commuting local Hamiltonian problem on locally expanding graphs is approximable in \(\mathsf{NP}\)
- Non-commuting two-local Hamiltonians for quantum error suppression
- Total functions in QMA
- Nontrivial quantum cellular automata in higher dimensions
- Complexity classification of local Hamiltonian problems
- Hamiltonian commutators with large Hofer norm
- Hamiltonian sparsification and gap-simulation
- Product-state approximations to quantum states
- NLTS Hamiltonians from good quantum codes
- Circuit lower bounds for low-energy states of quantum code Hamiltonians
- Commuting local Hamiltonian problem on 2D beyond qubits
- Rapid thermalization of dissipative many-body dynamics of commuting Hamiltonians
- Quantum sat problems with finite sets of projectors are complete for a plethora of classes
This page was built for publication: Commutative version of the local Hamiltonian problem and common eigenspace problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3522522)