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

IEEE International Conference on Quantum Computing and Engineering (QCE)

Implementation and Viusalization of Quantum Walks

Addie Jordon, Austin Hawkins-Seagram, Ulrike Stege

Published Sep 1, 2022• 3 citations
Publisher

Abstract

Quantum walks (QWs) are the quantum analogue to classical random walks. We explore various implementations of QWs and create visualizations for each, with the goal of increasing educational accessibility. A new QW, called sticky walk, is introduced, where the walker sticks to targets once found. Corresponding pseudocode and Qiskit implementations are provided. Sticky walk helps bridge the gap between non-searching QWs and Quantum Walk Search (which may be an unintuitive search algorithm for those new to QWs).

DOI
10.1109/qce53715.2022.00122

Related papers

QWalkVis: Quantum Walks Visualization Application

Addie Jordon, Austin Hawkins-Seagram, Samantha Norrie +2 more

Quantum walks (QWs) are the quantum analogue to classical random walks. We present visualizations for quantum walks and show how they can be used to teach quantum concepts such as superposition and interference. Using our Quantum Walks Visualization Application (QWalkVis) for visualizing quan-tum walks lets the user select the dimensions, number of states, and number of steps in the walk and generates probabilistic plots on-the-fly. Users can view a plot for each step of the walk, allowing them to compare the probability distributions as time progresses. Visualizations share an important space in education; QWalkVis was created to aid students in learning about quantum walks and foundational quantum concepts through an interactive design. We highlight some potential use cases of QWalkVis for both self-directed student learning and the education in a classroom.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 17, 2023•5 citations

Quantum random walk search on satisfiability problems

Stephan Hoyer

Using numerical simulation, we measured the performance of several potential quantum algorithms, based on quantum random walks, to solve Boolean satisfiability (SAT) problems. We develop the fundamentals of quantum computing and the theory of classical algorithms to indicate how these algorithms could be implemented. We also discuss the development of quantum random walks and the principles that go into creating them, presenting existing work on search algorithms using coined discrete-time quantum random walks. Although our quantum algorithms do not solve SAT problems faster than may be done classically, as a step toward that objective, we present the first example of a quantum walk on a directed graph that has a significant increase in speed over the analogous classical walk.

•Jan 1, 2008•6 citations

Active quantum walks: a framework for quantum walks with adiabatic quantum evolution

Nan Wu, Fangmin Song, Xiangdong Li

We study a new methodology for quantum walk based algorithms. Different from the passive quantum walk, in which a walker is guided by a quantum walk procedure, the new framework that we developed allows the walker to move by an adiabatic procedure of quantum evolution, as an active way. The use of this active quantum walk is helpful to develop new quantum walk based searching and optimization algorithms.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•May 19, 2016•0 citations

Integrated photonic quantum walks

Markus Gräfe, Alexander Szameit

Abstract Quantum walks (QWs) are one of the fundamental concepts in quantum information science, being an essential component for various new applications. Implementing QWs using integrated photonic waveguide lattices allows for realizing long evolution times, for exploring novel lattice geometries, and even for controllable coupling to the environment. This tutorial gives an introduction to the field of on-chip QWs of single photons and photon pairs featuring non-classical two-photon correlations.

Journal of Physics B Atomic Molecular and Optical Physics•Jan 17, 2020•28 citations

Bandit Algorithm Driven by a Classical Random Walk and a Quantum Walk

Tomoki Yamagami, Etsuo Segawa, Takatomo Mihana +3 more

Quantum walks (QWs) have a property that classical random walks (RWs) do not possess-the coexistence of linear spreading and localization-and this property is utilized to implement various kinds of applications. This paper proposes RW- and QW-based algorithms for multi-armed-bandit (MAB) problems. We show that, under some settings, the QW-based model realizes higher performance than the corresponding RW-based one by associating the two operations that make MAB problems difficult-exploration and exploitation-with these two behaviors of QWs.

arXiv:2304.10118•Entropy•May 25, 2023•8 citations

A versatile quantum walk resonator with bright classical light

Bereneice Sephton, Angela L. Dudley, Gianluca Ruffato +7 more

In a Quantum Walk (QW) the "walker" follows all possible paths at once through the principle of quantum superposition, differentiating itself from classical random walks where one random path is taken at a time. This facilitates the searching of problem solution spaces faster than with classical random walks, and holds promise for advances in dynamical quantum simulation, biological process modelling and quantum computation. Here we employ a versatile and scalable resonator configuration to realise quantum walks with bright classical light. We experimentally demonstrate the versatility of our approach by implementing a variety of QWs, all with the same experimental platform, while the use of a resonator allows for an arbitrary number of steps without scaling the number of optics. This paves the way for future QW implementations with spatial modes of light in free-space that are both versatile and scalable.

arXiv:1810.06850•PLoS ONE•Apr 9, 2019•36 citations
Quantum walks (QWs) are the quantum analogue to classical random walks. We explore various implementations of QWs and create visualizations for each, with the goal of increasing educational accessibility. A new QW, called sticky walk, is introduced, where the walker sticks to targets once found. Corresponding pseudocode and Qiskit implementations are provided. Sticky walk helps bridge the gap between non-searching QWs and Quantum Walk Search (which may be an unintuitive search algorithm for those new to QWs).
Quantum walks (QWs) are the quantum analogue to classical random walks. We present visualizations for quantum walks and show how they can be used to teach quantum concepts such as superposition and interference. Using our Quantum Walks Visualization Application (QWalkVis) for visualizing quan-tum walks lets the user select the dimensions, number of states, and number of steps in the walk and generates probabilistic plots on-the-fly. Users can view a plot for each step of the walk, allowing them to compare the probability distributions as time progresses. Visualizations share an important space in education; QWalkVis was created to aid students in learning about quantum walks and foundational quantum concepts through an interactive design. We highlight some potential use cases of QWalkVis for both self-directed student learning and the education in a classroom.
Using numerical simulation, we measured the performance of several potential quantum algorithms, based on quantum random walks, to solve Boolean satisfiability (SAT) problems. We develop the fundamentals of quantum computing and the theory of classical algorithms to indicate how these algorithms could be implemented. We also discuss the development of quantum random walks and the principles that go into creating them, presenting existing work on search algorithms using coined discrete-time quantum random walks. Although our quantum algorithms do not solve SAT problems faster than may be done classically, as a step toward that objective, we present the first example of a quantum walk on a directed graph that has a significant increase in speed over the analogous classical walk.
Abstract Quantum walks (QWs) are one of the fundamental concepts in quantum information science, being an essential component for various new applications. Implementing QWs using integrated photonic waveguide lattices allows for realizing long evolution times, for exploring novel lattice geometries, and even for controllable coupling to the environment. This tutorial gives an introduction to the field of on-chip QWs of single photons and photon pairs featuring non-classical two-photon correlations.
Quantum walks (QWs) have a property that classical random walks (RWs) do not possess-the coexistence of linear spreading and localization-and this property is utilized to implement various kinds of applications. This paper proposes RW- and QW-based algorithms for multi-armed-bandit (MAB) problems. We show that, under some settings, the QW-based model realizes higher performance than the corresponding RW-based one by associating the two operations that make MAB problems difficult-exploration and exploitation-with these two behaviors of QWs.
In a Quantum Walk (QW) the "walker" follows all possible paths at once through the principle of quantum superposition, differentiating itself from classical random walks where one random path is taken at a time. This facilitates the searching of problem solution spaces faster than with classical random walks, and holds promise for advances in dynamical quantum simulation, biological process modelling and quantum computation. Here we employ a versatile and scalable resonator configuration to realise quantum walks with bright classical light. We experimentally demonstrate the versatility of our approach by implementing a variety of QWs, all with the same experimental platform, while the use of a resonator allows for an arbitrary number of steps without scaling the number of optics. This paves the way for future QW implementations with spatial modes of light in free-space that are both versatile and scalable.