Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1902.10972 · Physical Review Research

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

Yingkai Ouyang, Si-Hui Tan, Joseph Fitzsimons, Peter P. Rohde

Published Mar 18, 2020• 14 citations
arXivHTMLPDF

Abstract

The authors quantify how indistinguishable any pair of quantum states with constrained energy can be after they both experience a random displacement in phase space. This continuous variable analogue of a quantum one-time pad allows one to securely delegate quantum optical computation and is easy to implement with present-day technology.
DOI
10.1103/physrevresearch.2.013332

Related papers

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

Ouyang, Y., Tan, S.-H., Fitzsimons, J. +1 more

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

•Feb 28, 2019•15 citations

Practical somewhat-secure quantum somewhat-homomorphic encryption with coherent states

Si-Hui Tan, Yingkai Ouyang, Peter P. Rohde

We present a scheme for implementing homomorphic encryption on coherent states encoded using phase-shift keys. The encryption operations require only rotations in phase space, which commute with computations in the code space performed via passive linear optics, and with generalized nonlinear phase operations that are polynomials of the photon-number operator in the code space. This encoding scheme can thus be applied to any computation with coherent-state inputs, and the computation proceeds via a combination of passive linear optics and generalized nonlinear phase operations. An example of such a computation is matrix multiplication, whereby a vector representing coherent-state amplitudes is multiplied by a matrix representing a linear optics network, yielding a new vector of coherent-state amplitudes. By finding an orthogonal partitioning of the support of our encoded states, we quantify the security of our scheme via the indistinguishability of the encrypted code words. While we focus on coherent-state encodings, we expect that this phase-key encoding technique could apply to any continuous-variable computation scheme where the phase-shift operator commutes with the computation.

arXiv:1710.03968•Physical Review A•Apr 5, 2018•20 citations

Quantum photonics for secure quantum and classical computing (Conference Presentation)

Philip John Walther

The precise quantum control of single photons, together with the intrinsic advantage of being mobile make optical quantum system ideally suited for delegated quantum information tasks, reaching from well-established quantum cryptography to quantum clouds and quantum computer networks. Here I will present that the exploit of quantum photonics allows for a variety of quantum-enhanced data security for quantum and classical computers. First, I will present a homomorphic-encrypted quantum random walk using single-photon states and non-birefringent integrated optics. The client encrypts their input state in the photons’ polarization degree of freedom, while the server performs the computation using the path degree of freedom. Then I will briefly discuss the realization of a feasible hybrid classical-quantum technology, which shows promising new applications of readily available quantum photonics technology for secure classical computing by enabling probabilistic one-time programs.

•Oct 18, 2019•0 citations

Limitations on information-theoretically-secure quantum homomorphic encryption

Li Zhi Yu, Carlos A. Pérez-Delgado, Joseph F. Fitzsimons

Homomorphic encryption is a form of encryption which allows computation to be carried out on the encrypted data without the need for decryption. The success of quantum approaches to related tasks in a delegated computation setting has raised the question of whether quantum mechanics may be used to achieve information-theoretically-secure fully homomorphic encryption. Here we show, via an information localization argument, that deterministic fully homomorphic encryption necessarily incurs exponential overhead if perfect security is required.

arXiv:1406.2456•Physical Review A•Nov 10, 2014•75 citations

Experimental quantum homomorphic encryption

Jonas Zeuner, Ioannis Pitsios, Si-Hui Tan +4 more

Abstract Quantum computers promise not only to outperform classical machines for certain important tasks, but also to preserve privacy of computation. For example, the blind quantum computing protocol enables secure delegated quantum computation, where a client can protect the privacy of their data and algorithms from a quantum server assigned to run the computation. However, this security comes with the practical limitation that the client and server must communicate after each step of computation. A practical alternative is homomorphic encryption, which does not require any interactions, while providing quantum-enhanced data security for a variety of computations. In this scenario, the server specifies the computation to be performed, and the client provides only the input data, thus enabling secure noninteractive computation. Here, we demonstrate homomorphic-encrypted quantum computing with unitary transformations of individual qubits, as well as multi-qubit quantum walk computations using single-photon states and non-birefringent integrated optics. The client encrypts their input in the photons’ polarization state, while the server performs the computation using the path degree of freedom. Our demonstration using integrated quantum photonics underlines the applicability of homomorphic-encrypted quantum computations, and shows the potential for delegated quantum computing using photons.

arXiv:1803.10246•npj Quantum Information•Feb 5, 2021•51 citations

Quantum fully homomorphic encryption on single qubit

Min Liang

Suppose some data have been encrypted, can you compute with the data without decrypting them? This problem has been studied as homomorphic encryption and blind computing. We consider this problem in the context of quantum information processing, and present the definitions of quantum homomorphic encryption (QHE) and quantum fully homomorphic encryption (QFHE). Then, based on quantum one-time pad (QOTP), we construct a symmetric QFHE scheme, where the evaluate algorithm depends on the secret key. This scheme permits any unitary transformation on any $n$-qubit state that has been encrypted. Compared with classical homomorphic encryption, the QFHE scheme has perfect security. Finally, we also construct a QOTP-based symmetric QHE scheme, where the evaluate algorithm is independent of the secret key.

•Apr 18, 2013•0 citations
Future quantum computers are likely to be expensive and affordable outright\nby few, motivating client/server models for outsourced computation. However,\nthe applications for quantum computing will often involve sensitive data, and\nthe client would like to keep her data secret, both from eavesdroppers and the\nserver itself. Homomorphic encryption is an approach for encrypted, outsourced\nquantum computation, where the client's data remains secret, even during\nexecution of the computation. We present a scheme for the homomorphic\nencryption of arbitrary quantum states of light with no more than a fixed\nnumber of photons, under the evolution of both passive and adaptive linear\noptics, the latter of which is universal for quantum computation. The scheme\nuses random coherent displacements in phase-space to obfuscate client data. In\nthe limit of large coherent displacements, the protocol exhibits asymptotically\nperfect information-theoretic secrecy. The experimental requirements are\nmodest, and easily implementable using present-day technology.
We present a scheme for implementing homomorphic encryption on coherent states encoded using phase-shift keys. The encryption operations require only rotations in phase space, which commute with computations in the code space performed via passive linear optics, and with generalized nonlinear phase operations that are polynomials of the photon-number operator in the code space. This encoding scheme can thus be applied to any computation with coherent-state inputs, and the computation proceeds via a combination of passive linear optics and generalized nonlinear phase operations. An example of such a computation is matrix multiplication, whereby a vector representing coherent-state amplitudes is multiplied by a matrix representing a linear optics network, yielding a new vector of coherent-state amplitudes. By finding an orthogonal partitioning of the support of our encoded states, we quantify the security of our scheme via the indistinguishability of the encrypted code words. While we focus on coherent-state encodings, we expect that this phase-key encoding technique could apply to any continuous-variable computation scheme where the phase-shift operator commutes with the computation.
The precise quantum control of single photons, together with the intrinsic advantage of being mobile make optical quantum system ideally suited for delegated quantum information tasks, reaching from well-established quantum cryptography to quantum clouds and quantum computer networks. Here I will present that the exploit of quantum photonics allows for a variety of quantum-enhanced data security for quantum and classical computers. First, I will present a homomorphic-encrypted quantum random walk using single-photon states and non-birefringent integrated optics. The client encrypts their input state in the photons’ polarization degree of freedom, while the server performs the computation using the path degree of freedom. Then I will briefly discuss the realization of a feasible hybrid classical-quantum technology, which shows promising new applications of readily available quantum photonics technology for secure classical computing by enabling probabilistic one-time programs.
Homomorphic encryption is a form of encryption which allows computation to be carried out on the encrypted data without the need for decryption. The success of quantum approaches to related tasks in a delegated computation setting has raised the question of whether quantum mechanics may be used to achieve information-theoretically-secure fully homomorphic encryption. Here we show, via an information localization argument, that deterministic fully homomorphic encryption necessarily incurs exponential overhead if perfect security is required.
Abstract Quantum computers promise not only to outperform classical machines for certain important tasks, but also to preserve privacy of computation. For example, the blind quantum computing protocol enables secure delegated quantum computation, where a client can protect the privacy of their data and algorithms from a quantum server assigned to run the computation. However, this security comes with the practical limitation that the client and server must communicate after each step of computation. A practical alternative is homomorphic encryption, which does not require any interactions, while providing quantum-enhanced data security for a variety of computations. In this scenario, the server specifies the computation to be performed, and the client provides only the input data, thus enabling secure noninteractive computation. Here, we demonstrate homomorphic-encrypted quantum computing with unitary transformations of individual qubits, as well as multi-qubit quantum walk computations using single-photon states and non-birefringent integrated optics. The client encrypts their input in the photons’ polarization state, while the server performs the computation using the path degree of freedom. Our demonstration using integrated quantum photonics underlines the applicability of homomorphic-encrypted quantum computations, and shows the potential for delegated quantum computing using photons.
Suppose some data have been encrypted, can you compute with the data without decrypting them? This problem has been studied as homomorphic encryption and blind computing. We consider this problem in the context of quantum information processing, and present the definitions of quantum homomorphic encryption (QHE) and quantum fully homomorphic encryption (QFHE). Then, based on quantum one-time pad (QOTP), we construct a symmetric QFHE scheme, where the evaluate algorithm depends on the secret key. This scheme permits any unitary transformation on any nnn-qubit state that has been encrypted. Compared with classical homomorphic encryption, the QFHE scheme has perfect security. Finally, we also construct a QOTP-based symmetric QHE scheme, where the evaluate algorithm is independent of the secret key.