4 citations · 7 across the 4 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
quant-ph2018★ 2 cited
Classical Verification of Quantum Computations
Urmila Mahadev
We present the first protocol allowing a classical computer to interactively verify the result of an efficient quantum computation. We achieve this by constructing a measurement pr…
quant-ph2018★ 1 cited
A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device
Zvika Brakerski, Paul Christiano, Urmila Mahadev +2
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 ver…