On protocols for increasing the uniformity of random bits generated with noisy quantum computers

Generating random numbers is important for many real-world applications, including cryptography, statistical sampling and Monte Carlo simulations. Quantum systems subject to a measurement produce random results via Born’s rule, and thus it is natural to study the possibility of using such systems in order to generate high-quality random numbers. However, current quantum devices are subject to errors and noise, which can make the output bits deviate from the uniform distribution. In this work, we propose and analyse two protocols that can be used to increase the uniformity of the bits obtained when running a circuit with a Hadamard gate and a measurement in a noisy quantum computer. These protocols may be used prior to other standard processes, such as randomness amplification. We conduct experiments on both a quantum simulator and a real quantum computer, obtaining results that suggest that these protocols are useful to improve the probability of the generated bits passing statistical tests for uniformity.

[1]  Elaine B. Barker,et al.  A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications , 2000 .

[2]  Peter W. Glynn,et al.  Stochastic Simulation: Algorithms and Analysis , 2007 .

[3]  Kentaro Tamura,et al.  Quantum Random Numbers generated by the Cloud Superconducting Quantum Computer , 2019, ArXiv.

[4]  Quan Xu,et al.  A Survey on True Random Number Generators Based on Chaos , 2019, Discrete Dynamics in Nature and Society.

[5]  Maciej Lewenstein,et al.  Randomness in quantum mechanics: philosophy, physics and technology , 2016, Reports on progress in physics. Physical Society.

[6]  Wayne H. Enright,et al.  Robust and reliable defect control for Runge-Kutta methods , 2007, TOMS.

[7]  Zhu Cao,et al.  Quantum random number generation , 2015, npj Quantum Information.

[8]  Antonio Acín,et al.  Certified randomness in quantum physics , 2016, Nature.

[9]  Christophe Guyeux,et al.  Survey on hardware implementation of random number generators on FPGA: Theory and experimental analyses , 2018, Comput. Sci. Rev..

[10]  Michael Luby,et al.  Pseudorandomness and cryptographic applications , 1996, Princeton computer science notes.

[11]  Pierre L'Ecuyer,et al.  TestU01: A C library for empirical testing of random number generators , 2006, TOMS.

[12]  Elías F. Combarro,et al.  A Quantum Algorithm for the Commutativity of Finite Dimensional Algebras , 2019, IEEE Access.

[13]  Peter W. Shor,et al.  Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[14]  M. Born,et al.  Statistical Interpretation of Quantum Mechanics. , 1955, Science.

[15]  P. L’Ecuyer Random Number Generation , 2012 .

[16]  Ronen Shaltiel,et al.  An Introduction to Randomness Extractors , 2011, ICALP.

[17]  Lorenzo Moneta,et al.  Review of High-Quality Random Number Generators , 2019, Computing and Software for Big Science.

[18]  Yang Liu,et al.  Device-independent quantum random-number generation , 2018, Nature.

[19]  Miguel Herrero-Collantes,et al.  Quantum random number generators , 2016, 1604.03304.

[20]  Lov K. Grover A fast quantum mechanical algorithm for database search , 1996, STOC '96.

[21]  Richard M. Karp,et al.  An introduction to randomized algorithms , 1991, Discret. Appl. Math..

[22]  Mario Stipcevic,et al.  True Random Number Generators , 2014, Open Problems in Mathematics and Computational Science.

[23]  A. Zeilinger,et al.  A snapshot of foundational attitudes toward quantum mechanics , 2013, 1301.1069.

[24]  I. Chuang,et al.  Quantum Computation and Quantum Information: Bibliography , 2010 .

[25]  J. Gentle Random number generation and Monte Carlo methods , 1998 .