A cryptographic test of quantumness and certifiable randomness from a single quantum device

DOI10.1109/FOCS.2018.00038MaRDI QIDQ6944376zbMATH OpenFDO

Authors Paul Christiano, Thomas Vidick, Umesh V. Vazirani, Urmila Mahadev, Zvika Brakerski

Publication date 12 August 2025

Full work available at URL https://resolver.caltech.edu/CaltechAUTHORS:20210921-144712064

Mathematics Subject Classification ID

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

Cited in

(16)

• Authenticated sublinear quantum private information retrieval
• Compiled nonlocal games from any trapdoor claw-free function
• On the power of oblivious state preparation
• On one-shot signatures, quantum vs. classical binding, and obfuscating permutations
• Public-key pseudoentanglement and the hardness of learning ground state entanglement structure
• Quantum money from abelian group actions
• Lossy cryptography from code-based assumptions dense-sparse LPN: a new subexponentially hard LPN variant in SZK
• Adaptive hardcore bit and quantum key leasing over classical channel from LWE with polynomial modulus
• Verifiable quantum advantage without structure
• Self-testing of a single quantum device under computational assumptions
• Non-interactive zero-knowledge arguments with certified deletion
• Fully-homomorphic encryption from lattice isomorphism
• How to verify that a small device is quantum, unconditionally
• A modular approach to succinct arguments for QMA
• On quantum simulation-soundness
• Zero-knowledge proofs of quantumness

This page was built for publication: A cryptographic test of quantumness and certifiable randomness from a single quantum device

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