4 citations · 7 across the 4 of their papers we have counts for
5 papers
Efficient Certifiable Randomness from a Single Quantum Device
Urmila Mahadev, Umesh Vazirani, Thomas Vidick
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 l…
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…
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…
Classical Homomorphic Encryption for Quantum Circuits
Urmila Mahadev
We present the first leveled fully homomorphic encryption scheme for quantum circuits with classical keys. The scheme allows a classical client to blindly delegate a quantum comput…
Rational approximations and quantum algorithms with postselection
Urmila Mahadev, Ronald de Wolf
We study the close connection between rational functions that approximate a given Boolean function, and quantum algorithms that compute the same function using postselection. We sh…