2017/07/20 by Carl A. Miller, Miller, Carl A.
Computer Science · Mathematics · Physics and Astronomy · #Benford’s Law and Fraud Detection #Computability, Logic, AI Algorithms #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Mechanics and Applications #Quantum Physics (quant-ph) #quant-ph
paper · pdf · doi:10.48550/arxiv.1707.06597
v2: Minor corrections and revisions. 6 pages
openalex publication_date 2017/07/20 · arxiv created 2018/05/10 · arxiv updated 2018/05/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The field of device-independent quantum cryptography has seen enormous success in the past several years, including security proofs for key distribution and random number generation that account for arbitrary imperfections in the devices used. Full security proofs in the field so far are long and technically deep. In this paper we show that the concept of the mirror adversary can be used to simplify device-independent proofs. We give a short proof that any bipartite Bell violation can be used to generate private random numbers. The proof is based on elementary techniques and is self-contained.