Certified randomness from quantum supremacy

DOI10.1145/3564246.3585145WikidataQ130911366 ScholiaQ130911366MaRDI QIDQ6499275

Shih-Han Hung, Scott Aaronson

Publication date: 8 May 2024

zbMATH Keywords

certified randomnessrandom circuit sampling

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Local random quantum circuits are approximate polynomial-designs
• Classical vs quantum random oracles
• Entropy accumulation
• A full characterization of quantum advice
• Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
• Trevisan's Extractor in the Presence of Quantum Side Information
• Robust Protocols for Securely Expanding Randomness and Distributing Keys Using Untrusted Quantum Devices
• Strong Direct Product Theorems for Quantum Communication and Query Complexity
• A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device
• Infinite randomness expansion with a constant number of devices
• Universal Security for Randomness Expansion from the Spot-Checking Protocol
• Certifiable quantum dice
• The computational complexity of linear optics
• Extractors and pseudorandom generators
• Oracle Separation of BQP and PH

This page was built for publication: Certified randomness from quantum supremacy