Classical verification of quantum computations

DOI10.1109/FOCS.2018.00033MaRDI QIDQ6944381zbMATH OpenFDO

Authors Urmila Mahadev

Publication date 12 August 2025

Full work available at URL https://resolver.caltech.edu/CaltechAUTHORS:20200805-144416533

Mathematics Subject Classification ID

Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cited in

(15)

• Quantum delegation with an off-the-shelf device
• Authenticated sublinear quantum private information retrieval
• Compiled nonlocal games from any trapdoor claw-free function
• Succinct arguments for \textsf{BatchQMA} and friends under 8 rounds
• On the power of oblivious state preparation
• Quantum detection of recurrent dynamics
• Quantum key leasing for PKE and FHE with a classical lessor
• Parity vs. \(\text{AC}^0\) with simple quantum preprocessing
• Classical verification of quantum learning
• Lossy cryptography from code-based assumptions dense-sparse LPN: a new subexponentially hard LPN variant in SZK
• Partial blind quantum computation: a framework for selective circuit protection
• Adaptive hardcore bit and quantum key leasing over classical channel from LWE with polynomial modulus
• Self-testing of a single quantum device under computational assumptions
• How to verify that a small device is quantum, unconditionally
• A modular approach to succinct arguments for QMA

This page was built for publication: Classical verification of quantum computations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6944381)