Realistic noise-tolerant randomness amplification using finite number of devices

Randomness is a fundamental concept, with implications from security of modern data systems, to fundamental laws of nature and even the philosophy of science. Randomness is called certified if it describes events that cannot be pre-determined by an external adversary. It is known that weak certified randomness can be amplified to nearly ideal randomness using quantum-mechanical systems. However, so far, it was unclear whether randomness amplification is a realistic task, as the existing proposals either do not tolerate noise or require an unbounded number of different devices. Here we provide an error-tolerant protocol using a finite number of devices for amplifying arbitrary weak randomness into nearly perfect random bits, which are secure against a no-signalling adversary. The correctness of the protocol is assessed by violating a Bell inequality, with the degree of violation determining the noise tolerance threshold. An experimental realization of the protocol is within reach of current technology.

[1]  Adrian Kent,et al.  No signaling and quantum key distribution. , 2004, Physical review letters.

[2]  Jan Bouda,et al.  Device-independent randomness extraction from an arbitrarily weak min-entropy source , 2014 .

[3]  Matthew Coudron,et al.  Infinite randomness expansion with a constant number of devices , 2014, STOC.

[4]  Le Phuc Thinh,et al.  Min-entropy sources for Bell tests , 2014 .

[5]  Mario Berta,et al.  Quantum-Proof Randomness Extractors via Operator Space Theory , 2014, IEEE Transactions on Information Theory.

[6]  Alastair Kay,et al.  Limited measurement dependence in multiple runs of a Bell test , 2013, 1304.4904.

[7]  Remigiusz Augusiak,et al.  Monogamies of correlations and amplification of randomness , 2013 .

[8]  Lluis Masanes,et al.  Universally-composable privacy amplification from causality constraints , 2008, Physical review letters.

[9]  Robert König,et al.  Universally Composable Privacy Amplification Against Quantum Adversaries , 2004, TCC.

[10]  Miklos Santha,et al.  Generating Quasi-Random Sequences from Slightly-Random Sources (Extended Abstract) , 1984, FOCS.

[11]  G. Tóth,et al.  Bell inequalities for graph states. , 2004, Physical review letters.

[12]  Debbie W. Leung,et al.  The Universal Composable Security of Quantum Key Distribution , 2004, TCC.

[13]  Aram Wettroth Harrow,et al.  Quantum de Finetti Theorems Under Local Measurements with Applications , 2012, STOC '13.

[14]  Guy Kindler,et al.  Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors , 2005, STOC '05.

[15]  Karol Horodecki,et al.  Realistic noise-tolerant randomness amplification using finite number of devices , 2013, Nature Communications.

[16]  Adrian Kent,et al.  Private randomness expansion with untrusted devices , 2010, 1011.4474.

[17]  Stefano Pironio,et al.  Randomness versus nonlocality and entanglement. , 2011, Physical review letters.

[18]  Serge Fehr,et al.  Security and Composability of Randomness Expansion from Bell Inequalities , 2011, ArXiv.

[19]  Matthew Coudron,et al.  Robust Randomness Amplifiers: Upper and Lower Bounds , 2013, APPROX-RANDOM.

[20]  Roger Colbeck,et al.  Free randomness can be amplified , 2011, Nature Physics.

[21]  J. S. BELLt.  Einstein-Podolsky-Rosen Paradox , 2018 .

[22]  Yaoyun Shi,et al.  Physical Randomness Extractors: Generating Random Numbers with Minimal Assumptions , 2014, 1402.4797.

[23]  Anup Rao,et al.  Extractors for a constant number of polynomially small min-entropy independent sources , 2006, STOC '06.

[24]  Stefano Pironio,et al.  Security of practical private randomness generation , 2011, 1111.6056.

[25]  Oded Goldreich,et al.  Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity , 1988, SIAM J. Comput..

[26]  Xin Li,et al.  Extractors for a Constant Number of Independent Sources with Polylogarithmic Min-Entropy , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

[27]  Ran Raz,et al.  Extractors with weak random seeds , 2005, STOC '05.

[28]  Jan Bouda,et al.  Device-independent Randomness Extraction for Arbitrarily Weak Min-entropy Source , 2014, TQC.

[29]  Karol Horodecki,et al.  Robust Device-Independent Randomness Amplification with Few Devices , 2013, 1310.4544.

[30]  Rodrigo Gallego,et al.  Full randomness from arbitrarily deterministic events , 2012, Nature Communications.

[31]  M. Plesch,et al.  Device-independent randomness amplification with a single device , 2013, 1305.0990.

[32]  Rodrigo Gallego,et al.  Robust amplification of Santha-Vazirani sources with three devices , 2015 .

[33]  Karol Horodecki,et al.  Free randomness amplification using bipartite chain correlations , 2013, 1303.5591.

[34]  Renato Renner,et al.  Efficient Device-Independent Quantum Key Distribution , 2010, EUROCRYPT.

[35]  M. Hall.  Local deterministic model of singlet state correlations based on relaxing measurement independence. , 2010, Physical review letters.

[36]  Yaoyun Shi,et al.  Robust protocols for securely expanding randomness and distributing keys using untrusted quantum devices , 2014, STOC.

[37]  Stefano Pironio,et al.  Random numbers certified by Bell’s theorem , 2009, Nature.

[38]  Umesh V. Vazirani,et al.  Certifiable Quantum Dice - Or, testable exponential randomness expansion , 2011, 1111.6054.

[39]  Umesh Vazirani,et al.  Fully device-independent quantum key distribution. , 2012, 1210.1810.

[40]  David Zuckerman,et al.  Explicit two-source extractors and resilient functions , 2016, Electron. Colloquium Comput. Complex..

[41]  N. Gisin,et al.  How much measurement independence is needed to demonstrate nonlocality? , 2010, Physical review letters.

[42]  Ekert,et al.  Quantum cryptography based on Bell's theorem. , 1991, Physical review letters.

[43]  Aram Wettroth Harrow,et al.  Product-state approximations to quantum ground states , 2013, STOC '13.