A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device

DOI10.1145/3441309OpenAlexW3201027275WikidataQ114846496 ScholiaQ114846496MaRDI QIDQ5056420

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

Publication date: 8 December 2022

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1804.00640

zbMATH Keywords

quantum interactive proofscertified randomnesstest of quantumness

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (13)

Classical Verification of Quantum Computations ⋮ Candidate trapdoor claw-free functions from group actions with applications to quantum protocols ⋮ Another round of breaking and making quantum money: how to not build it from lattices, and more ⋮ From the hardness of detecting superpositions to cryptography: quantum public key encryption and commitments ⋮ Quantum encryption with certified deletion, revisited: public key, attribute-based, and classical communication ⋮ Constructive post-quantum reductions ⋮ Post-quantum insecurity from LWE ⋮ Simple tests of quantumness also certify qubits ⋮ Quantum money with mintage supervision ⋮ Secure quantum computation with classical communication ⋮ Secure software leasing from standard assumptions ⋮ Verifying quantum computations at scale: A cryptographic leash on quantum devices ⋮ Classical Homomorphic Encryption for Quantum Circuits

This page was built for publication: A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device