Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published December 21, 2022 | Submitted
Report Open

Efficient Certifiable Randomness from a Single Quantum Device

Abstract

Brakerski et. al [BCM+18] introduced the model of cryptographic testing of a single untrusted quantum device and gave a protocol for certifiable randomness generation. We use the leakage resilience properties of the Learning With Errors problem to address a key issue left open in previous work - the rate of generation of randomness. Our new protocol can certify Ω(n) fresh bits of randomness in constant rounds, where n is a parameter of the protocol and the total communication is O(n), thus achieving a nearly optimal rate. The proof that the output is statistically random is conceptually simple and technically elementary.

Additional Information

Attribution 4.0 International (CC BY 4.0). T.V. is supported by AFOSR YIP award number FA9550-16-1-0495, a grant from the Simons Foundation (828076, TV), MURI Grant FA9550-18-1-0161, the NSF QLCI program through grant number OMA-2016245 and the IQIM, an NSF Physics Frontiers Center (NSF Grant PHY-1125565) with support of the Gordon and Betty Moore Foundation (GBMF-12500028). U.M. is supported by an NSF CAREER grant (2048204). U.V. is supported by Vannevar Bush faculty fellowship N00014-17-1-3025, MURI Grant FA9550-18-1-0161, and DOE NQISRC Quantum Systems Accelerator grant FP00010905.

Attached Files

Submitted - 2204.11353.pdf

Files

2204.11353.pdf
Files (255.1 kB)
Name Size Download all
md5:d8da069f3aff7c3bee16d27c1eab31be
255.1 kB Preview Download

Additional details

Created:
August 20, 2023
Modified:
October 24, 2023