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

Quantum Information Processing

Grover algorithm-based quantum homomorphic encryption ciphertext retrieval scheme in quantum cloud computing

Changqing Gong, Du Juan, Zhaoyang Dong, Zhenzhou Guo, Abdullah Gani, Liang Zhao, Han Qi

Published Feb 10, 2020• 45 citations
Publisher
DOI
10.1007/s11128-020-2603-0

Related papers

A secure quantum homomorphic encryption ciphertext retrieval scheme

Zhenwen Cheng, Xiu‐Bo Chen, Gang Xu +4 more

Soft Computing•Feb 1, 2025•3 citations

One Improved RLWE-based FHE and Fast Private Information Retrieval

Weitao Song, Bin Hu and Xiu-Feng Zhao

With the rapid development of cloud computing, it raises real questions on privacy protection, which greatly limits the use of cloud computing.However, fully homomorphic encryption (FHE) can make cloud computing consistent with privacy.In this paper, we propose a simpler FHE scheme based on ring LWE problem, with a smaller size of ciphertext and a lower noise-expansion factor for homomorphic multiplication.Then based on our optimized RLWE-based FHE scheme, we propose a fast single-database private information retrieval protocol, combining with batching and number theoretic transform technology.

KSII Transactions on Internet and Information Systems•Dec 31, 2019•1 citation

Quantum Fully Homomorphic Encryption Scheme for Cloud Privacy Data Based on Quantum Circuit

Hongfeng Zhu, Chaonan Wang, Xueying Wang

International Journal of Theoretical Physics•Jul 7, 2021•9 citations

Quantum Ciphertext Dimension Reduction Scheme for Homomorphic Encrypted Data

Changqing Gong, Zhaoyang Dong, Abdullah Gani +1 more

At present, in the face of the huge and complex data in cloud computing, the parallel computing ability of quantum computing is particularly important. Quantum principal component analysis algorithm is used as a method of quantum state tomography. We perform feature extraction on the eigenvalue matrix of the density matrix after feature decomposition to achieve dimensionality reduction, proposed quantum principal component extraction algorithm (QPCE). Compared with the classic algorithm, this algorithm achieves an exponential speedup under certain conditions. The specific realization of the quantum circuit is given. And considering the limited computing power of the client, we propose a quantum homomorphic ciphertext dimension reduction scheme (QHEDR), the client can encrypt the quantum data and upload it to the cloud for computing. And through the quantum homomorphic encryption scheme to ensure security. After the calculation is completed, the client updates the key locally and decrypts the ciphertext result. We have implemented a quantum ciphertext dimensionality reduction scheme implemented in the quantum cloud, which does not require interaction and ensures safety. In addition, we have carried out experimental verification on the QPCE algorithm on IBM's real computing platform. Experimental results show that the algorithm can perform ciphertext dimension reduction safely and effectively.

arXiv:2011.09692•IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)•Oct 1, 2021•5 citations

Implementing the Grover algorithm in homomorphic encryption schemes

Pablo Fernández, Miguel Angel Martin-Delgado

We apply quantum homomorphic encryption (QHE) schemes suitable for circuits with a polynomial number of T + T † gates to Grover's algorithm, performing a simulation in Qiskit of a Grover circuit that contains three qubits. The T + T † -gate complexity of Grover's algorithm is also analyzed in order to show that any Grover circuit can be evaluated homomorphically in an efficient manner. We discuss how to apply these QHE schemes to allow for the efficient homomorphic evaluation of any Grover circuit composed of n qubits using n − 2 extra ancilla qubits. We also show how the homomorphic evaluation of the special case where there is only one marked item can be implemented using an algorithm that makes the decryption process more efficient compared with the standard Grover algorithm. Published by the American Physical Society 2024

arXiv:2403.04922•Physical Review Research•Nov 6, 2024•13 citations

Quantum homomorphic encryption scheme based on elliptic curve cryptography

Xiuli Song, Jianbing Zhou, Qian Chen +2 more

Quantum Information Processing•May 19, 2025•3 citations
With the rapid development of cloud computing, it raises real questions on privacy protection, which greatly limits the use of cloud computing.However, fully homomorphic encryption (FHE) can make cloud computing consistent with privacy.In this paper, we propose a simpler FHE scheme based on ring LWE problem, with a smaller size of ciphertext and a lower noise-expansion factor for homomorphic multiplication.Then based on our optimized RLWE-based FHE scheme, we propose a fast single-database private information retrieval protocol, combining with batching and number theoretic transform technology.
At present, in the face of the huge and complex data in cloud computing, the parallel computing ability of quantum computing is particularly important. Quantum principal component analysis algorithm is used as a method of quantum state tomography. We perform feature extraction on the eigenvalue matrix of the density matrix after feature decomposition to achieve dimensionality reduction, proposed quantum principal component extraction algorithm (QPCE). Compared with the classic algorithm, this algorithm achieves an exponential speedup under certain conditions. The specific realization of the quantum circuit is given. And considering the limited computing power of the client, we propose a quantum homomorphic ciphertext dimension reduction scheme (QHEDR), the client can encrypt the quantum data and upload it to the cloud for computing. And through the quantum homomorphic encryption scheme to ensure security. After the calculation is completed, the client updates the key locally and decrypts the ciphertext result. We have implemented a quantum ciphertext dimensionality reduction scheme implemented in the quantum cloud, which does not require interaction and ensures safety. In addition, we have carried out experimental verification on the QPCE algorithm on IBM's real computing platform. Experimental results show that the algorithm can perform ciphertext dimension reduction safely and effectively.
We apply quantum homomorphic encryption (QHE) schemes suitable for circuits with a polynomial number of T + T † gates to Grover's algorithm, performing a simulation in Qiskit of a Grover circuit that contains three qubits. The T + T † -gate complexity of Grover's algorithm is also analyzed in order to show that any Grover circuit can be evaluated homomorphically in an efficient manner. We discuss how to apply these QHE schemes to allow for the efficient homomorphic evaluation of any Grover circuit composed of n qubits using n − 2 extra ancilla qubits. We also show how the homomorphic evaluation of the special case where there is only one marked item can be implemented using an algorithm that makes the decryption process more efficient compared with the standard Grover algorithm. Published by the American Physical Society 2024