Von Neumann Normalisation of a Quantum Random Number Generator
Alastair A. Abbott, Cristian S. Calude

TL;DR
This paper analyzes von Neumann un-biasing for quantum random number generators, demonstrating conditions for ideal and real cases, and discussing effects on randomness and bias drift in finite and infinite sequences.
Contribution
It provides a rigorous framework for von Neumann normalisation in quantum RNGs, including ideal and real scenarios, and examines its impact on sequence randomness.
Findings
Ideal un-biasing relies on source independence.
Real cases can approximate un-biasing if bias drifts slowly.
Normalisation can alter the algorithmic randomness of sequences.
Abstract
In this paper we study von Neumann un-biasing normalisation for ideal and real quantum random number generators, operating on finite strings or infinite bit sequences. In the ideal cases one can obtain the desired un-biasing. This relies critically on the independence of the source, a notion we rigorously define for our model. In real cases, affected by imperfections in measurement and hardware, one cannot achieve a true un-biasing, but, if the bias "drifts sufficiently slowly", the result can be arbitrarily close to un-biasing. For infinite sequences, normalisation can both increase or decrease the (algorithmic) randomness of the generated sequences. A successful application of von Neumann normalisation---in fact, any un-biasing transformation---does exactly what it promises, un-biasing, one (among infinitely many) symptoms of randomness; it will not produce "true" randomness.
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.
