Hardness of approximation for ground state problems
quant-ph, cs.CC
Submitted: 2024-11-07
Updated: 2026-08-09
Terminology
Sources
- Oracle Separations for the Quantum-Classical Polynomial Hierarchy
- Quantum NP - A Survey
- Efficient algorithm for a quantum analogue of 2-SAT
- A Collapsible Polynomial Hierarchy for Promise Problems
- Commuting Local Hamiltonian Problem on 2D beyond qubits
- Quantum State Isomorphism
- The status of the quantum PCP conjecture (games version)
- On Inapproximability of Reconfiguration Problems: PSPACE-Hardness and some Tight NP-Hardness Results
- Several natural BQP-Complete problems
Related papers
- Fulqrum: a generalized framework for quantum subspace diagonalization
- Flux-Activated Resonant Control of a Bosonic Quantum Memory
- Machine learning the effects of many quantum measurements
- Barriers to dequantization of near-term molecular electronic structure methods
- BRIDGE: Lazy-Move Compilation for Dual-Species Neutral-Atom Quantum Computers
- Non-Hermiticity of an anomalous superradiant phase