Local randomness: Examples and application

Honghao Fu and Carl A. Miller
Phys. Rev. A 97, 032324 – Published 19 March 2018

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 and Y. Shi, Quantum Inf. Computat. 17, 0595 (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 near-optimal bounds on local randomness for the CHSH game, and also proving the security of a cryptographic application of local randomness (single-bit certified deletion).

  • Figure
  • Received 18 September 2017
  • Revised 7 February 2018

DOI:https://doi.org/10.1103/PhysRevA.97.032324

©2018 American Physical Society

Physics Subject Headings (PhySH)

Quantum Information, Science & TechnologyGeneral Physics

Authors & Affiliations

Honghao Fu1 and Carl A. Miller1,2

  • 1Department of Computer Science, Institute for Advanced Computer Studies, and Joint Center for Quantum Information and Computer Science, University of Maryland, College Park, Maryland 20742, USA
  • 2National Institute of Standards and Technology, 100 Bureau Drive, Gaithersburg, Maryland 20899, USA

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 97, Iss. 3 — March 2018

Reuse & Permissions
Access Options
CHORUS

Article Available via CHORUS

Download Accepted Manuscript
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review A

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×