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:2008.09970 · Theoretical Computer Science

A new quantum random number generator certified by value indefiniteness

José Manuel Agüero Trejo, Cristian S. Calude

Published Aug 25, 2020• 20 citations
arXivHTMLPDF
DOI
10.1016/j.tcs.2020.08.014

Related papers

The Quantum Random Number Generator

Sidney Perkowitz

•Jan 17, 2022•2 citations

A quantum random number generator certified by value indefiniteness

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

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.

arXiv:1012.1960•Mathematical Structures in Computer Science•Mar 28, 2014•23 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

Ultra-fast Quantum Random Number Generator

Yicheng Shi

•Jan 1, 2016•0 citations

Quantum Random Number Generation

Christian Kollmitzer, Stefan Schauer, Stefan Raß +1 more

Quantum science and technology•Jan 1, 2020•18 citations

Les observables à valeurs indéfinies, l'aléatoire, et l'imprévisibilité aux fondations de la mécanique quantique

Alastair A. Abbott

The outcomes of quantum measurements are generally considered to be random, but despite the fact that this randomness is an important element in quantum information theory, its nature is not well understood. In this thesis, we study several issues relating to the origin and certification of quantum randomness and unpredictability. One of the key results in forming our understanding of quantum mechanics as an intrinsically indeterministic theory is the Kochen-Specker theorem, which shows the impossibility to consistently assign simultaneous noncontextual definite values to all quantum mechanical observables prior to measurement. However, the theorem, under the assumption that any definite values must be noncontextual, only strictly shows that some observables must be value indefinite. We strengthen this result, proving a stronger variant of the Kochen-Specker theorem showing that, under the same assumption, if a system is prepared in an arbitrary state j i, then every observable A is value indefinite unless j i is an eigenstate of A. The indeterministic nature of quantum measurements does little to explain how the quality of quantum randomness differs from classical randomness. We show that, subject to certain physical assumptions, a sequence of bits generated by the measurement of value indefinite observables is guaranteed, in the infinite limit, to be strongly incomputable. We further discuss how this can be used to build a quantum random number generator certified by value indefiniteness. Next, we study the notion of unpredictability, which is central to the concept of (quantum) randomness. In doing so, we propose a formal model of prediction that can be used to asses the predictability of arbitrary physical experiments. We investigate how the quantum features of value indefiniteness and complementarity can be used to certify different levels of unpredictability, and show that the outcome of a single measurement of a value indefinite quantum observable is formally unpredictable. Finally, we study the relation between this notion of unpredictability and the computability-theoretic certification of quantum randomness.

•Nov 13, 2015•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.
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.
The outcomes of quantum measurements are generally considered to be random, but despite the fact that this randomness is an important element in quantum information theory, its nature is not well understood. In this thesis, we study several issues relating to the origin and certification of quantum randomness and unpredictability. One of the key results in forming our understanding of quantum mechanics as an intrinsically indeterministic theory is the Kochen-Specker theorem, which shows the impossibility to consistently assign simultaneous noncontextual definite values to all quantum mechanical observables prior to measurement. However, the theorem, under the assumption that any definite values must be noncontextual, only strictly shows that some observables must be value indefinite. We strengthen this result, proving a stronger variant of the Kochen-Specker theorem showing that, under the same assumption, if a system is prepared in an arbitrary state j i, then every observable A is value indefinite unless j i is an eigenstate of A. The indeterministic nature of quantum measurements does little to explain how the quality of quantum randomness differs from classical randomness. We show that, subject to certain physical assumptions, a sequence of bits generated by the measurement of value indefinite observables is guaranteed, in the infinite limit, to be strongly incomputable. We further discuss how this can be used to build a quantum random number generator certified by value indefiniteness. Next, we study the notion of unpredictability, which is central to the concept of (quantum) randomness. In doing so, we propose a formal model of prediction that can be used to asses the predictability of arbitrary physical experiments. We investigate how the quantum features of value indefiniteness and complementarity can be used to certify different levels of unpredictability, and show that the outcome of a single measurement of a value indefinite quantum observable is formally unpredictable. Finally, we study the relation between this notion of unpredictability and the computability-theoretic certification of quantum randomness.