Implementation of Grover’s Algorithm & Bernstein-Vazirani Algorithm with IBM Qiskit

Authors

• Yang-Che Liu, Xiamen University Malaysia, Malaysia
• Mei-Feng Liu, Xiamen University Malaysia, Malaysia

Corresponding Author ORCID Identifer

Yang-Che Liu https://orcid.org/0009-0002-6858-5765

Section

Regular Issue

Abstract

Quantum logic gates differ from classical logic gates as the former involves quantum operators. The conventional gates such as AND, OR, NOT etc., are generally classified as classical gates, however, some of the quantum gates are known as Pauli gates, Toffoli gates and Hadamard gates, respectively. Normally classical states only involve 0 and 1, whereas quantum states involve the superpositions of 0 and 1. Hence, underlying principles of algorithm implementation for classical logic gate and quantum logic gate are indeed different. In this paper, we introduce significant concepts of quantum computations, analyse the discrepancy between classical and quantum gates, compare quantum algorithms using Qiskit against equivalent classical algorithms and analyse their performance in terms of runtime.

Cite This Article

Liu, Y.-C., & Liu, M.-F. (2024). Implementation of Grover’s Algorithm & Bernstein-Vazirani Algorithm with IBM Qiskit. Journal of Informatics and Web Engineering, 3(1), 76–95. https://doi.org/10.33093/jiwe.2024.3.1.6

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.