Cited by 206Quantum Information and CryptographyQuantum Mechanics and ApplicationsQuantum Computing Algorithms and Architecture

The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.

Self-Testing Quantum Random Number Generator

Open access

Abstract

The generation of random numbers is a task of paramount importance in modern science. A central problem for both classical and quantum randomness generation is to estimate the entropy of the data generated by a given device. Here we present a protocol for self-testing quantum random number generation, in which the user can monitor the entropy in real time. Based on a few general assumptions, our protocol guarantees continuous generation of high quality randomness, without the need for a detailed characterization of the devices. Using a fully optical setup, we implement our protocol and illustrate its self-testing capacity. Our work thus provides a practical approach to quantum randomness generation in a scenario of trusted but error-prone devices.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1103/physrevlett.114.150501

Cites

36 of 36 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

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

Flagged first, then by citations

Show all 32 references

Research works printed but not linked: 1

  1. C. H. Bennett, 1984, Proceedings of the IEEE International Conference on Computers, Systems and Signal Processing, Bangalore, India

Cited by

Sorted by citations

Items 101–200 of 205

Metadata

Authors
Lunghi, T., Brask, J. B., Lim, C. C. W., Lavigne, Q., Bowles, J., Martin, A., Zbinden, H., & Brunner, N.
Affiliations
University of Geneva (CH)
Venue
Physical Review Letters
Published
2015-04-15
Volume
114
Issue
15
Pages
150501-150501
ISSN
  • 0031-9007 (ISSN-L)
  • 1079-7114
OpenAlex
W2025267340
Cited by
206
References
32
Citations by year
2026: 14 · 2025: 19 · 2024: 12 · 2023: 18 · 2022: 16 · 2021: 23 · 2020: 26 · 2019: 26 · 2018: 16 · 2017: 13 · 2016: 13 · 2015: 8
FWCI
16.31
Type
journal article
Language
en
Open access
Locations
  • Physical Review Letters (publishedVersion)
  • PubMed (publishedVersion)
  • Archive ouverte UNIGE (University of Geneva) (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • HAL (submittedVersion)
  • Archive ouverte UNIGE (University of Geneva) (submittedVersion, cc-by)
  • arXiv (Cornell University)
Funders
  • Schweizerische Nationalfonds zur Förderung der Wissenschaftlichen Forschung (PP00P2_138917, QSIT)
  • SEFRI
  • SIQS
Topics
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
Keywords
quantum random number generation, self-testing, device-independent randomness

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