Efficient Certifiable Randomness from a Single Quantum Device
Quantum Physics
2022-04-26 v1 Computational Complexity
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 fresh bits of randomness in constant rounds, where is a parameter of the protocol and the total communication is , thus achieving a nearly optimal rate. The proof that the output is statistically random is conceptually simple and technically elementary.
Cite
@article{arxiv.2204.11353,
title = {Efficient Certifiable Randomness from a Single Quantum Device},
author = {Urmila Mahadev and Umesh Vazirani and Thomas Vidick},
journal= {arXiv preprint arXiv:2204.11353},
year = {2022}
}