A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device
Apr 2, 2018
45 pages
Published in:
- J.Assoc.Comput.Machinery (2021) 31
- Published: Aug 12, 2021
e-Print:
- 1804.00640 [quant-ph]
DOI:
View in:
Citations per year
Abstract: (Association for Computing Machinery)
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.Note:
- 45 pages
- Test of quantumness
- certified randomness
- quantum interactive proofs
- quantum device
- quantum cryptography
- quantum simulation
References(47)
Figures(0)
- [1]
- [2]
- [3]
- [4]
- [5]
- [6]
- [7]
- [8]
- [9]
- [10]
- [11]
- [12]
- [13]
- [14]
- [15]
- [16]
- [17]
- [18]
- [18]
- [19]
- [20]
- [21]
- [22]
- [23]
- [24]