Brandão, Fernando G. S. L. and Ramanathan, Ravishankar and Grudka, Andrzej and Horodecki, Karol and Horodecki, Michał and Horodecki, Paweł and Szarek, Tomasz and Wojewódka, Hanna (2016) Realistic noise-tolerant randomness amplification using finite number of devices. Nature Communications, 7 . Art. No. 11345. ISSN 2041-1723. PMCID PMC4844674. doi:10.1038/ncomms11345. https://resolver.caltech.edu/CaltechAUTHORS:20160524-103844109
![]() |
PDF
- Published Version
Creative Commons Attribution. 565kB |
![]() |
PDF (Supplementary Figures 1-7, Supplementary Table 1, Supplementary Notes 1-7 and Supplementary References)
- Supplemental Material
Creative Commons Attribution. 2MB |
Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20160524-103844109
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.
Item Type: | Article | ||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Related URLs: |
| ||||||||||||||
ORCID: |
| ||||||||||||||
Additional Information: | © 2016 Macmillan Publishers Limited. This work is licensed under a Creative Commons Attribution 4.0 International License. The images or other third party material in this article are included in the article’s Creative Commons license, unless indicated otherwise in the credit line; if the material is not included under the Creative Commons license, users will need to obtain permission from the license holder to reproduce the material. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/ Received 01 February 2016; Accepted 16 March 2016; Published 21 April 2016. We thank Rotem Arnon-Friedman for discussions. The work is supported by ERC AdG grant QOLAPS, EC grant RAQUEL and by Foundation for Polish Science TEAM project co-financed by the EU European Regional Development Fund. F.G.S.L.B. acknowledges support from EPSRC and Polish Ministry of Science and Higher Education Grant no. IdP2011 000361. Part of this work was done in the National Quantum Information Center of Gdańsk. Part of this work was done when F.G.S.L.B., R.R., K.H. and M.H. attended the programme ‘Mathematical Challenges in Quantum Information’ at the Isaac Newton Institute for Mathematical Sciences in the University of Cambridge. Another part was done in the programme ‘Quantum Hamiltonian Complexity’ in the Simons Institute for the Theory of Computing. Finally, M.H. thanks the Department of Physics and Astronomy and the Department of Computer Science of UCL, where part of this work was also performed, for hospitality. Author contributions: F.G.S.L.B. and M.H. conceptualized central ideas, all authors contributed extensively to the work presented in the paper. The authors declare no competing financial interests. | ||||||||||||||
Funders: |
| ||||||||||||||
PubMed Central ID: | PMC4844674 | ||||||||||||||
DOI: | 10.1038/ncomms11345 | ||||||||||||||
Record Number: | CaltechAUTHORS:20160524-103844109 | ||||||||||||||
Persistent URL: | https://resolver.caltech.edu/CaltechAUTHORS:20160524-103844109 | ||||||||||||||
Official Citation: | Brandão, F. G. S. L. et al. Realistic noise-tolerant randomness amplification using finite number of devices. Nat. Commun. 7:11345 doi: 10.1038/ncomms11345 (2016) | ||||||||||||||
Usage Policy: | No commercial reproduction, distribution, display or performance rights in this work are provided. | ||||||||||||||
ID Code: | 67300 | ||||||||||||||
Collection: | CaltechAUTHORS | ||||||||||||||
Deposited By: | Tony Diaz | ||||||||||||||
Deposited On: | 24 May 2016 18:39 | ||||||||||||||
Last Modified: | 11 Nov 2021 00:30 |
Repository Staff Only: item control page