Realization of a quantum random generator certified with the Kochen-Specker theorem
Anatoly Kulikov, Markus Jerger, Anton Poto\v{c}nik, Andreas Wallraff, and Arkady Fedorov

TL;DR
This paper presents an experimental quantum random number generator that certifies randomness through the Kochen-Specker theorem, providing a rigorous proof of the unpredictability of its outputs despite practical imperfections.
Contribution
It demonstrates a non-device-independent quantum random number generator with certified randomness based on quantum contextuality and the Kochen-Specker theorem.
Findings
Generated data confirms the incomputable nature of the QRNG.
Certification remains valid despite experimental imperfections.
Provides a rigorous theoretical proof of outcome value-indefiniteness.
Abstract
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.
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
TopicsChaos-based Image/Signal Encryption · Quantum Computing Algorithms and Architecture · DNA and Biological Computing
