The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Experimentally generated randomness certified by the impossibility of superluminal signals
Open accessAbstract
From dice to modern electronic circuits, there have been many attempts to build better devices to generate random numbers. Randomness is fundamental to security and cryptographic systems and to safeguarding privacy. A key challenge with random-number generators is that it is hard to ensure that their outputs are unpredictable1–3. For a random-number generator based on a physical process, such as a noisy classical system or an elementary quantum measurement, a detailed model that describes the underlying physics is necessary to assert unpredictability. Imperfections in the model compromise the integrity of the device. However, it is possible to exploit the phenomenon of quantum non-locality with a loophole-free Bell test to build a random-number generator that can produce output that is unpredictable to any adversary that is limited only by general physical principles, such as special relativity1–11. With recent technological developments, it is now possible to carry out such a loophole-free Bell test12–14,22. Here we present certified randomness obtained from a photonic Bell experiment and extract 1,024 random bits that are uniformly distributed to within 10−12. These random bits could not have been predicted according to any physical theory that prohibits faster-than-light (superluminal) signalling and that allows independent measurement choices. To certify and quantify the randomness, we describe a protocol that is optimized for devices that are characterized by a low per-trial violation of Bell inequalities. Future random-number generators based on loophole-free Bell tests may have a role in increasing the security and trust of our cryptographic systems and infrastructure. 1,024 random bits that are uniformly distributed to within 10−12 and unpredictable assuming the impossibility of superluminal communication are generated and certified using a loophole-free Bell test.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
On the Einstein Podolsky Rosen paradox
Bell, J. S. (1964) · Physics Physique Fizika · doi:10.1103/physicsphysiquefizika.1.195 · Cited by 12,252
Loophole-free Bell inequality violation using electron spins separated by 1.3 kilometres
Hensen, B., Bernien, H., Dréau, A. E., Reiserer, A., Kalb, N., Blok, M. S., Ruitenberg, J., Vermeulen, R. F. L., Schouten, R. N., Abellán, C., et al. (2015) · Nature · doi:10.1038/nature15759 · Cited by 2,852
Quantum nonlocality as an axiom
Popescu, S., & Rohrlich, D. (1994) · Foundations of Physics · doi:10.1007/bf02058098 · Cited by 1,562
Significant-Loophole-Free Test of Bell’s Theorem with Entangled Photons
Giustina, M., Versteegh, M. A. M., Wengerowsky, S., Handsteiner, J., Hochrainer, A., Phelan, K., Steinlechner, F., Kofler, J., Larsson, J.-Å., Abellán, C., et al. (2015) · Physical Review Letters · doi:10.1103/physrevlett.115.250401 · Cited by 1,529
Self-citationRandom numbers certified by Bell’s theorem
Pironio, S., Acín, A., Massar, S., de la Giroday, A. B., Matsukevich, D. N., Maunz, P., Olmschenk, S., Hayes, D., Luo, L., Manning, T. A., et al. (2010) · Nature · doi:10.1038/nature09008 · Cited by 1,420
Strong Loophole-Free Test of Local Realism
Shalm, L. K., Meyer-Scott, E., Christensen, B. G., Bierhorst, P., Wayne, M. A., Stevens, M. J., Gerrits, T., Glancy, S., Hamel, D. R., Allman, M. S., et al. (2015) · Physical Review Letters · doi:10.1103/physrevlett.115.250402 · Cited by 1,402
Self-citationExtractors and pseudorandom generators
(2001) · Journal of the ACM · doi:10.1145/502090.502099 · Cited by 324
Security of practical private randomness generation
Pironio, S., & Massar, S. (2013) · Physical Review A · doi:10.1103/physreva.87.012336 · Cited by 169 · cited 7×
“Previous methods for related models with various sets of assumptions [2–8, 27– 29] are ineffective in .”
BackgroundMethodInfluentialCertifiable quantum dice: or, true random number generation secure against quantum adversaries
Vazirani, U., & Vidick, T. (2012) · Proceedings of the forty-fourth annual ACM symposium on Theory of computing · doi:10.1145/2213977.2213984 · Cited by 80
Ma, X., Zhang, Z., & Tan, X. (2011) · arXiv · doi:10.48550/arxiv.1109.6147 · Cited by 6
Research works printed but not linked: 25
- Acín, A. & Masanes, L. Certified randomness in quantum physics. Nature 540, 213–219 (2016). · DOI · Paper page
- Miller, C. A. & Shi, Y. Robust protocols for securely expanding randomness and distributing keys using untrusted quantum devices. J. ACM 63, 33 (2016). · DOI
- Colbeck, R. & Kent, A. Private randomness expansion with untrusted devices. J. Phys. A 44, 095305 (2011). · DOI · Paper page
- Fehr, S., Gelles, R. & Schaffner, C. Security and composability of randomness expansion from Bell inequalities. Phys. Rev. A 87, 012335 (2013). · DOI · Paper page
- Chung, K.-M., Shi, Y. & Wu, X. Physical randomness extractors: generating random numbers with minimal assumptions. Preprint at https://arxiv.org/abs/1402.4797 (2014). · arXiv
- Nieto-Silleras, O., Pironio, S. & Silman, J. Using complete measurement statistics for optimal device-independent randomness evaluation. New J. Phys. 16, 013035 (2014). · DOI
- Bancal, J.-D., Sheridan, L. & Scarani, V. More randomness from the same data. New J. Phys. 16, 033011 (2014). · DOI
- Thinh, L., de la Torre, G., Bancal, J.-D., Pironio, P. & Scarani, V. Randomness in post-selected events. New J. Phys. 18, 035007 (2016). · DOI
- Paar, C. & Pelzl, J. Understanding Cryptography (Springer, Heidelberg, 2010). · DOI · Paper page
- Fischer, M. J., Iorga, M. & Peralta, R. A public randomness service. In Proc. International Conference on Security and Cryptography (SECRYPT 2011) (eds Lopez, J. & Samarati, P.) 434–438 (2011). · doi:10.5220/0003612604340438
- Bell, J. S., Shimony, A., Horne, M. A. & Clauser, J. F. An exchange on local beables. Dialectica 39, 85–96 (1985). · DOI
- Mayers, D. & Yao, A. Quantum cryptography with imperfect apparatus. In FOCS’98 Proc. 39th Annual Symposium on Foundations of Computer Science (ed Motwani, R.) 503–509 (1998). · DOI · Paper page
- Acín, A. et al. Device-independent security of quantum cryptography against collective attacks. Phys. Rev. Lett. 98, 230501 (2007). · DOI · Paper page
- Liu, Y. et al. High-speed device-independent quantum random number generation without a detection loophole. Phys. Rev. Lett. 120, 010503 (2018). · DOI
- Rosenfeld, W. et al. Event-ready Bell test using entangled atoms simultaneously closing detection and locality loopholes. Phys. Rev. Lett. 119, 010402 (2017). · DOI · Paper page
- Abellán, C. et al. Challenging local realism with human choices. Nature (in the press).
- Brunner, N., Cavalcanti, D., Pironio, S., Scarani, V. & Wehner, S. Bell nonlocality. Rev. Mod. Phys. 86, 419–478 (2014). · DOI · Paper page
- Cirel’son, B. S. Quantum generalizations of Bell’s inequality. Lett. Math. Phys. 4, 93–100 (1980). · DOI · Paper page
- Navascués, M., Pironio, S. & Acín, A. A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations. New J. Phys. 10, 073013 (2008). · DOI · Paper page
- Mauerer, W., Portmann, C. & Scholz, V. B. A modular framework for randomness extraction based on Trevisan’s construction. Preprint at https://arxiv.org/abs/1212.0520 (2012). · arXiv
- Coudron, M. & Yuen, H. Infinite randomness expansion with a constant number of devices. In STOC’14 Proc. 46th Annual ACM Symposium on Theory of Computing (ed Shmoys, D.) 427–436 (2014). · DOI
- Arnon-Friedman, R., Dupuis, F., Fawzi, O., Renner, R. & Vidick, T. Practical device-independent quantum cryptography via entropy accumulation. Nat. Commun. 9, 459 (2018). · DOI · Paper page
- Miller, C. & Shi, Y. Universal security for randomness expansion from the spot-checking protocol. SIAM J. Comput. 46, 1304–1335 (2017). · DOI
- Zhang, Y., Glancy, S. & Knill, E. Asymptotically optimal data analysis for rejecting local realism. Phys. Rev. A 84, 062118 (2011). · DOI
- Marsili, F. et al. Detecting single infrared photons with 93% system efficiency. Nat. Photon. 7, 210–214 (2013). · DOI · Paper page
Cited by
Quantum Computing in the NISQ era and beyond
Preskill, J. (2018) · Quantum · doi:10.22331/q-2018-08-06-79 · Cited by 8,830
Photonic quantum information processing: a concise review
Slussarenko, S., & Pryde, G. J. (2019) · Applied Physics Reviews · doi:10.1063/1.5115814 · Cited by 644
Mannalath, V., Mishra, S., & Pathak, A. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-04175-y · Cited by 125
Raw QPP-RNG randomness via system jitter across platforms: a NIST SP 800-90B evaluation
Vrana, G., Lou, D., & Kuang, R. (2025) · Scientific Reports · doi:10.1038/s41598-025-13135-8 · Cited by 8
Practical randomness amplification and privatisation with implementations on quantum computers
Foreman, C., Wright, S., Edgington, A., Berta, M., & Curchod, F. J. (2020) · arXiv · doi:10.48550/arxiv.2009.06551 · Cited by 1
Metadata
- Authors
- Bierhorst, P., Knill, E., Glancy, S., Zhang, Y., Mink, A., Jordan, S., Rommal, A., Liu, Y.-K., Christensen, B., Nam, S. W., Stevens, M. J., & Shalm, L. K.
- Venue
- Nature
- Published
- 2018-04
- Volume
- 556
- Issue
- 7700
- Pages
- 223-226
- ISSN
- 0028-0836 (ISSN-L)
- 1476-4687
- OpenAlex
- W2589855919
- Cited by
- 181
- References
- 10
- FWCI
- 10.61
- Type
- journal article
- Language
- en
- Open access
- green
- Licence
- www.springer.com/tdm (tdm)
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Experimentally generated randomness certified by the impossibility of superluminal signals. https://app.cochat.ai/papers/10.1038/s41586-018-0019-0
- The paper
- Bierhorst, P., Knill, E., Glancy, S., Zhang, Y., Mink, A., Jordan, S., Rommal, A., Liu, Y.-K., Christensen, B., Nam, S. W., Stevens, M. J., & Shalm, L. K. (2018). Experimentally generated randomness certified by the impossibility of superluminal signals. Nature. https://doi.org/10.1038/s41586-018-0019-0
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.