Cloud Quantum Computer Random Number Generation for Cryptography

Abstract

Creating a true random number generator is a difficult problem that may be solved by leveraging quantum computing. A simple quantum random number generation program involves applying the Hadamard gate to all qubits then measuring each qubit for random data, repeating the program to obtain the desired bitstring length. Implementing this algorithm on IBM’s Manila and Rigetti’s Aspen-9 quantum computers, we obtained a sample of 1,000,000 potentially random bits. In this thesis, we evaluate the quality of random bits generated by using quantum computers as a hardware random number generator with statistical testing and present the implications of those results.