Design of Grover’s Algorithm over 2, 3 and 4-Qubit Systems in Quantum Programming Studio
Abstract
In this paper, we design and analyse the Circuit for Grover’s Quantum Search Algorithm on 2, 3 and 4-qubit systems, in terms of number of gates, representation of state vectors and measurement probability for the state vectors. We designed, examined and simulated the quantum circuit on IBM Q platform using Quantum Programming Studio. We present the theoretical implementation of the search algorithm on different qubit systems. We observe that our circuit design for 2 and 4-qubit systems are precise and do not introduce any error while experiencing a small error to our design of 3-qubit quantum system.
References
Luan L., Wang Z., Liu S., “Progress of Grover Quantum Search Algorithm”, Energy Procedia, vol. 16, pp. 1701 – 1706, 2012. DOI: https://doi.org/10.1016/j.egypro.2012.01.263
Karlsson V. B., Stromberg P., “4-qubit Grover's alg. impl. for the ibmqx5 archit.”, Degree Project in Computer Science, First Cycle, 15 Credits Stockholm, Sweden, 2018.
Zalka C., “Could Grover's Quantum Algorithm Help in Searching an Actual Database?”, Quantum Physics, 1999, pp. 1-7. DOI: 10.1103/PhysRevA.62.052305
Aghaei M. R. S., Zukarnain Z. A., Mamat A., Zainuddin H., “A Hybrid Algorithm For Finding Shortest Path In Network Routing”, Journal Of Theoretical And Applied Information Technology, 2009, pp. 360-365.
Priya R. P., Baradeswaran A., “An efficient simulation of quantum error correction Codes”, Alexandria Engineering Journal, Vol. 57, 2018, pp. 2167–2175. DOI: https://doi.org/10.1016/j.aej.2017.06.013
Chen G., Fulling S. A., and Scully M. O., “Grover’s Algorithm for Multiobject Search in Quantum Computing”, Article in Lecture Notes in Physics, 1999, pp. 1-12. DOI: https://doi.org/10.1007/3-540-40894-0_15
Hahanov V., Miz V., “Quantum computing approach for shortest route finding”, East-West Design & Test Symposium (EWDTS 2013), Rostov-on-Don, Russia, 2013, pp. 27-30. DOI: DOI: 10.1109/EWDTS.2013.6673095
Abhijith J., Adedoyin A., Ambrosiano J., Anisimov P., Bärtschi A., Casper W., Chennupati G., Coffrin C., Djidjev H., Gunter D., Karra S., Lemons N., Lin S., Malyzhenkov A., Mascarenas D., Mniszewski S., Nadiga B., O’malley D., Oyen D., Pakin S., Prasad L., Roberts R., Romero P., Santhi N., Sinitsyn N., Swart P. J., Wendelberger J. G., Yoon B., Zamora R., Zhu W., Eidenbenz S., Coles P. J., Vuffray M. and Lokhov A. Y., ”Quantum Algorithm Implementations For Beginners”, Computer Science Emerging Technologies, 2020, pp. 1-94.
Kaye P., Laflamme R., Mosca M., “An Introduction to Quantum Computing”, Oxford University Press Inc., New York, 2007, pp. 1-276.
Nielsen M. A. and Chuang I. L., “Quantum Computation and Quantum Information”, Cambridge University Press, New York, 2010, pp. 1-676. DOI: https://doi.org/10.1017/CBO9780511976667
Mandviwalla A., Ohshiro K., Ji B., “Implementing Grover’s Algorithm on the IBM Quantum Computers”, in Proc. 2018 IEEE Int. Conference on Big Data, 2018,pp. 2531-2537.
Samsonov E., Kiselev F., Shmelev Y., Egorov V., Goncharov R., Santev A., Pervushin B. and Gleim A., “Modeling two-qubit Grover's algorithm implementation in a linear optical chip”, Physica Scripta, vol. 95, no. 4, 2020. DOI: 10.1088/1402-4896/ab6523
Figgatt C., Maslov D., Landsman K. A., Linke N. M., Debnath S. and Monroe C., “Complete 3-Qubit Grover search on a programmable quantum computer”, Nature Communications, vol. 8, no. 1918, 2017, pp. 1-9. DOI: 10.1038/s41467-017-01904-7
Said T., Chouikh A., Essammouni K. and Bennai M., “Implementation of Grover quantum search algorithm with two transmon qubits via circuit QED”, Quant. Phys. Lett., vol. 6, no. 1, 2017, pp. 29-35. DOI: 10.18576/qpl/060105
Brickman K. A., Haljan P. C., Lee P. J., Acton M., Deslauriers L. and Monroe C., “Implementation of Grover’s Quantum Search Algorithm in a Scalable System”, Physical Review A, vol. 72, no. 5, 2005, , pp. 1-4. DOI: 10.1103/PhysRevA.72.050306
Downloads
Published
Issue
Section
License
Copyright (c) 2022 International Journal of Electronics and Telecommunications
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
1. License
The non-commercial use of the article will be governed by the Creative Commons Attribution license as currently displayed on https://creativecommons.org/licenses/by/4.0/.
2. Author’s Warranties
The author warrants that the article is original, written by stated author/s, has not been published before, contains no unlawful statements, does not infringe the rights of others, is subject to copyright that is vested exclusively in the author and free of any third party rights, and that any necessary written permissions to quote from other sources have been obtained by the author/s. The undersigned also warrants that the manuscript (or its essential substance) has not been published other than as an abstract or doctorate thesis and has not been submitted for consideration elsewhere, for print, electronic or digital publication.
3. User Rights
Under the Creative Commons Attribution license, the author(s) and users are free to share (copy, distribute and transmit the contribution) under the following conditions: 1. they must attribute the contribution in the manner specified by the author or licensor, 2. they may alter, transform, or build upon this work, 3. they may use this contribution for commercial purposes.
4. Rights of Authors
Authors retain the following rights:
- copyright, and other proprietary rights relating to the article, such as patent rights,
- the right to use the substance of the article in own future works, including lectures and books,
- the right to reproduce the article for own purposes, provided the copies are not offered for sale,
- the right to self-archive the article
- the right to supervision over the integrity of the content of the work and its fair use.
5. Co-Authorship
If the article was prepared jointly with other authors, the signatory of this form warrants that he/she has been authorized by all co-authors to sign this agreement on their behalf, and agrees to inform his/her co-authors of the terms of this agreement.
6. Termination
This agreement can be terminated by the author or the Journal Owner upon two months’ notice where the other party has materially breached this agreement and failed to remedy such breach within a month of being given the terminating party’s notice requesting such breach to be remedied. No breach or violation of this agreement will cause this agreement or any license granted in it to terminate automatically or affect the definition of the Journal Owner. The author and the Journal Owner may agree to terminate this agreement at any time. This agreement or any license granted in it cannot be terminated otherwise than in accordance with this section 6. This License shall remain in effect throughout the term of copyright in the Work and may not be revoked without the express written consent of both parties.
7. Royalties
This agreement entitles the author to no royalties or other fees. To such extent as legally permissible, the author waives his or her right to collect royalties relative to the article in respect of any use of the article by the Journal Owner or its sublicensee.
8. Miscellaneous
The Journal Owner will publish the article (or have it published) in the Journal if the article’s editorial process is successfully completed and the Journal Owner or its sublicensee has become obligated to have the article published. Where such obligation depends on the payment of a fee, it shall not be deemed to exist until such time as that fee is paid. The Journal Owner may conform the article to a style of punctuation, spelling, capitalization and usage that it deems appropriate. The Journal Owner will be allowed to sublicense the rights that are licensed to it under this agreement. This agreement will be governed by the laws of Poland.
By signing this License, Author(s) warrant(s) that they have the full power to enter into this agreement. This License shall remain in effect throughout the term of copyright in the Work and may not be revoked without the express written consent of both parties.
