Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Herald of Omsk University

Implementation and simulation of the quantum walk algorithm

Andrey N. Vakilov

Published Dec 16, 2025• 0 citations
Publisher

Abstract

The quantum walk algorithm is implemented using the Qiskit software development kit. The accuracy of the algorithm is analyzed depending on the number of qubits and the results obtained on a real quantum computer and an emulator are compared.
DOI
10.24147/1812-3996.2025.4.13-17

Related papers

Realization of the Grover algorithm with error correction

E. A. Shafeev, Andrey N. Vakilov

A quantum Grover search algorithm has been implemented using the Qiskit software development kit and the IBM Quantum Lab. The accuracy of the algorithm is analyzed depending on the number of qubits. The Shore code for error correction is implemented.

Herald of Omsk University•Jan 1, 2024•0 citations

Implementation of the Deutsch-Jozsa algorithm on an IBM quantum Computer

Sergeicheva, Skvortsov, Hismatov +1 more

The Deutsch-Jozsa algorithm has been implemented using the Qiskit software development kit and the IBM Quantum Lab. The accuracy of the algorithm is analyzed depending on the number of qubits and the results obtained on a real quantum computer and an emulator are compared.

Herald of Omsk University•Jun 10, 2025•0 citations

https://herald-journal.omsu.ru/issues/436/13319.php

Pereguda, Andrey N. Vakilov

The quantum Fourier transform has been implemented using the Qiskit software development kit and the IBM Quantum Lab. The accuracy of the algorithm is analyzed depending on the number of qubits.

Herald of Omsk University•Jun 10, 2025•0 citations

Implementation of quantum random walk on a real quantum computer

Warat Puengtambol, Prapong Prechaprapranwong, Unchalisa Taetragool

Abstract A random walk is one of the widely adopted random processes for simulation and approximation in multiple areas of science and engineering. Quantum random walk is an analog version of the classical random walk. It was first introduced in 1993 by Y. Aharonov et al. They presented that, with the nature of quantum characteristic, the average length of the walking path on a line is possible to larger than a classical random walk can produce. Therefore, the quantum random walk can be used as a tool to construct many other quantum algorithms. Moreover, it can solve graph problems that many real-world problems can be formulated. However, quantum algorithms are only useful in practice if we can implement them efficiently on a quantum computer. In this study, we are then interested in designing and implementing a quantum circuit that can be run on a real quantum computing device. We firstly focus on the most straightforward, which is a one-dimension, quantum random walk algorithm. Then, the quantum circuits are developed and implemented on a real quantum computer and a quantum computing simulator using software development kits provided by IBM. Lastly, the performance and results of the quantum circuits tested on both computing platforms are presented.

Journal of Physics Conference Series•Jan 1, 2021•11 citations

QWASI: The Quantum Walk Simulator

Warren J. Wilson

As quantum computing continues to evolve, the ability to design and analyze novel quantum algorithms becomes a necessary focus for research. In many instances, the virtues of quantum algorithms only become evident when compared to their classical counterparts, so a study of the former often begins with a consideration of the latter. This is very much the case with quantum walk algorithms, as the success of random walks and their many, varied applications have inspired much interest in quantum correlates. Unfortunately, finding purely algebraic solutions for quantum walks is an elusive endeavor. At best, and when solvable, they require simple graphical structure, exploitable symmetries, and case by case analyses. In more complex instances, as with most arbitrary graphs, the pursuit of a general solution is untenable. Enter Qwasi (Quantum Walk Simulator), a software tool that allows for the composition of arbitrary graphs by a user, includes a mathematical backend that can construct the Hilbert Space from these graphs, and simulates the evolution of the quantum walk as a set of numerical data. This simulation can be observed in real time, compiled into graphical plots, or exported as a CSV file. At present, the software focuses upon discrete-time scattering quantum walks, but expansion to other graph-based algorithms – anything that operates on a collection of vertices and connected edges – would not be a demanding task.

•Jan 1, 2020•0 citations

Computational Methods for Simulating Quantum Computers

Hans A. De Raedt, Kristel F. L. Michielsen

This review gives a survey of numerical algorithms and software to simulate quantum computers. It covers the basic concepts of quantum computation and quantum algorithms and includes a few examples that illustrate the use of simulation software for ideal and physical models of quantum computers.

arXiv:quant-ph/0406210•Jun 27, 2004•57 citations
Abstract A random walk is one of the widely adopted random processes for simulation and approximation in multiple areas of science and engineering. Quantum random walk is an analog version of the classical random walk. It was first introduced in 1993 by Y. Aharonov et al. They presented that, with the nature of quantum characteristic, the average length of the walking path on a line is possible to larger than a classical random walk can produce. Therefore, the quantum random walk can be used as a tool to construct many other quantum algorithms. Moreover, it can solve graph problems that many real-world problems can be formulated. However, quantum algorithms are only useful in practice if we can implement them efficiently on a quantum computer. In this study, we are then interested in designing and implementing a quantum circuit that can be run on a real quantum computing device. We firstly focus on the most straightforward, which is a one-dimension, quantum random walk algorithm. Then, the quantum circuits are developed and implemented on a real quantum computer and a quantum computing simulator using software development kits provided by IBM. Lastly, the performance and results of the quantum circuits tested on both computing platforms are presented.
As quantum computing continues to evolve, the ability to design and analyze novel quantum algorithms becomes a necessary focus for research. In many instances, the virtues of quantum algorithms only become evident when compared to their classical counterparts, so a study of the former often begins with a consideration of the latter. This is very much the case with quantum walk algorithms, as the success of random walks and their many, varied applications have inspired much interest in quantum correlates. Unfortunately, finding purely algebraic solutions for quantum walks is an elusive endeavor. At best, and when solvable, they require simple graphical structure, exploitable symmetries, and case by case analyses. In more complex instances, as with most arbitrary graphs, the pursuit of a general solution is untenable. Enter Qwasi (Quantum Walk Simulator), a software tool that allows for the composition of arbitrary graphs by a user, includes a mathematical backend that can construct the Hilbert Space from these graphs, and simulates the evolution of the quantum walk as a set of numerical data. This simulation can be observed in real time, compiled into graphical plots, or exported as a CSV file. At present, the software focuses upon discrete-time scattering quantum walks, but expansion to other graph-based algorithms – anything that operates on a collection of vertices and connected edges – would not be a demanding task.