Analysis of a Programmable Quantum Annealer as a Random Number Generator
Elijah Pelofske

TL;DR
This study evaluates the randomness quality of a D-Wave 2000Q quantum annealer's output, finding it biased and not suitable as an unbiased quantum random number generator without post-processing.
Contribution
It provides the first large-scale experimental analysis of quantum annealer outputs as random number generators using extensive NIST tests and entropy estimates.
Findings
Generated bits are biased and predictable.
Min-entropy per bit is 0.824 without post-processing.
Large dataset of over 20 billion bits analyzed.
Abstract
Quantum devices offer a highly useful function - that is generating random numbers in a non-deterministic way since the measurement of a quantum state is not deterministic. This means that quantum devices can be constructed that generate qubits in a uniform superposition and then measure the state of those qubits. If the preparation of the qubits in a uniform superposition is unbiased, then quantum computers can be used to create high entropy, secure random numbers. Quantum annealing (QA) is a type of analog quantum computation that is a relaxed form of adiabatic quantum computation and uses quantum fluctuations in order to search for ground state solutions of a programmable Ising model. Here we present extensive experimental random number results from a D-Wave 2000Q quantum annealer, totaling over 20 billion bits of QA measurements, which is significantly larger than previous D-Wave QA…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Advanced Data Storage Technologies · Neural Networks and Applications
