Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1012.1960 · Mathematical Structures in Computer Science

A quantum random number generator certified by value indefiniteness

Alastair A. Abbott, Cristian S. Calude, Karl Svozil

Published Mar 28, 2014• 23 citations
arXivHTMLPDF

Abstract

In this paper we propose a quantum random number generator (QRNG) that uses an entangled photon pair in a Bell singlet state and is certified explicitly by value indefiniteness. While ‘true randomness’ is a mathematical impossibility, the certification by value indefiniteness ensures that the quantum random bits are incomputable in the strongest sense. This is the first QRNG setup in which a physical principle (Kochen–Specker value indefiniteness) guarantees that no single quantum bit that is produced can be classically computed (reproduced and validated), which is the mathematical form of bitwise physical unpredictability. We discuss the effects of various experimental imperfections in detail: in particular, those related to detector efficiencies, context alignment and temporal correlations between bits. The analysis is very relevant for the construction of any QRNG based on beam-splitters. By measuring the two entangled photons in maximally misaligned contexts and using the fact that two bitstrings, rather than just one, are obtained, more efficient and robust unbiasing techniques can be applied. We propose a robust and efficient procedure based onXORing the bitstrings together – essentially using one as a one-time-pad for the other – to extract random bits in the presence of experimental imperfections, as well as a more efficient modification of the von Neumann procedure for the same task. We also discuss some open problems.

DOI
10.1017/s0960129512000692

Related papers

Quantum Random Numbers: Certication and Generation

Alastair A. Abbott

In this thesis we study the generation of randomness from quantum mechanical sources: quantum random number generators (QRNGs). Such devices are thought to provide a better quality of randomness than is possible with classical devices, but the issue is in need of more rigorous study. In Chapter 1 we provide the necessary background for the thesis from both computability and probability theory. We then present and extend some recent results providing a more theoretical grounding for the indeterminism in quantum mechanics. In particular, we show that sequences of quantum random bits are incomputable in the strongest sense: no bit can be provably computed in advance. In Chapter 2 we study in detail the use of von Neumann normalisation for QRNGs producing both finite strings and infinite sequences of bits; such normalisation methods are necessary in order to counter for experimental imperfections. We show that, in the case of a constantly biased source, this normalisation gives the desired uniform distribution. The effect of this normalisation on the (in)computability of the generated sequences is studied, and it is shown that algorithmic randomness and Borel normality are preserved, but e-randomness (and thus incomputability) is, in general, not. Experimental bounds for the extent of departure from the uniform distribution in the non-ideal case of a slowly drifting bias are derived. In Chapter 3 we propose a new QRNG which uses entangled photon pairs and is certified to produce incomputable bits by value indefiniteness; this is the first QRNG with explicit certification by a physical principle. The effects of various experimental imperfections are discussed in detail, and care is taken to make the proposed QRNG as robust as is possible to these. A robust method based on XORing the produced bitstrings together is proposed to further improve the quality of the distribution produced by the QRNG. Various improvements and optimisations to this scheme are discussed.

•Jan 1, 2011•0 citations

Realization of a Quantum Random Generator Certified with the Kochen-Specker Theorem

Anatoly Kulikov, Markus Jerger, Anton Potočnik +2 more

Random numbers are required for a variety of applications from secure communications to Monte Carlo simulation. Yet randomness is an asymptotic property, and no output string generated by a physical device can be strictly proven to be random. We report an experimental realization of a quantum random number generator (QRNG) with randomness certified by quantum contextuality and the Kochen-Specker theorem. The certification is not performed in a device-independent way but through a rigorous theoretical proof of each outcome being value indefinite even in the presence of experimental imperfections. The analysis of the generated data confirms the incomputable nature of our QRNG.

arXiv:1709.03687•Physical Review Letters•Dec 11, 2017•36 citations

Novel Quantum Random Number Generator with the Improved Certification Method

Maksim Iavich, Tamari Kuchukhidze, Giorgi Iashvili +2 more

Random numbers play an important role in many areas, for example, encryption, cryptography, static analysis, simulations.It is also a fundamental resource in science and engineering.There are algorithmically generated numbers that are similar to random distributions, but are not actually random, called pseudo random number generators.In many cases the tasks to be solved are based on the unpredictability of random numbers, which cannot be guaranteed in the case of pseudo random number generators, true randomness is required.In such situations, we use real random number generators whose source of randomness is unpredictable random events.Quantum Random Number Generators (QRNGs) generate real random numbers based on the inherent randomness of quantum measurements.Our goal is to generate fast random numbers at a lower cost.At the same time, a high level of randomness is essential.Through quantum mechanics, we can obtain true numbers using the unpredictable behavior of a photon, which is the basis of many modern cryptographic protocols.It is essential to trust cryptographic random number generators to generate only true random numbers.This is why certification methods are needed which will check both the operation of the device and the quality of the random bits generated.We present the improved novel quantum random number generator, which is based the on time of arrival QRNG.It uses the simple version of the detectors with few requirements.The novel QRNG produces more than one random bit per each photon detection.It is rather efficient and has a high level of randomness.Self-testing as well as device independent quantum random number generation methods are analyzed.The advantages and disadvantages of both methods are identified.The model of a novel semi self-testing certification method for quantum random number generators (QRNG) is offered in the paper.This method combines different types of certification approaches and is rather secure and efficient.Finally, the novel certification method is integrated into the model of the new quantum random number generator.The paper analyzes its security and efficiency.

International Journal of Mathematical Sciences and Computing•Aug 8, 2021•4 citations

Binary Quantum Random Number Generator Based on Value Indefinite Observables

Karl Svozil, Cristian S. Calude

Abstract All quantum random number generators based on measuring value indefinite observables are at least three-dimensional because the Kochen-Specker Theorem and the Located Kochen-Specker Theorem are false in dimension two. In this article, we construct quantum random number generators based on measuring a three-dimensional value indefinite observable that generate binary quantum random outputs with the same randomness qualities as the ternary ones: the outputs are maximally unpredictable.

•Mar 6, 2024•0 citations

Binary quantum random number generator based on value indefinite observables

Cristian S. Calude, Karl Svozil

All quantum random number generators based on measuring value indefinite observables are at least three-dimensional because the Kochen-Specker Theorem and the Located Kochen-Specker Theorem are false in dimension two. In this article, we construct quantum random number generators based on measuring a three-dimensional value indefinite observable that generates binary quantum random outputs with the same randomness qualities as the ternary ones: the outputs are maximally unpredictable.

arXiv:2312.10973•Scientific Reports•Jun 4, 2024•2 citations

Algorithmic Randomness and Quantum Random Number Generation

José Manuel Agüero Trejo

In this Thesis, we develop the only class of QRNGs, to date, that has been proved to be better than any PRNG. This type of QRNG is based on a located form of the Kochen-Specker Theorem. This certification is unique because i) the assumptions used have been experimentally validated, ii) the robustness of measurements was proved theoretically, iii) the quality of quantum random digits generated with this class of QRNG was experimentally shown to be better than that of the best PRNGs, demonstrating for the first time the strong effects of incomputability on the outputs of a quantum random number generator. Finally, we propose a method using high-quality randomness for inverting a class of one-way functions in a pre-given time.

•Jan 1, 2024•0 citations
In this paper we propose a quantum random number generator (QRNG) that uses an entangled photon pair in a Bell singlet state and is certified explicitly by value indefiniteness. While ‘true randomness’ is a mathematical impossibility, the certification by value indefiniteness ensures that the quantum random bits are incomputable in the strongest sense. This is the first QRNG setup in which a physical principle (Kochen–Specker value indefiniteness) guarantees that no single quantum bit that is produced can be classically computed (reproduced and validated), which is the mathematical form of bitwise physical unpredictability. We discuss the effects of various experimental imperfections in detail: in particular, those related to detector efficiencies, context alignment and temporal correlations between bits. The analysis is very relevant for the construction of any QRNG based on beam-splitters. By measuring the two entangled photons in maximally misaligned contexts and using the fact that two bitstrings, rather than just one, are obtained, more efficient and robust unbiasing techniques can be applied. We propose a robust and efficient procedure based onXORing the bitstrings together – essentially using one as a one-time-pad for the other – to extract random bits in the presence of experimental imperfections, as well as a more efficient modification of the von Neumann procedure for the same task. We also discuss some open problems.
In this thesis we study the generation of randomness from quantum mechanical sources: quantum random number generators (QRNGs). Such devices are thought to provide a better quality of randomness than is possible with classical devices, but the issue is in need of more rigorous study. In Chapter 1 we provide the necessary background for the thesis from both computability and probability theory. We then present and extend some recent results providing a more theoretical grounding for the indeterminism in quantum mechanics. In particular, we show that sequences of quantum random bits are incomputable in the strongest sense: no bit can be provably computed in advance. In Chapter 2 we study in detail the use of von Neumann normalisation for QRNGs producing both finite strings and infinite sequences of bits; such normalisation methods are necessary in order to counter for experimental imperfections. We show that, in the case of a constantly biased source, this normalisation gives the desired uniform distribution. The effect of this normalisation on the (in)computability of the generated sequences is studied, and it is shown that algorithmic randomness and Borel normality are preserved, but e-randomness (and thus incomputability) is, in general, not. Experimental bounds for the extent of departure from the uniform distribution in the non-ideal case of a slowly drifting bias are derived. In Chapter 3 we propose a new QRNG which uses entangled photon pairs and is certified to produce incomputable bits by value indefiniteness; this is the first QRNG with explicit certification by a physical principle. The effects of various experimental imperfections are discussed in detail, and care is taken to make the proposed QRNG as robust as is possible to these. A robust method based on XORing the produced bitstrings together is proposed to further improve the quality of the distribution produced by the QRNG. Various improvements and optimisations to this scheme are discussed.
Random numbers are required for a variety of applications from secure communications to Monte Carlo simulation. Yet randomness is an asymptotic property, and no output string generated by a physical device can be strictly proven to be random. We report an experimental realization of a quantum random number generator (QRNG) with randomness certified by quantum contextuality and the Kochen-Specker theorem. The certification is not performed in a device-independent way but through a rigorous theoretical proof of each outcome being value indefinite even in the presence of experimental imperfections. The analysis of the generated data confirms the incomputable nature of our QRNG.
Random numbers play an important role in many areas, for example, encryption, cryptography, static analysis, simulations.It is also a fundamental resource in science and engineering.There are algorithmically generated numbers that are similar to random distributions, but are not actually random, called pseudo random number generators.In many cases the tasks to be solved are based on the unpredictability of random numbers, which cannot be guaranteed in the case of pseudo random number generators, true randomness is required.In such situations, we use real random number generators whose source of randomness is unpredictable random events.Quantum Random Number Generators (QRNGs) generate real random numbers based on the inherent randomness of quantum measurements.Our goal is to generate fast random numbers at a lower cost.At the same time, a high level of randomness is essential.Through quantum mechanics, we can obtain true numbers using the unpredictable behavior of a photon, which is the basis of many modern cryptographic protocols.It is essential to trust cryptographic random number generators to generate only true random numbers.This is why certification methods are needed which will check both the operation of the device and the quality of the random bits generated.We present the improved novel quantum random number generator, which is based the on time of arrival QRNG.It uses the simple version of the detectors with few requirements.The novel QRNG produces more than one random bit per each photon detection.It is rather efficient and has a high level of randomness.Self-testing as well as device independent quantum random number generation methods are analyzed.The advantages and disadvantages of both methods are identified.The model of a novel semi self-testing certification method for quantum random number generators (QRNG) is offered in the paper.This method combines different types of certification approaches and is rather secure and efficient.Finally, the novel certification method is integrated into the model of the new quantum random number generator.The paper analyzes its security and efficiency.
In this Thesis, we develop the only class of QRNGs, to date, that has been proved to be better than any PRNG. This type of QRNG is based on a located form of the Kochen-Specker Theorem. This certification is unique because i) the assumptions used have been experimentally validated, ii) the robustness of measurements was proved theoretically, iii) the quality of quantum random digits generated with this class of QRNG was experimentally shown to be better than that of the best PRNGs, demonstrating for the first time the strong effects of incomputability on the outputs of a quantum random number generator. Finally, we propose a method using high-quality randomness for inverting a class of one-way functions in a pre-given time.