Work

Efficient Certifiable Randomness from a Single Quantum Device

Year: 2022

Type: article

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.

Source: CaltechAUTHORS (California Institute of Technology)

DOI: 10.48550/arxiv.2204.11353

Authors: Mahadev, Urmila, Vazirani, Umesh, Vidick, Thomas

Institutions: California Institute of Technology, University of California, Berkeley

Language: English

Topic: Quantum Information and Cryptography

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W4224925655

FWCI: 0.245

Cites:

Cited by: 3

Related to: 10