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• 18 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

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•77 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•55 citations

On statistically-secure quantum homomorphic encryption

Ching–Yi Lai, Kai-Min Chung

Homomorphic encryption is an encryption scheme that allows computations to be evaluated on encrypted inputs without knowledge of their raw messages. Recently Ouyang et al. constructed a quantum homomorphic encryption (QHE) scheme for Clifford circuits with statistical security (or information-theoretic security (IT-security)). It is desired to see whether an information-theoretically-secure (ITS) quantum FHE exists. If not, what other nontrivial class of quantum circuits can be homomorphically evaluated with IT-security? We provide a limitation for the first question that an ITS quantum FHE necessarily incurs exponential overhead. As for the second one, we propose a QHE scheme for the instantaneous quantum polynomial-time (IQP) circuits. Our QHE scheme for IQP circuits follows from the one-time pad.

arXiv:1705.00139•Quantum Information and Computation•Aug 1, 2018•29 citations

Toward practical quantum encryption in phase space: simulated QPSK and 16-QAM with dynamic displacement operators

Chenyu Zhang, Randy Kuang, Jian Xu +4 more

Building upon the theoretical framework of Dynamic Displacement Operators (DDO) introduced in Ref. (Kuang, in Acad Quantum 2, 2025 , https://doi.org/10.20935/AcadQuant7462 ), we present a simulation validation of a quantum-enhanced encryption scheme for coherent optical communication systems in phase space. The method integrates random phase shift operators (PSOs) and displacement operators (DOs) to dynamically manipulate information symbols on a symbol-by-symbol basis, enabling secure physical-layer encryption. Simulation results confirm that accurate decryption is only possible with the correct operator pair; any mismatch in displacement or phase parameters leads to bit error rates approaching 50%, effectively blocking unauthorized access. We further compare the performance of unencrypted transmission with various quantum-enhanced physical-layer security (QEPS) configurations over different fiber lengths, and explicitly validate the scalability of the proposed scheme by simulating a higher-order Quantum Permutation Pad (QPP) with a depth of \(m = 2\) for 16-QAM. The results validate the robustness of the proposed DDO-based scheme against partial or incorrect decryption attempts, underscoring its potential for securing data transmission in classical optical networks.

EPJ Quantum Technology•Feb 27, 2026•1 citation
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.
Homomorphic encryption is an encryption scheme that allows computations to be evaluated on encrypted inputs without knowledge of their raw messages. Recently Ouyang et al. constructed a quantum homomorphic encryption (QHE) scheme for Clifford circuits with statistical security (or information-theoretic security (IT-security)). It is desired to see whether an information-theoretically-secure (ITS) quantum FHE exists. If not, what other nontrivial class of quantum circuits can be homomorphically evaluated with IT-security? We provide a limitation for the first question that an ITS quantum FHE necessarily incurs exponential overhead. As for the second one, we propose a QHE scheme for the instantaneous quantum polynomial-time (IQP) circuits. Our QHE scheme for IQP circuits follows from the one-time pad.
Building upon the theoretical framework of Dynamic Displacement Operators (DDO) introduced in Ref. (Kuang, in Acad Quantum 2, 2025 , https://doi.org/10.20935/AcadQuant7462 ), we present a simulation validation of a quantum-enhanced encryption scheme for coherent optical communication systems in phase space. The method integrates random phase shift operators (PSOs) and displacement operators (DOs) to dynamically manipulate information symbols on a symbol-by-symbol basis, enabling secure physical-layer encryption. Simulation results confirm that accurate decryption is only possible with the correct operator pair; any mismatch in displacement or phase parameters leads to bit error rates approaching 50%, effectively blocking unauthorized access. We further compare the performance of unencrypted transmission with various quantum-enhanced physical-layer security (QEPS) configurations over different fiber lengths, and explicitly validate the scalability of the proposed scheme by simulating a higher-order Quantum Permutation Pad (QPP) with a depth of m=2m = 2m=2 for 16-QAM. The results validate the robustness of the proposed DDO-based scheme against partial or incorrect decryption attempts, underscoring its potential for securing data transmission in classical optical networks.