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

arXiv:2002.01905 · Quantum Information Processing

Implementation of quantum walks on IBM quantum computers

F. Acasiete, F. P. Agostini, Jalil Khatibi Moqadam, Renato Portugal

Published Nov 24, 2020• 68 citations
arXivHTMLPDF
DOI
10.1007/s11128-020-02938-5

Related papers

Reducing computations in quantum walk algorithms

Asif Shakeel

Quantum walks (QWs) are of interest as examples of uniquely quantum behavior and are applicable in a variety of quantum search and simulation models. Implementing QWs on quantum devices is useful from both points of view. We describe a prototype one-dimensional QW algorithm that economizes resources required in its implementation. Our algorithm needs only a single shift (increment) operation. It also allows complete flexibility in choosing the shift circuit, a resource intensive part of QW implementations. This is desirable for Noisy Intermediate-Scale Quantum (NISQ) devices, in which fewer computations implies faster execution and reduced effects of noise and decoherence. We implement versions of the algorithm, with two different shift circuit structures, on publicly accessible IBM quantum computers.

•Dec 2, 2019•1 citation

Quantum Walks for Computer Scientists

Salvador Elías Venegas-Andraca

Synthesis lectures on quantum computing•Jan 1, 2008•121 citations

Cycle discrete-time quantum walks on a noisy quantum computer

Vivek Wadhia, Nicholas Chancellor, Viv M. Kendon

Abstract The rapid development of quantum computing has led to increasing interest in quantum algorithms for a variety of different applications. Quantum walks have also experienced a surge in interest due to their potential use in quantum algorithms. Using the qiskit software package, we test how accurately the current generation of quantum computers provided by IBM can simulate a cycle discrete-time quantum walk. Implementing an 8-node, 8-step walk and a simpler 4-node, 4-step discrete-time quantum walk on an IBM quantum device known as , the results for each step of the respective walks are presented. A custom noise model is developed in order to estimate that noise levels in the quantum device would need to be reduced by at least 94% in order to execute a 16-node, 16-step cycle discrete-time quantum walk to a reasonable level of fidelity. Graphic abstract

arXiv:2307.11027•The European Physical Journal D•Mar 1, 2024•9 citations

Quantum Walks for Computer Scientists

Salvador Elías Venegas-Andraca

Synthesis lectures on quantum computing•Jan 1, 2008•68 citations

Quantum Computing: Implementing Hitting Time for Coined Quantum Walks on Regular Graphs

Ellinor Wanzambi, Andersson, Stina

In recent years, quantum walks have been widely researched and have shown exciting properties. One such is a quadratic speed-up in hitting time compared to its classical counterpart. In this paper, we design a quantum circuit for the MNRS algorithm, which finds a marked node in a graph with a quantum walk, and use it to find a hitting time for the marked nodes in the walk. We do this by implementing the circuit on IBM quantum simulators and show that the execution on a noise-free simulator results in hitting times that agree with the theoretical expectations. We also run the algorithm on a mock backend that simulates the noise of the IBM Melbourne computer. As expected, the noise has an extensive impact on the output, resulting in outcomes far from the noise-free simulation.

arXiv:2108.02723•Aug 5, 2021•7 citations

Physical Implementation of Quantum Walks

Kia Manouchehri, Jingbo B. Wang

Springer eBooks•Aug 21, 2013•271 citations
Quantum walks (QWs) are of interest as examples of uniquely quantum behavior and are applicable in a variety of quantum search and simulation models. Implementing QWs on quantum devices is useful from both points of view. We describe a prototype one-dimensional QW algorithm that economizes resources required in its implementation. Our algorithm needs only a single shift (increment) operation. It also allows complete flexibility in choosing the shift circuit, a resource intensive part of QW implementations. This is desirable for Noisy Intermediate-Scale Quantum (NISQ) devices, in which fewer computations implies faster execution and reduced effects of noise and decoherence. We implement versions of the algorithm, with two different shift circuit structures, on publicly accessible IBM quantum computers.
Abstract The rapid development of quantum computing has led to increasing interest in quantum algorithms for a variety of different applications. Quantum walks have also experienced a surge in interest due to their potential use in quantum algorithms. Using the qiskit software package, we test how accurately the current generation of quantum computers provided by IBM can simulate a cycle discrete-time quantum walk. Implementing an 8-node, 8-step walk and a simpler 4-node, 4-step discrete-time quantum walk on an IBM quantum device known as , the results for each step of the respective walks are presented. A custom noise model is developed in order to estimate that noise levels in the quantum device would need to be reduced by at least 94% in order to execute a 16-node, 16-step cycle discrete-time quantum walk to a reasonable level of fidelity. Graphic abstract
In recent years, quantum walks have been widely researched and have shown exciting properties. One such is a quadratic speed-up in hitting time compared to its classical counterpart. In this paper, we design a quantum circuit for the MNRS algorithm, which finds a marked node in a graph with a quantum walk, and use it to find a hitting time for the marked nodes in the walk. We do this by implementing the circuit on IBM quantum simulators and show that the execution on a noise-free simulator results in hitting times that agree with the theoretical expectations. We also run the algorithm on a mock backend that simulates the noise of the IBM Melbourne computer. As expected, the noise has an extensive impact on the output, resulting in outcomes far from the noise-free simulation.