Quantum Interactive Proofs of Proximity
cs.CC
Submitted: 2026-11-06
Updated: 2026-11-06
Terminology
Sources
- Strengths and Weaknesses of Quantum Computing
- Efficient Distributed Quantum Computing
- Quantum Amplitude Amplification and Estimation
- Does Not Relativize
- QMA Lower Bounds for Batch Verification via Approximate Degree
- $k$-Forrelation Optimally Separates Quantum and Classical Query Complexity
- The Solovay-Kitaev algorithm
- A Brief Introduction to Quantum Query Complexity
- Hamiltonian Simulation with Optimal Sample Complexity
- Vanishing-Error Approximate Degree and QMA Complexity
- Probabilistically Checking Quantum Proofs, with Interaction
- Quantum Interactive Oracle Proofs
- Fixed-point quantum search with an optimal number of queries
Related papers
- The Proof Analysis Problem for Constant-Depth Frege
- Hardness of Counting Orderings: Taking Gadget Amplification to the Limit
- Rigorous Low-Degree Implications for Planted Subgraph Detection: Noise and Treewidth
- Parameterized Hardness of Zonotope Containment and Neural Network Verification
- From Block Orthogonality to Decidability in Complex-Weighted Counting CSP
- Random Clocks on Computation Paths: How Far Can They Reach, and When Does Stepping Back Help?