Implementing the Grover algorithm in homomorphic encryption schemes
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...
Saved in:
| Main Authors: | Pablo Fernández, Miguel A. Martin-Delgado |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
American Physical Society
2024-11-01
|
| Series: | Physical Review Research |
| Online Access: | http://doi.org/10.1103/PhysRevResearch.6.043109 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Implementing semiclassical Szegedy walks in classical-quantum circuits for homomorphic encryption
by: Sergio A Ortega, et al.
Published: (2025-01-01) -
Research on algorithms of data encryption scheme that supports homomorphic arithmetical operations
by: ANGPan Y, et al.
Published: (2015-01-01) -
Towards an efficient LWE‐based fully homomorphic encryption scheme
by: Uddipana Dowerah, et al.
Published: (2022-07-01) -
Bootstrapping Optimization Techniques for the FINAL Fully Homomorphic Encryption Scheme
by: Meng Wu, et al.
Published: (2025-03-01) -
Privacy protection scheme of DBSCAN clustering based on homomorphic encryption
by: Chunfu JIA, et al.
Published: (2021-02-01)