@inproceedings{b94db44e92944d29be958e2cf0b2247f,
title = "A cryptographic test of quantumness and certifiable randomness from a single quantum device",
abstract = "We give a protocol for producing certifiable randomness from a single untrusted quantum device that is polynomial-time bounded. The randomness is certified to be statistically close to uniform from the point of view of any computationally unbounded quantum adversary, that may share entanglement with the quantum device. The protocol relies on the existence of post-quantum secure trapdoor claw-free functions, and introduces a new primitive for constraining the power of an untrusted quantum device. We then show how to construct this primitive based on the hardness of the learning with errors (LWE) problem. The randomness protocol can also be used as the basis for an efficiently verifiable {"}quantum supremacy{"} proposal, thus answering an outstanding challenge in the field.",
author = "Zvika Brakerski and Pau Christiano and Urmilal Mahadev and Umesh Vazirani and Thomas Vidick",
note = "NA; 59th IEEE Annual Symposium on Foundations of Computer Science (FOCS) ; Conference date: 07-10-2018 Through 09-10-2018",
year = "2018",
month = dec,
day = "2",
doi = "https://doi.org/10.1109/FOCS.2018.00038",
language = "الإنجليزيّة",
series = "Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS",
pages = "320--331",
booktitle = "Proceedings - 59th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2018",
}