Cited by 228Quantum Information and CryptographyRandom lasers and scattering mediaChaos-based Image/Signal Encryption

Ultrafast quantum random number generation based on quantum phase fluctuations

Open access
Xu, Feihu, Qi, Bing, Ma, Xiongfeng, Xu, He, Zheng, Haoxuan, Lo, Hoi-Kwong·2012·Optics Express

Abstract

A quantum random number generator (QRNG) can generate true randomness by exploiting the fundamental indeterminism of quantum mechanics. Most approaches to QRNG employ single-photon detection technologies and are limited in speed. Here, we experimentally demonstrate an ultrafast QRNG at a rate over 6 Gbits/s based on the quantum phase fluctuations of a laser operating near threshold. Moreover, we consider a potential adversary who has partial knowledge on the raw data and discuss how one can rigorously remove such partial knowledge with postprocessing. We quantify the quantum randomness through min-entropy by modeling our system and employ two randomness extractors--Trevisan's extractor and Toeplitz-hashing--to distill the randomness, which is information-theoretically provable. The simplicity and high-speed of our experimental setup show the feasibility of a robust, low-cost, high-speed QRNG.

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.1364/oe.20.012366

Cites

24 of 24 references verified0 citation errors · 0 not checkable

Statistics

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?

  • To overcome the bandwidth limitation of shot noise-limited homodyne detection, researchers have developed QRNGs based on measuring phase or intensity noise of amplified spontaneous emission (ASE), which is quantum mechanical by nature.

    “To overcome the bandwidth limitation of shot noise-limited homodyne detection, researchers have developed QRNGs based on measuring phase 40 -45 or intensity noise 46,47 of ampli fi ed spontaneous emission(ASE), which is quantum mechanical by nature. 15,48,49”

    From Quantum random number generation (2016) · cites this paper as [42]

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 8

  1. [2]2. C. Bennett and G. Brassard, 'Quantum cryptography: Public key distribution and coin tossing,' in Proc. of IEEE Inter. Conf. on Computer Systems and Signal Processing, 175-179 (IEEE Press, 1984).
  2. [3]3. B. Schneier and P. Sutherland, Applied Cryptography: Protocols, Algorithms, and Source Code in C (John Wiley &Sons, 1995).
  3. [18]18. B. Qi, Y. Chi, H.-K. Lo, and Q. Li, 'High-speed quantum random number generation by measuring phase noise of a single-mode laser,' in Proc. of the 9th Asian Conf. on Quant. Info. Sci. 64-65 (2009).
  4. [28]28. K. Petermann, Laser Diode Modulation and Noise (Springer, 1988).
  5. [35]35. In information theory, the channel capacity of a given channel is the limiting information rate that can be achieved with arbitrarily small error probability by the noisy-channel coding theorem. For a more detailed discussion, see Thomas M. Cover and Joy A. Thomas, Elements of Information Theory (John Wiley & Sons, 2006).
  6. [37]37. H. Krawczyk, in Advances in Cryptology - CRYPTO'94, Lecture Notes in Computer Science, 893 , 129-139 (Springer-Verlag, 1994).
  7. [39]39. R. Raz, O. Reingold, and S. Vadhan, in Proc. of the 31st Annual ACM Symposium on Theory of Computing, 149-158 (1999).
  8. [43]43. F. Xu, B. Qi, X. Ma, H. Xu, H. Zheng, and H.-K. Lo, arXiv:1109.0643 (2011). · arXiv

Cited by

Sorted by citations

Authors
Xu, F., Qi, B., Ma, X., Xu, H., Zheng, H., & Lo, H.-K.
Affiliations
University of Toronto (CA)
Venue
Optics Express
Published
2012-05-16
Volume
20
Issue
11
Pages
12366
ISSN
1094-4087 (ISSN-L)
OpenAlex
W2017636475
Cited by
228
References
24
Citations by year
2026: 10 · 2025: 21 · 2024: 26 · 2023: 24 · 2022: 8 · 2021: 23 · 2020: 21 · 2019: 22 · 2018: 8 · 2017: 18 · 2016: 13 · 2015: 17 · 2014: 8 · 2013: 7 · 2012: 1
FWCI
10.37
Type
journal article
Language
en
Open access
Locations
  • Optics Express (publishedVersion)
  • arXiv (Cornell University) (publishedVersion)
  • PubMed (publishedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
  • Physical Sciences › Physics and Astronomy › Acoustics and Ultrasonics › Random lasers and scattering media
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Chaos-based Image/Signal Encryption
Keywords
quantum random number generation, quantum phase fluctuations, min-entropy, randomness extractors, post-processing, true randomness
MeSH terms
Lasers, Mathematics, Quantum Theory, Random Allocation

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