Does Not Relativize
quant-ph, cs.CC
Submitted: 2026-11-09
Updated: 2026-11-09
Terminology
Sources
- BQP and the Polynomial Hierarchy
- Forrelation: A Problem that Optimally Separates Quantum from Classical Computing
- Does Not Relativize
- An Exact Quantum Polynomial-Time Algorithm for Simon's Problem
- Quantum Amplitude Amplification and Estimation
- The Quantumly Fast and the Classically Forrious
- A generalization of the Lindeberg principle
- Harmonicity and invariance on slices of the Boolean cube
- Exact synthesis of multiqubit Clifford+T circuits
- Forrelation is Extremally Hard
- Classical Verification of Quantum Computation Beyond the Polynomial Hierarchy
- Analysis of Boolean Functions
- A general version of Price's theorem
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