CoChat

Source-Independent Quantum Random Number Generation

Open access
Cao, Zhu, Zhou, Hongyi, Yuan, Xiao, Ma, Xiongfeng · 2016 · Physical Review X
Cited by 151

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

Abstract

Quantum random number generators can provide genuine randomness by appealing to the fundamental principles of quantum mechanics.In general, a physical generator contains two parts-a randomness source and its readout.The source is essential to the quality of the resulting random numbers; hence, it needs to be carefully calibrated and modeled to achieve information-theoretical provable randomness.However, in practice, the source is a complicated physical system, such as a light source or an atomic ensemble, and any deviations in the real-life implementation from the theoretical model may affect the randomness of the output.To close this gap, we propose a source-independent scheme for quantum random number generation in which output randomness can be certified, even when the source is uncharacterized and untrusted.In our randomness analysis, we make no assumptions about the dimension of the source.For instance, multiphoton emissions are allowed in optical implementations.Our analysis takes into account the finite-key effect with the composable security definition.In the limit of large data size, the length of the input random seed is exponentially small compared to that of the output random bit.In addition, by modifying a quantum key distribution system, we experimentally demonstrate our scheme and achieve a randomness generation rate of over 5 × 10 3 bit=s.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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

Integrity signals

Registry

Crossref · 10.1103/physrevx.6.011020

Cites

13 of 13 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.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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

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

Show all 13 references

Research works printed but not linked: 34

  1. J. S. Bell, 1964, Physica (Amsterdam), 1, 195
  2. D. E. Knuth, 2014, Art of Computer Programming, Volume 2: Seminumerical Algorithms
  3. J. Kelsey, 2004, Proceeding of the NIST Random Number Generation Workshop
  4. W. Schindler, 2003, Cryptographic Hardware and Embedded Systems-CHES 2002
  5. B. Jun, 1999, The Intel Random Number Generator, White Paper Prepared for Intel Corporation
  6. 10.1109/81.586025 · DOI · Paper page
  7. 10.1023/A:1021976717094 · DOI
  8. 10.1063/1.2961000 · DOI · Paper page
  9. 10.1364/OE.18.009351 · DOI · Paper page
  10. 10.1364/OE.18.013029 · DOI · Paper page
  11. 10.1063/1.3578456 · DOI · Paper page
  12. 10.1103/PhysRevA.75.032334 · DOI · Paper page
  13. 10.1103/PhysRevA.90.052327 · DOI · Paper page
  14. U. Vazirani, 2012, Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing
  15. 10.1088/1751-8113/44/9/095305 · DOI · Paper page
  16. 10.1103/PhysRevA.81.012318 · DOI · Paper page
  17. 10.1103/PhysRevLett.101.093601 · DOI · Paper page
  18. 10.1103/PhysRevX.4.031056 · DOI · Paper page
  19. 10.1016/0304-3975(93)90257-T · doi:10.1016/0304-3975(93)90257-t
  20. 10.1016/j.cose.2010.11.001 · DOI
  21. 10.1007/s00145-004-0142-y · DOI · Paper page
  22. 10.1103/PhysRevA.86.042327 · doi:10.1103/physreva.86.042327
  23. C.-H. F. Fung, 2009, Quantum Inf. Comput., 9, 0131, 10.26421/QIC9.1-2-8 · DOI
  24. 10.1103/PhysRevA.92.032305 · DOI
  25. 10.1126/science.283.5410.2050 · DOI · Paper page
  26. 10.1088/1742-6596/36/1/016 · DOI
  27. 10.1103/PhysRevA.92.022124 · DOI · Paper page
  28. M. Ben-Or, 2005, Second Theory of Cryptography Conference TCC 2005, Lecture Notes in Computer Science
  29. R. Renner, 2005, Second Theory of Cryptography Conference TCC 2005, Lecture Notes in Computer Science
  30. R. Impagliazzo, 1989, Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, STOC ’89
  31. 10.1038/ncomms1631 · DOI · Paper page
  32. 10.1109/TIT.2011.2158473 · DOI · Paper page
  33. 10.1007/s003400050825 · doi:10.1007/s003400050825
  34. 10.1063/1.4913527 · DOI

Cited by

Metadata

Authors
Cao, Z., Zhou, H., Yuan, X., & Ma, X.
Venue
Physical Review X
Published
2016-02-25
Volume
6
Issue
1
ISSN
2160-3308 (ISSN-L)
OpenAlex
W2939642929
Cited by
151
References
13
FWCI
10.51
Type
journal article
Language
en
Open access
gold
Funders
National Basic Research Program of China (2011CBA00300, 2011CBA00301)

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

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.