
Quantum Foundations Podcast Quantum, cryptography & metacomplexity with Oxford Computer Scientist Matthew Gray
17 snips
Dec 10, 2025 In this discussion, Matthew Gray, an Oxford Computer Science PhD student, explores the intriguing intersection of quantum computing and cryptography. He unpacks quantum post-quantum cryptography, revealing how layers of complexity can be navigated. The conversation delves into the dangers posed by quantum adversaries to classical systems and highlights innovative crypto proposals like isogeny-based schemes. Matthew also discusses fundamental concepts of metacomplexity and what potential new physics might imply for computing and security. Prepare for a mind-bending journey!
AI Snips
Chapters
Transcript
Episode notes
Quantum Computation Is Fundamentally Different
- Quantum computers perform computations by exploiting superposition and interference, achieving tasks humans cannot do in the same way.
- This fundamentally different model reshapes what problems we can solve and how we reason about computation.
Shor's Algorithm Drives Quantum Interest
- Shor's algorithm lets quantum computers break widely used classical cryptography like RSA and Diffie-Hellman.
- That capability drives major investment and motivates developing post-quantum alternatives.
Use Well‑Studied Hard Problems For Crypto
- Prove crypto by reducing it to a well-studied hard math problem and watch the community attack that assumption over years.
- Rely on broad scrutiny rather than short-term confidence when adopting new cryptosystems.
