Abstract
A recent sequence of works, initially motivated by the study of the nonlocal properties of entanglement, demonstrate that a source of information-theoretically certified randomness can be constructed based only on two simple assumptions: the prior existence of a short random seed and the ability to ensure that two black-box devices do not communicate (i.e. are non-signaling). We call protocols achieving such certified amplification of a short random seed randomness amplifiers. We introduce a simple framework in which we initiate the systematic study of the possibilities and limitations of randomness amplifiers. Our main results include a new, improved analysis of a robust randomness amplifier with exponential expansion, as well as the first upper bounds on the maximum expansion achievable by a broad class of randomness amplifiers. In particular, we show that non-adaptive randomness amplifiers that are robust to noise cannot achieve more than doubly exponential expansion. Finally, we show that a wide class of protocols based on the use of the CHSH game can only lead to (singly) exponential expansion if adversarial devices are allowed the full power of non-signaling strategies. Our upper bound results apply to all known non-adaptive randomness amplifier constructions to date.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aravind, P.K.: The magic squares and Bell’s theorem. Tech. rep., arXiv:quant-ph/0206070 (2002)
Aspect, A., Grangier, P., Roger, G.: Experimental tests of realistic local theories via Bell’s theorem. Phys. Rev. Lett. 47(7), 460–463 (1981)
Brunner, N., Cavalcanti, D., Pironio, S., Scarani, V., Wehner, S.: Bell nonlocality. Tech. rep., arXiv:1303.2849 (2013)
Cirel’son, B.: Quantum generalizations of Bell’s inequality. Letters in Mathematical Physics 4(2), 93–100 (1980)
Cleve, R., Høyer, P., Toner, B., Watrous, J.: Consequences and limits of nonlocal strategies. In: Proc. 19th IEEE Conf. on Computational Complexity (CCC 2004), pp. 236–249. IEEE Computer Society (2004)
Colbeck, R.: Quantum and Relativistic Protocols for Secure Multi-Party Computation. Ph.D. thesis, Trinity College, University of Cambridge (November 2006)
Colbeck, R., Kent, A.: Private randomness expansion with untrusted devices. Journal of Physics A: Mathematical and Theoretical 44(9), 095305 (2011)
Colbeck, R., Renner, R.: Free randomness can be amplified. Nature Physics 8(6), 450–454 (2012)
Coudron, M., Vidick, T., Yuen, H.: Robust randomness amplifiers: Upper and lower bounds. Tech. rep., arXiv:1305.6626 (2013)
Doherty, A.C., Liang, Y.C., Toner, B., Wehner, S.: The quantum moment problem and bounds on entangled multi-prover games. In: Proc. 23rd IEEE Conf. on Computational Complexity (CCC 2008), pp. 199–210. IEEE Computer Society (2008)
Fehr, S., Gelles, R., Schaffner, C.: Security and composability of randomness expansion from Bell inequalities. Phys. Rev. A 87, 012335 (2013), http://link.aps.org/doi/10.1103/PhysRevA.87.012335
Linden, N., Popescu, S., Short, A.J., Winter, A.: Quantum nonlocality and beyond: Limits from nonlocal computation. Phys. Rev. Lett. 99, 180502 (2007)
Nielsen, M.A., Chuang, I.L.: Quantum computation and quantum information. Cambridge University Press (2010)
Pironio, S., Acin, A., Massar, S., De La Giroday, A.B., Matsukevich, D.N., Maunz, P., Olmschenk, S., Hayes, D., Luo, L., Manning, T.A., et al.: Random numbers certified by Bell’s theorem. Nature 464(7291), 10 (2010)
Pironio, S., Massar, S.: Security of practical private randomness generation. Phys. Rev. A 87, 012336 (2013), http://link.aps.org/doi/10.1103/PhysRevA.87.012336
Radhakrishnan, J., Ta-Shma, A.: Bounds for dispersers, extractors, and depth-two superconcentrators. SIAM Journal on Discrete Mathematics 13(1), 2–24 (2000)
Renner, R.: Security of Quantum Key Distribution. Ph.D. thesis, Swiss Federal Institute of Technology Zurich (September 2005)
Shaltiel, R.: Recent developments in explicit constructions of extractors. Bulletin of the European Association for Theoretical Computer Science 77, 67–95 (2002)
Vazirani, U., Vidick, T.: Certifiable quantum dice: or, true random number generation secure against quantum adversaries. In: Proceedings of the 44th Symposium on Theory of Computing, STOC 2012, pp. 61–76. ACM (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Coudron, M., Vidick, T., Yuen, H. (2013). Robust Randomness Amplifiers: Upper and Lower Bounds. In: Raghavendra, P., Raskhodnikova, S., Jansen, K., Rolim, J.D.P. (eds) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. APPROX RANDOM 2013 2013. Lecture Notes in Computer Science, vol 8096. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40328-6_33
Download citation
DOI: https://doi.org/10.1007/978-3-642-40328-6_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40327-9
Online ISBN: 978-3-642-40328-6
eBook Packages: Computer ScienceComputer Science (R0)