Classical Verification of Quantum Computations by Asst. Prof Urmila Mahadev

How can quantum computers be classically tested? This challenging question is interesting as a novel question about interactive proofs, as a practical question about the testing of near-term quantum devices, and as a philosophical question about the testing of quantum mechanics in the limit of high complexity. In this talk, Prof Mahadev shows how classical cryptography provides an elegant solution to this question. This talk will not assume prior knowledge of quantum computing or cryptography.