
How Low Can We Go? Exploring Minimal Assumptions in Quantum Cryptography
Dakshita Khurana, a computer scientist at the University of Illinois Urbana-Champaign, argues that quantum cryptography can be built on surprisingly weak assumptions compared to its classical counterpart. Speaking in the Institute for Advanced Study's Computer Science/Discrete Mathematics seminar, she walks through quantum encryption, signatures, and quantum money, showing how each of these primitives implies the existence of one-way puzzles, a quantum analogue of the one-way functions that underpin classical cryptography. She then discusses concrete assumptions sufficient to realize one-way puzzles and traces their surprising links to quantum advantage, the question of what quantum computers can do that classical ones cannot. The talk, drawing on joint work with Kabir Tomer, assumes no prior background in quantum computing and is aimed at a general computer science audience. It covers both the technical primitives and the broader question of how minimal a foundation secure quantum protocols actually require.