Verifiable Quantum Advantage and Computation via Quantum Circuit Obfuscation

arXiv:2609.40289 · quant-ph, cs.CR · Submitted 2026-09-30 · Read on arXiv

quant-ph, cs.CR

Submitted: 2026-09-30

Updated: 2026-10-02

Terminology

• Verification — 75× in this paper · explained in 2 episodes
• BQP — 63× in this paper · explained in 2 episodes
• Verifier — 46× in this paper · explained in 2 episodes
• Quantum Circuits — 18× in this paper · explained in 2 episodes
• Ancilla Qubits — 3× in this paper · explained in 1 episode
• Verifiability — 3× in this paper · explained in 2 episodes
• Accuracy — 2× in this paper · explained in 1 episode
• Trace — 2× in this paper · explained in 2 episodes
• Trace Distance — 2× in this paper · explained in 3 episodes
• AUC — 1× in this paper · explained in 2 episodes
• Adam — 1× in this paper · explained in 2 episodes
• Annual ACM Symposium on Theory of Computing — 1× in this paper
• Benchmarking — 1× in this paper · explained in 3 episodes
• Generalization — 1× in this paper · explained in 13 episodes
• IEEE Symposium on Foundations of Computer Science — 1× in this paper
• Sample Complexity — 1× in this paper · explained in 15 episodes
• Transformer — 1× in this paper · explained in 2 episodes

Sources

• On verifiable quantum advantage with peaked circuit sampling

Related papers

• Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
• Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
• Polynomial-time classical and quantum simulation of quantum impurity models
• Theory of quantum-enhanced interferometry with general Markovian light sources
• A convergent hierarchy of spectral gap certificates for qubit Hamiltonians
• Universal Bound and Phase Transition in Many-Body Fermionic Non-Gaussianity