Cryptology ePrint Archive: Report 2020/078

Quantum Random Number Generation with the Superconducting Quantum Computer IBM 20Q Tokyo

Kentaro Tamura and Yutaka Shikano

Abstract: Quantum random number generators (QRNGs) produce theoretically unpredictable random numbers. A typical QRNG is implemented in quantum optics [Herrero-Collantes, M., Garcia-Escartin, J. C.: Quantum Random Number Generators. Rev. Mod. Phys. \textbf{89}, 015004 (2017)]. Quantum computers become QRNGs when given certain programs. The simplest example of such a program applies the Hadamard gate on all qubits and performs measurement. As a result of repeatedly running this program on a 20-qubit superconducting quantum computer (IBM 20Q Tokyo), we obtained a sample with a length of 43,560. However, statistical analysis showed that this sample was biased and correlated. One of the post-processed samples passed statistical tests. To show the effectiveness of post-processing, a larger sample size is required. The present study of quantum random number generation and statistical testing may provide a potential candidate for benchmarking tests of actual quantum computing devices.

Category / Keywords: foundations / pseudo-randomness, quantum random number generator

Original Publication (in the same form): TUCS Lecture Notes 30, 13 - 25 (2019)

Date: received 25 Jan 2020, last revised 26 Jan 2020

Contact author: cicero at keio jp,yutaka shikano@keio jp

Available format(s): PDF | BibTeX Citation

Note: Published version of Proceedings of Workshop on Quantum Computing and Quantum Information edited by Mika Hirvensalo and Abuzer Yakaryilmaz held on June 7th, 2019 at Fuchu, Tokyo.

Version: 20200126:230308 (All versions of this report)

Short URL: ia.cr/2020/078


[ Cryptology ePrint archive ]