Papers
Topics
Authors
Recent
Search
2000 character limit reached

Implementing the Grover Algorithm in Homomorphic Encryption Schemes

Published 7 Mar 2024 in quant-ph | (2403.04922v1)

Abstract: We apply quantum homomorphic encryption (QHE) schemes suitable for circuits with a polynomial number of $T/T{\dagger}$-gates to Grover's algorithm, performing a simulation in Qiskit of a Grover circuit that contains 3 qubits. The $T/T{\dagger}$ gate complexity of Grover's algorithm is also analysed 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 to the standard Grover algorithm.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (43)
  1. Bernstein, E., Vazirani, U., 1993, “Quantum complexity theory”, Proceedings of the 25th Annual ACM Symposium on the Theory of Computing, 11-20.
  2. Shor, P. W., 1994, “Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer”, in Proceedings of the 35th Annual Symposium on the Foundations of Computer Science, p.124 (IEEE Computer Society Press, Los Alamitos, CA, 1994), quant-ph/9508027.
  3. Deutsch, D., 1985, “Quantum theory, the Church-Turing principle and the universal quantum computer”, Proc.Roy. Soc. Lond. A400, 97-117.
  4. Deutsch, D., Jozsa, R., 1992, “Rapid solution of problems by quantum computation”, Proc. Roy. Soc. Lond. A439, 553-558.
  5. Hidary, J. D., 2019, “Quantum Computing: An Applied Approach”, Springer International Publishing.
  6. Grover, L. K., 1996, “A fast quantum mechanical algorithm for database search”, in Proceedings of the 28th Annual ACM Symposium on the Theory of Computing (Philadelphia, Pennsilvania), 212-219.
  7. Galindo, A., Martin-Delgado, M. A., 2000, “Family of Grover’s quantum-searching algorithms”, Phys. Rev. A 62, 062303.
  8. Brassard, G., Høyer, P., Tapp, A., 1998, “Quantum cryptanalysis of hash and claw-free functions”, LATIN ’98: Theoretical Informatics, Third Latin American Symposium, Campinas, Brazil, April, 20-24, 1998, Proceedings, Lecture Notes in Computer Science, Vol. 1380. Springer. pp. 163-169.
  9. Brassard, G., Høyer, P., Tapp, A., 1998, “Quantum counting”, Proceedings of the 25th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 1443, pp. 820-831.
  10. Brown, A. R., 2020, “Playing Pool with |ψ⟩ket𝜓|\psi\rangle| italic_ψ ⟩: from Bouncing Billiards to Quantum Search”, Quantum 4, 357.
  11. Gentry, C., 2009, “A fully homomorphic encryption scheme”, Ph.D. thesis, Stanford University.
  12. Gentry, C., Brakerski, Z., Vaikuntanathan, V., 2011, “Fully homomorphic encryption without bootstrapping”, Security 111(111), 1-12.
  13. Devoret, M. H., Wallraff, A., Martinis, J. M., 2004, “Superconducting Qubits: A Short Review”, arXiv:cond-mat/0411174.
  14. DiVincenzo, D., 2000, “The Physical Implementation of Quantum Computation”, Fortschritte der Physik. 48(9-11): 771-783, arXiv:quant-ph/0002077.
  15. Devoret, M. H., Schoelkopf, R. J., 2013, “Superconducting Circuits for Quantum Information: An Outlook”, Science. 339 (6124): 1169-1174.
  16. Castelvecchi, D., 2017, “Quantum computers ready to leap out of the lab in 2017”, Nature. 541 (7635): 9-10.
  17. Wendin, G., 2017, “Quantum information processing with superconducting circuits: a review”, Reports on Progress in Physics. 80 (10): 106001. arXiv:1610.02208.
  18. Gambetta, J. M., Chow, J. M., Steffen, M., 2017, “Building logical qubits in a superconducting quantum computing system”, npj Quantum Information. 3 (1): 2. arXiv:1510.04375.
  19. García-Ripoll, J. J., Solano, E., Martin-Delgado, M. A., 2008, “Quantum simulation of Anderson and Kondo lattices with superconducting qubits”, Physical Review B 77 (2), 024522.
  20. Viyuela, O., Rivas, A., Gasparinetti, S., Wallraff, A., Filipp, S., Martin-Delgado, M. A., 2018, “Observation of topological Uhlmann phases with superconducting qubits”, npj Quantum Information 4 (1), 10.
  21. Liang, M., 2015, “Quantum fully homomorphic encryption scheme based on universal quantum circuit”, Quantum Inf. Process. 14, 2749-2759.
  22. Rohde, P. P., Fitzsimons, J. F., Gilchrist, A., 2012, “Quantum walks with encrypted data”, Phys. Rev. Lett. 109 (15), 150501.
  23. Zeuner, J., Pitsios, I., Tan, SH., Sharma, A. N., Fitzsimons, J. F., Osellame, R., Walther, P., 2021, “Experimental quantum homomorphic encryption”, npj Quantum Information 7, 25.
  24. Liang, M., 2013, “Symmetric quantum fully homomorphic encryption with perfect security”, Quantum Inf. Process. 12, 3675-3687.
  25. Tan, SH., Kettlewell, J. A., Ouyang, Y., Chen, L., Fitzsimons, J. F., 2016, “A quantum approach to fully homomorphic encryption”, Sci. Rep. 6, 33467.
  26. Yu, L., Pérez-Delgado, C. A., Fitzsimons, J. F., 2014, “Limitations on information theoretically secure quantum homomorphic encryption”, Phys. Rev. A 90, 050303.
  27. Lai, CY., Chung, KM., 2018, “On Statistically-Secure Quantum Homomorphic Encryption”, Quantum Inf. Comput. 18, 785-794.
  28. Broadbent, A., Jeffery, S., 2015, “Quantum homomorphic encryption for circuits of low T-gate complexity”, Proc. Adv. Cryptol. 2015, 609-629.
  29. Dulek, Y., Schaffner, C., Speelman, F., 2016, “Quantum homomorphic encryption for polynomial-sized circuits.” In: Robshaw, M., Katz, J. (eds) Advances in Cryptology - CRYPTO 2016. CRYPTO 2016. Lecture Notes in Computer Science(), vol 9816. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-53015-3_1.
  30. Liang, M., 2020, “Teleportation-based quantum homomorphic encryption scheme with quasi-compactness and perfect security”, Quantum Inf. Process 19, 28.
  31. Einstein, A., Podolsky, B., Rosen, N., 1935, “Can quantum-mechanical description of physical reality be considered complete?”, Phys. Rev. 47, 777.
  32. Gong, C., Du, J., Dong, Z., Guo, Z., Gani, A., Zhao, L., Qi, H., 2020, “Grover algorithm-based quantum homomorphic encryption ciphertext retrieval scheme in quantum cloud computing”, Quantum Inf. Process 19, 105.
  33. Gong, C., Dong, Z., Gani, A., Qi, H., 2021, “Quantum Ciphertext Dimension Reduction Scheme for Homomorphic Encrypted Data”, 2021 IEEE 20th International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom), Shenyang, China, 2021, pp. 903-910.
  34. Fernández, P., Martin-Delgado, M. A., 2023, “Homomorphic Encryption of the k=2 Bernstein-Vazirani Algorithm”, arXiv:2303.17426.
  35. Arunachalam, S., de Wolf., R., 2017, “Optimizing the number of gates in quantum search”, Quantum Information & Computation 17 3-4, 251-261.
  36. Galindo, A., Martín-Delgado, M. A, 2002, “Information and computation: Classical and quantum aspects”, Rev. Mod. Phys. 74, 347.
  37. Bennett, C. H., Brassard, G., Crépeau, C., Jozsa, R., Peres, A., Wootters, W. K., 1993, “Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels”, Phys. Rev. Lett. 70, 1895.
  38. Jozsa, R., 2005, “An introduction to measurement based quantum computation”, arXiv:quant-ph/0508124v2.
  39. Boykin, P., Roychowdhury, V., 2003, “Optimal Encryption of Quantum Bits”, Phys. Rev. A 67(4), 42317.
  40. Boyer, M., Brassard, G., Høyer, P., Tapp, A., 1998, “Tight Bounds on Quantum Searching”, Fortschr. Phys. 46 (4-5), 493-506.
  41. Qiskit Contributors, 2023, “Qiskit: An open-source framework for quantum computing”.
  42. Nielsen, M. A., Chuang, I. L., 2010, “Quantum Computation and Quantum Information: 10th Anniversary Edition”, Cambridge: Cambridge University Press.
  43. Grover, L. K., 2002, “Trade-offs in the quantum search algorithm”, Phys. Rev. A 66, 052314.
Citations (1)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.

Sign Up for Free