Stability of Grover’s algorithm in respect to perturbations in quantum circuit
https://doi.org/10.17586/2220-8054-2017-8-2-243-246
Abstract
Grover’s algorithm is a quantum algorithm for searching specified elements in an unsorted list. It has many valuable applications. The utilization of Grover’s algorithm, to adapt it to accelerate the works of well-known classical algorithms, is very promising, and it is one of the fastest algorithms to solve such problems like global optimization and graph coloring. In this regard, it is very important to study the stability of the Grover’s algorithm, to know how distortion of the circuit’s elements affects on it results. This work presents the results of the simulation of Grover’s algorithm, research of its stability with respect to perturbations of quantum logic circuit elements and its dependencies from the number of qubits, used in quantum circuit. Another part of this research was realized on IBM quantum processor and shows the stability of the 2-qubit Grover’s algorithm.
Supporting agencies: This work was partially financially supported by the Government of the Russian Federation (grant 074U01).
About the Authors
K. V. Gubaidullina
ITMO University
Russian Federation
Russian Federation
Kronverkskiy, 49, St. Petersburg, 197101
S. A. Chivilikhin
ITMO University
Russian Federation
Russian Federation
Kronverkskiy, 49, St. Petersburg, 197101
References
1. Grover L.K. A fast quantum mechanical algorithm for database search Proc. 28th Ann. ACM Symp. Theory of Computing (STOC) New York, ACM Press, 1996, P. 212–221.
2. Aghaei M.R.S., Zukarnain Z.A., Mamat A., Zainuddin H. A hybrid algorithm for finding shortest path in network routing. J. Theoretical and Applied Inform. Technol, 2009, P. 360–365.
3. Koistinen O.-P., Maras E., Vehtari A., J’onsson H. Minimum energy path calculations with Gaussian process regression. Nanosystems: Physics, Chemistry, Mathematics, 2016, 7(6), P. 925–935.
4. Durr C., Høyer P. A quantum algorithm for finding the minimum arXiv preprint quant-ph/9607014, 1996.
5. Linington I.E., Ivanov P.A., Vitanov N.V. Quantum search in a nonclassical database of trapped ions. Phys. Rev. A, 2009, 79, P. 012322.
6. Nakahara M., Ohmi T. Quantum Computing: From Linear Algebra to Physical Realizations. CRC Press, 2008.
7. Boyer M., Brassard G., Høyer P., Tapp A. Tight bounds on quantum searching. arXiv preprint quant-ph/9605034, 1996.
8. Toyama F.M., Dijk W., Nogami Y. Quantum search with certainty based on modified Grover algorithms: optimum choice of parameters. Quantum Inf Process, 2013, 12, P. 1897–1914.
9. Gubaidullina K.V., Chivilikhin S.A. Theoretical research of the distortion of quantum circuit in Grover’s algorithm Journal of Physics: Conference Series, 2016, 735, P. 012074-1–012074-6.
10. Koch J., Yu T.M., et al. Charge-insensitive qubit design derived from the Cooper pair box. Phys. Rev. A, 2007, 76, P. 042319.
11. IBM Research Quantum Experience. URL: www.research.ibm.com/quantum.
Review
For citations:
Gubaidullina K.V., Chivilikhin S.A. Stability of Grover’s algorithm in respect to perturbations in quantum circuit. Nanosystems: Physics, Chemistry, Mathematics. 2017;8(2):243-246. https://doi.org/10.17586/2220-8054-2017-8-2-243-246
Views:
5
Email this article 