The recent discovery of fully homomorphic classical encryption schemes has had a dramatic effect on the direction of modern cryptography. Such schemes, however, implicitly rely on the assumption that solving certain computation problems is intractable. Here we present a quantum encryption scheme which is homomorphic for arbitrary classical and quantum circuits which have at most some constant number of non-Clifford gates. Unlike classical schemes, the security of the scheme we present is information theoretic and hence independent of the computational power of an adversary.

• Received 15 July 2016
• Revised 22 May 2017

DOI:https://doi.org/10.1103/PhysRevA.98.042334