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

Physical Review Letters

Experimental Quantum Homomorphic Encryption Using a Quantum Photonic Chip

Yuan Li, Lin Cao, Wei Luo, Hui Zhang, Hong Nian Cai, Muhammad Faeyz Karim, Feng Gao, Joseph F. Fitzsimons, Qinghua Song, A. Q. Liu

Published May 14, 2024• 9 citations
Publisher

Abstract

A fully homomorphic encryption system enables computation on encrypted data without the necessity for prior decryption. This facilitates the seamless establishment of a secure quantum channel, bridging the server and client components, and thereby providing the client with secure access to the server's substantial computational capacity for executing quantum operations. However, traditional homomorphic encryption systems lack scalability, programmability, and stability. In this Letter, we experimentally demonstrate a proof-of-concept implementation of a homomorphic encryption scheme on a compact quantum chip, verifying the feasibility of using photonic chips for quantum homomorphic encryption. Our work not only provides a solution for circuit expansion, addressing the longstanding challenge of scalability while significantly reducing the size of quantum network infrastructure, but also lays the groundwork for the development of highly sophisticated quantum fully homomorphic encryption systems.

DOI
10.1103/physrevlett.132.200801

Related papers

Demonstrating Quantum Homomorphic Encryption Through Simulation

Sohrab Ganjian, Connor Paddock, Anne Broadbent

Cloud computing allows clients with limited computational resources to offload computations to more powerful remote servers. In this paradigm, homomorphic encryption (HE) schemes enable a server to run any computation on a client's encrypted data. These schemes are widely used in cloud computing protocols such as delegated computing, two-party secure computation, and zero-knowledge proofs. Quantum homomorphic encryption (QHE) aims to achieve the objectives of HE with quantum data and quantum circuits, enabling cloud quantum servers to compute on encrypted quantum data uploaded by clients. In this work, we consider a scenario where a client has access to a quantum “encryption/decryption device”, which allows the encryption, transmission, reception, and decryption of quantum states, but not universal quantum computation. In this setting, we provide a proof-of-concept software simulation of quantum homomorphic encryption. Our code implements the “EPR scheme” of Broadbent and Jeffery, which allows for the execution of universal quantum circuits by the server at the cost of requiring shared EPR pairs between the client and server. Our implementation explores the near-term viability of the EPR scheme. Perhaps unsurprisingly, our experiments indicate that the additional cost of homomorphic circuit evaluation is minor in comparison to the simulation cost of the quantum operations. Our simulation toolkit is implemented in Python and is open-source.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 15, 2024•5 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

Simulation of Quantum Homomorphic Encryption: Demonstration and Analysis

Sohrab Ganjian, Connor Paddock, Anne Broadbent

Quantum homomorphic encryption (QHE), allows a quantum cloud server to compute on private data as uploaded by a client. We provide a proof-of-concept software simulation for QHE, according to the "EPR" scheme of Broadbent and Jeffery, for universal quantum circuits. We demonstrate the near-term viability of this scheme and provide verification that the additional cost of homomorphic circuit evaluation is minor when compared to the simulation cost of the quantum operations. Our simulation toolkit, py−qhe−epr package, is an open-source Python implementation, that serves as a step towards further hardware applications of quantum homomorphic encryption between networked quantum devices.

arXiv:2406.16247•IEEE International Conference on Trust, Privacy and Security in Intelligent Systems and Applications (TPS-ISA)•Oct 28, 2024•1 citation

A Secure Multiparty Quantum Homomorphic Encryption Scheme

Jingwen Zhang, Xiu‐Bo Chen, Gang Xu +4 more

The significant advantage of the quantum homomorphic encryption scheme is to ensure the perfect security of quantum private data. In this paper, a novel secure multiparty quantum homomorphic encryption scheme is proposed, which can complete arbitrary quantum computation on the private data of multiple clients without decryption by an almost dishonest server. Firstly, each client obtains a secure encryption key through the measurement device independent quantum key distribution protocol and encrypts the private data by using the encryption operator and key. Secondly, with the help of the almost dishonest server, the non-maximally entangled states are pre-shared between the client and the server to correct errors in the homomorphic evaluation of T gates, so as to realize universal quantum circuit evaluation on encrypted data. Thirdly, from the perspective of the application scenario of secure multi-party computation, this work is based on the probabilistic quantum homomorphic encryption scheme, allowing multiple parties to delegate the server to perform the secure homomorphic evaluation. The operation and the permission to access the data performed by the client and the server are clearly pointed out. Finally, a concrete security analysis shows that the proposed multiparty quantum homomorphic encryption scheme can securely resist outside and inside attacks.

Computers, materials & continua/Computers, materials & continua (Print)•Jan 1, 2022•3 citations

Implementation and Analysis of Quantum Homomorphic Encryption

Maxwell Yarter, Glen S. Uehara, Andreas Spanias

Growing interest in the field of quantum computing is fueled by quantum computers projected ”quantum supremacy” in speed and security. The potential for ultra-high speeds may produce a dramatic change in data science, machine learning, analytics, and information processing. This research study will focus on encryption algorithms where quantum computing may affect protocols and deciphering codes. Specifically, homomorphic encryption (HE) enables mathematical operations to be performed on encrypted data without having to decrypt the data in the process. Quantum homomorphic encryption (QHE) enables quantum circuits to be performed on encrypted qubits. In this research experience for undergraduates (REU) study, we design quantum circuits to implement QHE on a quantum teleportation circuit. The teleportation algorithm is profiled in terms of performance and complexity and comparative results are provided for encoded versus unencoded circuits. This work serves as a building block for encrypting more complex quantum algorithms such as Quantum Neural Networks (QNN).

International Conference on Information, Intelligence, Systems & Applications (IISA)•Jul 18, 2022•12 citations

Quantum fully homomorphic encryption scheme based on quantum fault-tolerant construction

Min Liang, Li Yang

Fully homomorphic encryption is a kind of encryption scheme, which enables arbitrary computation on encrypted data without accessing the data. We present the quantum version of fully homomorphic encryption scheme, which is constructed based on quantum fault-tolerant construction. Two schemes are constructed. The first is a symmetric scheme, and the secret key is the quantum CSS code. In the scheme, when Server performs quantum computation on the encrypted plaintext, some ancillary quantum states should be provided by Client. The second is an asymmetric scheme, which contains the periodical interaction between Client and Server.

arXiv:1503.04061•Mar 13, 2015•7 citations
A fully homomorphic encryption system enables computation on encrypted data without the necessity for prior decryption. This facilitates the seamless establishment of a secure quantum channel, bridging the server and client components, and thereby providing the client with secure access to the server's substantial computational capacity for executing quantum operations. However, traditional homomorphic encryption systems lack scalability, programmability, and stability. In this Letter, we experimentally demonstrate a proof-of-concept implementation of a homomorphic encryption scheme on a compact quantum chip, verifying the feasibility of using photonic chips for quantum homomorphic encryption. Our work not only provides a solution for circuit expansion, addressing the longstanding challenge of scalability while significantly reducing the size of quantum network infrastructure, but also lays the groundwork for the development of highly sophisticated quantum fully homomorphic encryption systems.
Cloud computing allows clients with limited computational resources to offload computations to more powerful remote servers. In this paradigm, homomorphic encryption (HE) schemes enable a server to run any computation on a client's encrypted data. These schemes are widely used in cloud computing protocols such as delegated computing, two-party secure computation, and zero-knowledge proofs. Quantum homomorphic encryption (QHE) aims to achieve the objectives of HE with quantum data and quantum circuits, enabling cloud quantum servers to compute on encrypted quantum data uploaded by clients. In this work, we consider a scenario where a client has access to a quantum “encryption/decryption device”, which allows the encryption, transmission, reception, and decryption of quantum states, but not universal quantum computation. In this setting, we provide a proof-of-concept software simulation of quantum homomorphic encryption. Our code implements the “EPR scheme” of Broadbent and Jeffery, which allows for the execution of universal quantum circuits by the server at the cost of requiring shared EPR pairs between the client and server. Our implementation explores the near-term viability of the EPR scheme. Perhaps unsurprisingly, our experiments indicate that the additional cost of homomorphic circuit evaluation is minor in comparison to the simulation cost of the quantum operations. Our simulation toolkit is implemented in Python and is open-source.
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.
Quantum homomorphic encryption (QHE), allows a quantum cloud server to compute on private data as uploaded by a client. We provide a proof-of-concept software simulation for QHE, according to the "EPR" scheme of Broadbent and Jeffery, for universal quantum circuits. We demonstrate the near-term viability of this scheme and provide verification that the additional cost of homomorphic circuit evaluation is minor when compared to the simulation cost of the quantum operations. Our simulation toolkit, py−qhe−epr package, is an open-source Python implementation, that serves as a step towards further hardware applications of quantum homomorphic encryption between networked quantum devices.
The significant advantage of the quantum homomorphic encryption scheme is to ensure the perfect security of quantum private data. In this paper, a novel secure multiparty quantum homomorphic encryption scheme is proposed, which can complete arbitrary quantum computation on the private data of multiple clients without decryption by an almost dishonest server. Firstly, each client obtains a secure encryption key through the measurement device independent quantum key distribution protocol and encrypts the private data by using the encryption operator and key. Secondly, with the help of the almost dishonest server, the non-maximally entangled states are pre-shared between the client and the server to correct errors in the homomorphic evaluation of T gates, so as to realize universal quantum circuit evaluation on encrypted data. Thirdly, from the perspective of the application scenario of secure multi-party computation, this work is based on the probabilistic quantum homomorphic encryption scheme, allowing multiple parties to delegate the server to perform the secure homomorphic evaluation. The operation and the permission to access the data performed by the client and the server are clearly pointed out. Finally, a concrete security analysis shows that the proposed multiparty quantum homomorphic encryption scheme can securely resist outside and inside attacks.
Growing interest in the field of quantum computing is fueled by quantum computers projected ”quantum supremacy” in speed and security. The potential for ultra-high speeds may produce a dramatic change in data science, machine learning, analytics, and information processing. This research study will focus on encryption algorithms where quantum computing may affect protocols and deciphering codes. Specifically, homomorphic encryption (HE) enables mathematical operations to be performed on encrypted data without having to decrypt the data in the process. Quantum homomorphic encryption (QHE) enables quantum circuits to be performed on encrypted qubits. In this research experience for undergraduates (REU) study, we design quantum circuits to implement QHE on a quantum teleportation circuit. The teleportation algorithm is profiled in terms of performance and complexity and comparative results are provided for encoded versus unencoded circuits. This work serves as a building block for encrypting more complex quantum algorithms such as Quantum Neural Networks (QNN).
Fully homomorphic encryption is a kind of encryption scheme, which enables arbitrary computation on encrypted data without accessing the data. We present the quantum version of fully homomorphic encryption scheme, which is constructed based on quantum fault-tolerant construction. Two schemes are constructed. The first is a symmetric scheme, and the secret key is the quantum CSS code. In the scheme, when Server performs quantum computation on the encrypted plaintext, some ancillary quantum states should be provided by Client. The second is an asymmetric scheme, which contains the periodical interaction between Client and Server.