Realistic noise-tolerant randomness amplification using finite number of devices
Open accessThe DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Abstract
Randomness is a fundamental concept, with implications from security of modern data systems, to fundamental laws of nature and even the philosophy of science. Randomness is called certified if it describes events that cannot be pre-determined by an external adversary. It is known that weak certified randomness can be amplified to nearly ideal randomness using quantum-mechanical systems. However, so far, it was unclear whether randomness amplification is a realistic task, as the existing proposals either do not tolerate noise or require an unbounded number of different devices. Here we provide an error-tolerant protocol using a finite number of devices for amplifying arbitrary weak randomness into nearly perfect random bits, which are secure against a no-signalling adversary. The correctness of the protocol is assessed by violating a Bell inequality, with the degree of violation determining the noise tolerance threshold. An experimental realization of the protocol is within reach of current technology.
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
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 · cited 5×
“It has a similar flavour to previous results [19–21] obtained in the context of the related problem of randomness expansion.”
InfluentialFree randomness can be amplified
Colbeck, R., & Renner, R. (2012) · Nature Physics · doi:10.1038/nphys2300 · Cited by 379 · cited 3×
“In a seminal work [5], Colbeck and Renner showed that despite this difficulty non-local quantum correlations can be used to amplify the randomness of Santha-Vazirani sources sufficiently close to fully random.”
BackgroundMethodUniversally Composable Privacy Amplification Against Quantum Adversaries
Renner, R., & König, R. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30576-7_22 · Cited by 337
Randomness versus Nonlocality and Entanglement
Acín, A., Massar, S., & Pironio, S. (2012) · Physical Review Letters · doi:10.1103/physrevlett.108.100402 · Cited by 324 · cited 2×
“Quantum non-locality has found application also in this latter task [11–16, 20] as well as in device-independent cryptographic scenarios (see e.”
BackgroundLocal Deterministic Model of Singlet State Correlations Based on Relaxing Measurement Independence
Hall, M. J. W. (2010) · Physical Review Letters · doi:10.1103/physrevlett.105.250404 · Cited by 239
The Universal Composable Security of Quantum Key Distribution
Ben-Or, M., Horodecki, M., Leung, D. W., Mayers, D., & Oppenheim, J. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30576-7_21 · Cited by 227
Self-citationFull randomness from arbitrarily deterministic events
Gallego, R., Masanes, L., De La Torre, G., Dhara, C., Aolita, L., & Acín, A. (2013) · Nature Communications · doi:10.1038/ncomms3654 · Cited by 186
Security of practical private randomness generation
Pironio, S., & Massar, S. (2013) · Physical Review A · doi:10.1103/physreva.87.012336 · Cited by 169 · cited 5×
“It has a similar flavour to previous results [19–21] obtained in the context of the related problem of randomness expansion.”
InfluentialSecurity and composability of randomness expansion from Bell inequalities
Fehr, S., Gelles, R., & Schaffner, C. (2013) · Physical Review A · doi:10.1103/physreva.87.012335 · Cited by 104
Quantum-Proof Randomness Extractors via Operator Space Theory
Berta, M., Fawzi, O., & Scholz, V. B. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2627531 · Cited by 12
Cited by
Advances in quantum cryptography
Pirandola, S., Andersen, U. L., Banchi, L., Berta, M., Bunandar, D., Colbeck, R., Englund, D., Gehring, T., Lupo, C., Ottaviani, C., et al. (2020) · Advances in Optics and Photonics · doi:10.1364/aop.361502 · Cited by 2,033
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
Security in quantum cryptography
Portmann, C., & Renner, R. (2022) · Reviews of Modern Physics · doi:10.1103/revmodphys.94.025008 · Cited by 390
Certified randomness in quantum physics
Acín, A., & Masanes, L. (2016) · Nature · doi:10.1038/nature20119 · Cited by 298
Open-system dynamics of entanglement:a key issues review
Aolita, L., de Melo, F., & Davidovich, L. (2015) · Refubium (Universitätsbibliothek der Freien Universität Berlin) · doi:10.17169/refubium-20820 · Cited by 258
Metadata
- Authors
- Brandão, F. G. S. L., Ramanathan, R., Grudka, A., Horodecki, K., Horodecki, M., Horodecki, P., Szarek, T., & Wojewódka, H.
- Venue
- Nature Communications
- Published
- 2016-04-21
- Volume
- 7
- Issue
- 1
- Pages
- 11345-11345
- ISSN
- 2041-1723 (ISSN-L)
- OpenAlex
- W2337218539
- Cited by
- 66
- References
- 10
- FWCI
- 5.81
- Type
- journal article
- Language
- en
- Open access
- gold
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.