2013/10/24 by Matthew Coudron, Henry Yuen, Coudron, Matthew +1 · 1 citation
Computer Science · Physics and Astronomy · #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum Physics (quant-ph)
paper · pdf · doi:10.48550/arxiv.1310.6755
openalex publication_date 2013/10/24 · openalex created_date 2022/09/05 · openalex updated_date 2026/07/28
We present a device-independent randomness expansion protocol, involving only\na constant number of non-signaling quantum devices, that achieves\n\infinite expansion: starting with m bits of uniform private\nrandomness, the protocol can produce an unbounded amount of certified\nrandomness that is \exp(-\Ω(m1/3))-close to uniform and secure against\na quantum adversary. The only parameters which depend on the size of the input\nare the soundness of the protocol and the security of the output (both are\ninverse exponential in m). This settles a long-standing open problem in the\narea of randomness expansion and device-independence.\n The analysis of our protocols involves overcoming fundamental challenges in\nthe study of \adaptive device-independent protocols. Our primary\ntechnical contribution is the design and analysis of device-independent\nprotocols which are \Input Secure; that is, their output is guaranteed to\nbe secure against a quantum eavesdropper, \even if the input randomness\nwas generated by that same eavesdropper!\n The notion of Input Security may be of independent interest to other areas\nsuch as device-independent quantum key distribution.\n