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:2312.10973 · Scientific Reports

Binary quantum random number generator based on value indefinite observables

Cristian S. Calude, Karl Svozil

Published Jun 4, 2024• 2 citations
arXivHTMLPDF

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 generates binary quantum random outputs with the same randomness qualities as the ternary ones: the outputs are maximally unpredictable.

DOI
10.1038/s41598-024-62566-2

Related papers

Strong Kochen-Specker theorem and incomputability of quantum randomness

Alastair A. Abbott, Cristian S. Calude, Jonathan Conder +1 more

The Kochen-Specker theorem shows the impossibility for a hidden variable theory to consistently assign values to certain (finite) sets of observables in a way that is noncontextual and consistent with quantum mechanics. If we require noncontextuality, the consequence is that many observables must not have pre-existing definite values. However, the Kochen-Specker theorem does not allow one to determine which observables must be value indefinite. In this paper we present an improvement on the Kochen-Specker theorem which allows one to actually locate observables which are provably value indefinite. Various technical and subtle aspects relating to this formal proof and its connection to quantum mechanics are discussed. This result is then utilized for the proposal and certification of a dichotomic quantum random number generator operating in a three-dimensional Hilbert space.

arXiv:1207.2029•Physical Review A•Dec 17, 2012•90 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•25 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•35 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

Photonic ternary quantum random number generators

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

We construct a class of three-dimensional photonic quantum random number generators (QRNGs) and prove that each of them generates maximally unpredictable digits via measurements that are robust to errors. This shows that every sequence generated is strongly incomputable; hence its quality is provably better than that of every pseudo-random sequence. These results suggest that incomputability in physics is real and practically applicable. Finally, we present photonic implementations of three-dimensional QRNGs and discuss device independence.

Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences•May 1, 2023•3 citations

Experimental Certification of Random Numbers via Quantum Contextuality

Mark Um, Xiang Zhang, Junhua Zhang +5 more

The intrinsic unpredictability of measurements in quantum mechanics can be used to produce genuine randomness. Here, we demonstrate a random number generator where the randomness is certified by quantum contextuality in connection with the Kochen-Specker theorem. In particular, we generate random numbers from measurements on a single trapped ion with three internal levels, and certify the generated randomness by showing a bound on the minimum entropy through observation of violation of the Klyachko-Can-Binicioglu-Shumovsky (KCBS) inequality. Concerning the test of the KCBS inequality, we close the detection efficiency loophole for the first time and make it relatively immune to the compatibility loophole. In our experiment, we generate 1 × 10(5) random numbers that are guaranteed to have 5.2 × 10(4) bits of minimum entropy with a 99% confidence level.

Scientific Reports•Apr 9, 2013•72 citations
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.
The Kochen-Specker theorem shows the impossibility for a hidden variable theory to consistently assign values to certain (finite) sets of observables in a way that is noncontextual and consistent with quantum mechanics. If we require noncontextuality, the consequence is that many observables must not have pre-existing definite values. However, the Kochen-Specker theorem does not allow one to determine which observables must be value indefinite. In this paper we present an improvement on the Kochen-Specker theorem which allows one to actually locate observables which are provably value indefinite. Various technical and subtle aspects relating to this formal proof and its connection to quantum mechanics are discussed. This result is then utilized for the proposal and certification of a dichotomic quantum random number generator operating in a three-dimensional Hilbert space.
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.
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.
We construct a class of three-dimensional photonic quantum random number generators (QRNGs) and prove that each of them generates maximally unpredictable digits via measurements that are robust to errors. This shows that every sequence generated is strongly incomputable; hence its quality is provably better than that of every pseudo-random sequence. These results suggest that incomputability in physics is real and practically applicable. Finally, we present photonic implementations of three-dimensional QRNGs and discuss device independence.
The intrinsic unpredictability of measurements in quantum mechanics can be used to produce genuine randomness. Here, we demonstrate a random number generator where the randomness is certified by quantum contextuality in connection with the Kochen-Specker theorem. In particular, we generate random numbers from measurements on a single trapped ion with three internal levels, and certify the generated randomness by showing a bound on the minimum entropy through observation of violation of the Klyachko-Can-Binicioglu-Shumovsky (KCBS) inequality. Concerning the test of the KCBS inequality, we close the detection efficiency loophole for the first time and make it relatively immune to the compatibility loophole. In our experiment, we generate 1 × 10(5) random numbers that are guaranteed to have 5.2 × 10(4) bits of minimum entropy with a 99% confidence level.