Homomorphic encryption of linear optics quantum computation on almost arbitrary states of light with asymptotically perfect security

Future quantum computers are likely to be expensive and affordable outright by few, motivating client/server models for outsourced computation. However, the applications for quantum computing will often involve sensitive data, and the client would like to keep her data secret, both from eavesdroppers and the server itself. Homomorphic encryption is an approach for encrypted, outsourced quantum computation, where the client's data remains secret, even during execution of the computation. We present a scheme for the homomorphic encryption of arbitrary quantum states of light with no more than a fixed number of photons, under the evolution of both passive and adaptive linear optics, the latter of which is universal for quantum computation. The scheme uses random coherent displacements in phase-space to obfuscate client data. In the limit of large coherent displacements, the protocol exhibits asymptotically perfect information-theoretic secrecy. The experimental requirements are modest, and easily implementable using present-day technology.

[1]  E. Knill,et al.  A scheme for efficient quantum computation with linear optics , 2001, Nature.

[2]  David P. DiVincenzo,et al.  Quantum information and computation , 2000, Nature.

[3]  Li Yu,et al.  Limitations on information theoretically secure quantum homomorphic encryption , 2014, ArXiv.

[4]  Timothy C. Ralph,et al.  Error tolerance of the boson-sampling model for linear optics quantum computing , 2011, 1111.2426.

[5]  Kai-Min Chung,et al.  Quantum encryption and generalized Shannon impossibility , 2018, Designs, Codes and Cryptography.

[6]  Liang Jiang,et al.  New class of quantum error-correcting codes for a bosonic mode , 2016, 1602.00008.

[7]  R. Stephenson A and V , 1962, The British journal of ophthalmology.

[8]  Sanjeev Arora,et al.  Computational Complexity: A Modern Approach , 2009 .

[9]  Yingkai Ouyang,et al.  Truncated quantum channel representations for coupled harmonic oscillators , 2013, 1301.4547.

[10]  Christian Weedbrook,et al.  Continuous-variable quantum computing on encrypted data , 2016, Nature Communications.

[11]  J. Preskill,et al.  Encoding a qubit in an oscillator , 2000, quant-ph/0008040.

[12]  Michael Mitzenmacher,et al.  Proceedings of the forty-first annual ACM symposium on Theory of computing , 2009, STOC 2009.

[13]  Peter P Rohde,et al.  Quantum walks with encrypted data. , 2012, Physical review letters.

[14]  G. Arfken Mathematical Methods for Physicists , 1967 .

[15]  Peter P. Rohde,et al.  Practical somewhat-secure quantum somewhat-homomorphic encryption with coherent states , 2017, 1710.03968.

[16]  Barry C. Sanders,et al.  Universal continuous-variable quantum computation: Requirement of optical nonlinearity for photon counting , 2002 .

[17]  S. Braunstein Squeezing as an irreducible resource , 1999, quant-ph/9904002.

[18]  Pieter Kok,et al.  Introduction to Optical Quantum Information Processing: Preface , 2010 .

[19]  Lin Chen,et al.  A quantum approach to homomorphic encryption , 2014, Scientific Reports.

[20]  David Pointcheval,et al.  Advances in Cryptology – EUROCRYPT 2012 , 2012, Lecture Notes in Computer Science.

[21]  G. Milburn,et al.  Linear optical quantum computing with photonic qubits , 2005, quant-ph/0512071.

[22]  Carlton M. Caves,et al.  Sufficient Conditions for Efficient Classical Simulation of Quantum Optics , 2015, 1511.06526.

[23]  J. Fitzsimons,et al.  Quantum homomorphic encryption from quantum codes , 2015, Physical Review A.

[24]  Albert Messiah,et al.  The canonical form of an antisymmetric tensor and its application to the theory of superconductivity , 1962 .

[25]  R. Varga Geršgorin And His Circles , 2004 .

[26]  Kai-Min Chung,et al.  Quantum Encryption and Generalized Quantum Shannon Impossibility. , 2018 .