Skip to main content
U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

Local Randomness: Examples and Application

Published

Author(s)

Honghao Fu, Carl Miller

Abstract

When two players achieve a superclassical score at a nonlocal game, their outputs must contain intrinsic randomness. This fact has many useful implications for quantum cryptography. Recently it has been observed (C. Miller, Y. Shi, Quant. Inf. & Comp. 17, pp. 0595-0610, 2017) that such scores also imply the existence of local randomness -- that is, randomness known to one player but not to the other. This has potential implications for cryptographic tasks between two cooperating but mistrustful players. In the current paper we bring this notion toward practical realization, by offering a near-optimal bound on local randomness for the CHSH game, and also proving the security of a cryptographic application of local randomness (single-bit certified deletion).
Citation
Physical Review A
Volume
97
Issue
3

Keywords

Bell inequalities, certified randomness, quantum cryptography, information erasure

Citation

Fu, H. and Miller, C. (2018), Local Randomness: Examples and Application, Physical Review A, [online], https://doi.org/10.1103/PhysRevA.97.032324, https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=924376 (Accessed December 5, 2024)

Issues

If you have any questions about this publication or are having problems accessing it, please contact reflib@nist.gov.

Created March 18, 2018, Updated October 12, 2021