Tests for "Quantumness"
summary
The core is the CHSH game: two noncommunicating devices get random bits and output bits, a classical strategy tops out at 3/4 vs 0.85 (cos^2(pi/8)) while entangled qubits reach ~0.85, so a Bell-violation certifies fresh randomness. A rigidity theorem says near-optimal CHSH performance forces a Bell pair and the specific measurements up to local unitaries, which gives CHSH game–based device-independent randomness and QKD (monogamy makes the randomness private), and lets a mostly classical verifier direct or certify untrusted quantum devices.
AI-written summary · about
chapters (9)
- 0:00The nature of quantumness
- 2:57The CHSH game test
- 6:03Quantum versus classical
- 12:20Optimal strategy and XOR games
- 14:44Certified randomness
- 20:05Quantum cryptography
- 24:27Rigidity and verification
- 29:27Testing quantum mechanics
- 32:31Q&A session
related talks
01h 00mQuantum Physics for Software Developers
45mClassical Verification of Quantum Computational Advantage
31mDemonstrating an Unconditional Separation Between Quantum and Classical Information Resources
01h 10mQuantum Advantage with Shallow Clifford Circuits
01h 09mRecent Progress in Quantum Advantage
38mQuantum Technologies: Quantum Computing & Secure Quantum Communication
01h 08mPutting Quantum Supremacy on a Rigorous Footing
23mCommunity keynote - Quantum Computing: Mind-bogglingly weird!