Secure self-calibrating quantum random-bit generator
Open accessThe DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
Random-bit generators (RBGs) are key components of a variety of information processing applications ranging from simulations to cryptography. In particular, cryptographic systems require ``strong'' RBGs that produce high-entropy bit sequences, but traditional software pseudo-RBGs have very low entropy content and therefore are relatively weak for cryptography. Hardware RBGs yield entropy from chaotic or quantum physical systems and therefore are expected to exhibit high entropy, but in current implementations their exact entropy content is unknown. Here we report a quantum random-bit generator (QRBG) that harvests entropy by measuring single-photon and entangled two-photon polarization states. We introduce and implement a quantum tomographic method to measure a lower bound on the ``min-entropy'' of the system, and we employ this value to distill a truly random-bit sequence. This approach is secure: even if an attacker takes control of the source of optical states, a secure random sequence can be distilled.
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.
Integrity signals
Registry
Cites
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.
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
James, D. F. V., Kwiat, P. G., Munro, W. J., & White, A. G. (2001) · Physical Review A · doi:10.1103/physreva.64.052312 · Cited by 2,176
Self-citationA fast and compact quantum random number generator
Jennewein, T., Achleitner, U., Weihs, G., Weinfurter, H., & Zeilinger, A. (2000) · Review of Scientific Instruments · doi:10.1063/1.1150518 · Cited by 434
Cited by
Random 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
“Random numbers, however, are difficult to characterize mathematically [1], and their generation must rely on an unpredictable physical process [2, 3, 4, 5, 6].”
Quantum random number generators
Herrero-Collantes, M., & Garcia-Escartin, J. C. (2017) · Reviews of Modern Physics · doi:10.1103/revmodphys.89.015004 · Cited by 791
A generator for unique quantum random numbers based on vacuum states
Gabriel, C., Wittmann, C., Sych, D., Dong, R., Mauerer, W., Andersen, U. L., Marquardt, C., & Leuchs, G. (2010) · Nature Photonics · doi:10.1038/nphoton.2010.197 · Cited by 419
Security of practical private randomness generation
Pironio, S., & Massar, S. (2013) · Physical Review A · doi:10.1103/physreva.87.012336 · Cited by 169
“andom number generator (RNG) can completely compromise the security. Many solutions have thus been proposed for the generation of random numbers (for recent work on random number generation see, e.g.,[1, 2, 3, 4, 5, 6, 7]), but none is entirely satisfactory. As quoted from Wikipedia [8], every random number generator…”
BackgroundSource-device-independent Ultra-fast Quantum Random Number Generation
Marangon, D. G., Vallone, G., & Villoresi, P. (2015) · arXiv · doi:10.48550/arxiv.1509.07390 · Cited by 160
Metadata
- Authors
- Fiorentino, M., Santori, C., Spillane, S. M., Beausoleil, R. G., & Munro, W. J.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2007-03-26
- Volume
- 75
- Issue
- 3
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W2049651587
- Cited by
- 89
- References
- 2
- FWCI
- 6.70
- Type
- journal article
- Language
- en
- Open access
- green
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: Secure self-calibrating quantum random-bit generator. https://app.cochat.ai/papers/10.1103/physreva.75.032334
- The paper
- Fiorentino, M., Santori, C., Spillane, S. M., Beausoleil, R. G., & Munro, W. J. (2007). Secure self-calibrating quantum random-bit generator. Physical Review A. https://doi.org/10.1103/physreva.75.032334
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.