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

Physica A Statistical Mechanics and its Applications

Quantum one-time pad-based quantum homomorphic encryption schemes for circuits of the non-Clifford gates

Zhenwen Cheng, Xiu‐Bo Chen, Gang Xu, Li Ma, Zongpeng Li

Published Jan 21, 2024• 11 citations
Publisher
DOI
10.1016/j.physa.2024.129529

Related papers

Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity

Anne Broadbent, Stacey Jeffery

arXiv:1412.8766•Lecture notes in computer science•Jan 1, 2015•168 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

Quantum Homomorphic Encryption: Towards Practical QOTP-Encrypted Computation on Gate-Based Hardware

Jon Hernández-Bueno, Oscar Lage, Marivi Higuero +1 more

As quantum computing moves toward remote and cloud-based access, protecting quantum data during outsourced execution becomes important. Quantum one-time pad (QOTP) encryption provides information-theoretic hiding of quantum state, but evaluating gates on Pauli-encrypted data is nontrivial: Clifford operations allow classical Pauli-frame updates, whereas non-Clifford operations require key-dependent corrections. We introduce QOTPH, a client-side key-tracked compilation framework for encrypted quantum computation. The client retains the QOTP keys and transforms each operation into a corrected gate or decomposition. The resulting circuit is executed non-adaptively by the quantum server, which neither receives the keys nor performs key updates. We develop a unified Pauli frame compilation layer spanning Clifford operations, one- and two-qubit Pauli-generated rotations, explicit key-dependent parametrized controlled rotations, and recursively composed gates, and establish a global correctness result for circuits composed of the formally verified primitive rules. We also characterize the evaluator's view under a hidden logical circuit model, in which the QOTP frame, the uncompiled logical circuit, and the logical-to-physical instruction mapping remain client-side; the security of this model against various algorithms is also analyzed. The implementation is evaluated in Qiskit using noiseless simulation and IBM Quantum hardware, including in-circuit and local-decryption workflows. This work bridges the gap between algebraic QOTP key tracking and practical encrypted quantum computation by providing a unified, hardware-validated compilation framework for current gate-based quantum processors.

quant-pharXiv:2604.19256•Apr 22, 2026•0 citations

Efficient quantum fully homomorphic encryption scheme based on the quantum circuit

Zhenzhen Li, Ming-Kui Liu, Jun Xu +2 more

Quantum Information Processing•Jun 9, 2026•0 citations

Quantum fully homomorphic encryption scheme based on universal quantum circuit

Min Liang

arXiv:1410.2435•Quantum Information Processing•May 28, 2015•76 citations

Universal quantum circuit evaluation on encrypted data using probabilistic quantum homomorphic encryption scheme*

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

Homomorphic encryption has giant advantages in the protection of privacy information. In this paper, we present a new kind of probabilistic quantum homomorphic encryption scheme for the universal quantum circuit evaluation. Firstly, the pre-shared non-maximally entangled states are utilized as auxiliary resources, which lower the requirements of the quantum channel, to correct the errors in non-Clifford gate evaluation. By using the set synthesized by Clifford gates and T gates, it is feasible to perform the arbitrary quantum computation on the encrypted data. Secondly, our scheme is different from the previous scheme described by the quantum homomorphic encryption algorithm. From the perspective of application, a two-party probabilistic quantum homomorphic encryption scheme is proposed. It is clear what the computation and operation that the client and the server need to perform respectively, as well as the permission to access the data. Finally, the security of probabilistic quantum homomorphic encryption scheme is analyzed in detail. It demonstrates that the scheme has favorable security in three aspects, including privacy data, evaluated data and encryption and decryption keys.

Chinese Physics B•May 12, 2021•15 citations
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.
As quantum computing moves toward remote and cloud-based access, protecting quantum data during outsourced execution becomes important. Quantum one-time pad (QOTP) encryption provides information-theoretic hiding of quantum state, but evaluating gates on Pauli-encrypted data is nontrivial: Clifford operations allow classical Pauli-frame updates, whereas non-Clifford operations require key-dependent corrections. We introduce QOTPH, a client-side key-tracked compilation framework for encrypted quantum computation. The client retains the QOTP keys and transforms each operation into a corrected gate or decomposition. The resulting circuit is executed non-adaptively by the quantum server, which neither receives the keys nor performs key updates. We develop a unified Pauli frame compilation layer spanning Clifford operations, one- and two-qubit Pauli-generated rotations, explicit key-dependent parametrized controlled rotations, and recursively composed gates, and establish a global correctness result for circuits composed of the formally verified primitive rules. We also characterize the evaluator's view under a hidden logical circuit model, in which the QOTP frame, the uncompiled logical circuit, and the logical-to-physical instruction mapping remain client-side; the security of this model against various algorithms is also analyzed. The implementation is evaluated in Qiskit using noiseless simulation and IBM Quantum hardware, including in-circuit and local-decryption workflows. This work bridges the gap between algebraic QOTP key tracking and practical encrypted quantum computation by providing a unified, hardware-validated compilation framework for current gate-based quantum processors.
Homomorphic encryption has giant advantages in the protection of privacy information. In this paper, we present a new kind of probabilistic quantum homomorphic encryption scheme for the universal quantum circuit evaluation. Firstly, the pre-shared non-maximally entangled states are utilized as auxiliary resources, which lower the requirements of the quantum channel, to correct the errors in non-Clifford gate evaluation. By using the set synthesized by Clifford gates and T gates, it is feasible to perform the arbitrary quantum computation on the encrypted data. Secondly, our scheme is different from the previous scheme described by the quantum homomorphic encryption algorithm. From the perspective of application, a two-party probabilistic quantum homomorphic encryption scheme is proposed. It is clear what the computation and operation that the client and the server need to perform respectively, as well as the permission to access the data. Finally, the security of probabilistic quantum homomorphic encryption scheme is analyzed in detail. It demonstrates that the scheme has favorable security in three aspects, including privacy data, evaluated data and encryption and decryption keys.