True randomness from realistic quantum devices

Even if the output of a Random Number Generator (RNG) is perfectly uniformly distributed, it may be correlated to pre-existing information and therefore be predictable. Statistical tests are thus not sufficient to guarantee that an RNG is usable for applications, e.g., in cryptography or gambling, where unpredictability is important. To enable such applications a stronger notion of randomness, termed "true randomness", is required, which includes independence from prior information. Quantum systems are particularly suitable for true randomness generation, as their unpredictability can be proved based on physical principles. Practical implementations of Quantum RNGs (QRNGs) are however always subject to noise, i.e., influences which are not fully controlled. This reduces the quality of the raw randomness generated by the device, making it necessary to post-process it. Here we provide a framework to analyse realistic QRNGs and to determine the post-processing that is necessary to turn their raw output into true randomness.

[1]  Roger Colbeck,et al.  Quantum And Relativistic Protocols For Secure Multi-Party Computation , 2009, 0911.3814.

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

[3]  Barbara M. Terhal,et al.  The Bounded-Storage Model in the Presence of a Quantum Adversary , 2008, IEEE Transactions on Information Theory.

[4]  Larry Carter,et al.  Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..

[5]  Noam Nisan,et al.  Randomness is Linear in Space , 1996, J. Comput. Syst. Sci..

[6]  Larry Carter,et al.  New Hash Functions and Their Use in Authentication and Set Equality , 1981, J. Comput. Syst. Sci..

[7]  Arjen K. Lenstra,et al.  Public Keys , 2012, CRYPTO.

[8]  Roger Colbeck,et al.  A short note on the concept of free choice , 2013, 1302.4446.

[9]  Roger Colbeck,et al.  No extension of quantum theory can have improved predictive power , 2010, Nature communications.

[10]  Ming Li,et al.  An Introduction to Kolmogorov Complexity and Its Applications , 2019, Texts in Computer Science.

[11]  Russell Impagliazzo,et al.  How to recycle random bits , 1989, 30th Annual Symposium on Foundations of Computer Science.

[12]  A. Rollett,et al.  The Monte Carlo Method , 2004 .

[13]  Amnon Ta-Shma,et al.  Better short-seed quantum-proof extractors , 2010, Theor. Comput. Sci..

[14]  Renato Renner,et al.  Security of quantum key distribution , 2005, Ausgezeichnete Informatikdissertationen.

[15]  Ueli Maurer,et al.  Generalized privacy amplification , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.

[16]  Robert König,et al.  The Operational Meaning of Min- and Max-Entropy , 2008, IEEE Transactions on Information Theory.

[17]  Amnon Ta-Shma,et al.  Short seed extractors against quantum storage , 2008, STOC '09.

[18]  Giacomo Mauro D'Ariano,et al.  Classical randomness in quantum measurements , 2004, quant-ph/0408115.

[19]  Gilles Brassard,et al.  Privacy Amplification by Public Discussion , 1988, SIAM J. Comput..

[20]  Huang Zhun,et al.  A truly random number generator based on thermal noise , 2001, ASICON 2001. 2001 4th International Conference on ASIC Proceedings (Cat. No.01TH8549).

[21]  Luca Trevisan,et al.  Extractors and pseudorandom generators , 2001, JACM.

[22]  Mario Stipcevic,et al.  Quantum random number generators and their use in cryptography , 2011, 2011 Proceedings of the 34th International Convention MIPRO.

[23]  M. Fannes,et al.  Continuity of quantum conditional information , 2003, quant-ph/0312081.

[24]  Douglas R Stinson,et al.  Universal hash families and the leftover hash lemma, and applications to cryptography and computing , 2010 .

[25]  U. Leonhardt.  Quantum physics of simple optical instruments , 2003, quant-ph/0305007.

[26]  Anindya De,et al.  Trevisan's Extractor in the Presence of Quantum Side Information , 2009, SIAM J. Comput..

[27]  Thierry Paul,et al.  Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.

[28]  He Xu,et al.  Postprocessing for quantum random number generators: entropy evaluation and randomness extraction , 2012, ArXiv.

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

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

[31]  L. Fortnow,et al.  Recent Developments in Explicit Constructions of Extractors , 2002, Bull. EATCS.

[32]  Renato Renner,et al.  An intuitive proof of the data processing inequality , 2011, Quantum Inf. Comput..

[33]  A. Peres.  Neumark's theorem and quantum inseparability , 1990 .

[34]  R. Dong,et al.  A generator for unique quantum random numbers based on vacuum states , 2010 .