A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device
Journal of the ACM · 31.10.2021 · 68 (5) · 1-47
DOI: 10.1145/3441309 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of the ACM, online erschienen am 12.08.2021. Verfasst von Zvika Brakerski und 4 weiteren Autor:innen. Die Arbeit wurde bisher 50-mal zitiert (Crossref) und nennt 44 Literaturangaben.
Abstract (Originalsprache)
We consider a new model for the testing of untrusted quantum devices, consisting of a single polynomial time bounded quantum device interacting with a classical polynomial time verifier. In this model, we propose solutions to two tasks—a protocol for efficient classical verification that the untrusted device is “truly quantum” and a protocol for producing certifiable randomness from a single untrusted quantum device. Our solution relies on the existence of a new cryptographic primitive for constraining the power of an untrusted quantum device: post-quantum secure trapdoor claw-free functions that must satisfy an adaptive hardcore bit property. We show how to construct this primitive based on the hardness of the learning with errors (LWE) problem.
Zitieren
APA
Brakerski, Z., Christiano, P., Mahadev, U., Vazirani, U., & Vidick, T. (2021). A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device. Journal of the ACM, 68(5), 1-47. https://doi.org/10.1145/3441309
Vancouver
Brakerski Z, Christiano P, Mahadev U, Vazirani U, Vidick T. A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device. Journal of the ACM. 2021;68(5):1-47. doi:10.1145/3441309
BibTeX
@article{Brakerski2021,
author = {Brakerski, Zvika and Christiano, Paul and Mahadev, Urmila and Vazirani, Umesh and Vidick, Thomas},
title = {A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device},
journal = {Journal of the ACM},
year = {2021},
volume = {68},
number = {5},
pages = {1--47},
doi = {10.1145/3441309}
}
EUVIMED