On the Hardness of Approximate Quantum Circuit Membership and Optimization
quant-ph, cs.CC
Submitted: 2026-11-03
Updated: 2026-11-03
Sources
- Exact Quantum Circuit Optimization is co-NQP-hard
- Optimising quantum circuits is generally hard
- Fast and efficient exact synthesis of single qubit unitaries generated by Clifford and T gates
- Analysis of Quantum Functions
Related papers
- Computational regimes in matrix-product-state-based quantum trajectory simulations
- Toward chemically accurate quantum simulations on quantum hardware: A quantum-HPC hybrid approach
- Transversal surface-code game with reconfigurable qubits
- 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