Certified Randomness without Structure Against Shallow-Query Adversaries

arXiv:2608.24832 · quant-ph, cs.CR · Submitted 2026-08-25 · Read on arXiv

quant-ph, cs.CR

Submitted: 2026-08-25

Updated: 2026-08-25

Terminology

• Verifier — 8× in this paper · explained in 2 episodes
• Adam — 1× in this paper · explained in 2 episodes
• Core — 1× in this paper · explained in 2 episodes
• Fidelity — 1× in this paper · explained in 2 episodes
• Query Complexity — 1× in this paper · explained in 2 episodes
• Trace — 1× in this paper · explained in 2 episodes
• Trace Distance — 1× in this paper · explained in 3 episodes
• Verification — 1× in this paper · explained in 2 episodes

Sources

• Quantum And Relativistic Protocols For Secure Multi-Party Computation
• Efficient Certifiable Randomness from a Single Quantum Device

Related papers

• Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
• Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
• Polynomial-time classical and quantum simulation of quantum impurity models
• Theory of quantum-enhanced interferometry with general Markovian light sources
• A convergent hierarchy of spectral gap certificates for qubit Hamiltonians
• Universal Bound and Phase Transition in Many-Body Fermionic Non-Gaussianity