arXiv Analytics

Sign in

arXiv:1708.02130 [quant-ph]AbstractReferencesReviewsResources

Classical Homomorphic Encryption for Quantum Circuits

Urmila Mahadev

Published 2017-08-07Version 1

We present a computationally secure classical homomorphic encryption scheme for quantum circuits. The scheme allows a classical server to blindly delegate a quantum computation to a quantum server; the server is able to run the computation without learning about the computation itself. This result relies on post-quantum classical cryptographic tools, including sub-exponentially secure indistinguishability obfuscation and pseudorandom function families, as well as classical homomorphic encryption and learning with errors.

Related articles: Most relevant | Search more
arXiv:1210.0974 [quant-ph] (Published 2012-10-03, updated 2013-04-03)
Quantum circuits of T-depth one
arXiv:1712.04954 [quant-ph] (Published 2017-12-13)
Measuring and Suppressing Error Correlations in Quantum Circuits
arXiv:2004.13827 [quant-ph] (Published 2020-04-28)
Characterization of quantum states based on creation complexity