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

Quantum walks: theory and implementation

Kia Manouchehri

Published Jan 1, 2010• 0 citations
OpenAlex

Abstract

In this thesis we present a theoretical study of quantum walks, with a particular focus on the development of viable schemes concerned with their physical realization. Ever since their introduction over a decade ago, quantum walks have been extensively explored for their non-intuitive dynamics which may hold the key to a new generation of quantum algorithms. This growing interest in the theoretical applications of quantum walks has been paralleled by a flurry of research into a more practical problem: how does one physically implement a quantum walk in the laboratory? We begin this thesis by first presenting an overview of the quantum walk theory, including some of its algorithmic applications. This is then followed by a comprehensive survey of numerous proposals for a physical implementation of quantum walks, underpinned by a wide range of quantum, classical and hybrid technologies. This review consequently highlights what has so far remained a major challenge for the quantum walk enthusiasts; a physical realization that is experimentally viable whilst remaining readily scalable and not limited to problems with specific connectivity criteria. It is precisely this challenge that we seek to examine in the remaining parts of this thesis.

Related papers

Quantum Walk Computing: Theory, Implementation, and Application

Xiaogang Qiang, Shixin Ma, Haijing Song

The classical random walk formalism plays an important role in a wide range of applications. Its quantum counterpart, the quantum walk, is proposed as an important theoretical model for quantum computing. By exploiting quantum effects such as superposition, interference, and entanglement, quantum walks and their variations have been extensively studied for achieving computing power beyond that of classical computing and have been broadly used in designing quantum algorithms for algebraic and optimization problems, graph and network analysis, and quantum Hamiltonian and biochemical process simulations. Moreover, quantum walk models have been proven capable of universal quantum computation. Unlike conventional quantum circuit models, quantum walks provide a feasible path for implementing application-specific quantum computing, particularly in the noisy intermediate-scale quantum era. Recently, remarkable progress has been achieved in implementing a wide variety of quantum walks and quantum walk applications, which demonstrates the great potential of quantum walks. In this review, we provide a thorough summary of quantum walks and quantum walk computing, including theories and characteristics, physical implementations, and applications. We also discuss the challenges facing quantum walk computing, which aims to realize a practical quantum computer in the near future.

arXiv:2404.04178•Intelligent Computing•Jan 1, 2024•55 citations

Quantum random walks - an introductory overview

Julia Kempe, Albert Einstein

This article aims to provide an introductory survey on quantum random walks. Starting from a physical effect to illustrate the main ideas we will introduce quantum random walks, review some of their properties and outline their striking differences to classical walks. We will touch upon both physical effects and computer science applications, introducing some of the main concepts and language of present day quantum information science in this context. We will mention recent developments in this new area and outline some open questions. 1. Overview Ever since the discovery of quantum mechanics people have been puzzled by the counter-intuitive character of the laws of nature. Over time we have learned to accept more and more effects that are unimaginable in a classical Newtonian world. Modern technology exploits quantum effects both to our benefit and detriment—among the memorable examples we should cite laser technology and not omit the atomic bomb. In recent years interest in quantum information theory has been generated by the prospect of employing its laws to design devices of surprising power [1]. New ideas include quantum cryptography [2, 3] and quantum computation. In 1994 Shor [4] discovered a quantum algorithm to factor numbers efficiently (that is in time that grows only polynomically with the length of the number to be factored). This has unleashed a wave of activity across a broad range of disciplines: physics, computer science, mathematics and engineering. This fruitful axis of research has uncovered many new effects that are strikingly different from their classical counterparts, both from the physical point of view as well as from a computer science and communication theory perspective. Over time these communities have gained a greater understanding of the concepts and notions of the other. The idea that information cannot be separated from

•Jan 1, 2003•920 citations

Quantum Walks

M. Štefaňák

Over the last two decades quantum walks have proven to be a very useful concept in quantum information processing, quantum communication and quantum simulations. The presented thesis reviews our contribution to this field of research. We provide a thorough introduction to methods used for the study of quantum walks and their potential applications. To keep the presentation intelligible we focus on specific examples. In particular, we analyze in detail the properties of homogeneous quantum walks on a one-dimensional lattice with two and three internal states. The application of the obtained results is illustrated on the examples persistence of unvisited sites and quantum transport to an absorbing sink. We also discuss quantum walks on finite graphs and their applications to quantum search and perfect state transfer. Extension of the presented results, which can be found in enclosed published papers, is discussed in detail.

•Jan 1, 2017•0 citations

Quantum random walks without walking

Kia Manouchehri, Jingbo B. Wang

Quantum random walks have received much interest due to their nonintuitive dynamics, which may hold the key to a new generation of quantum algorithms. What remains a major challenge is a physical realization that is experimentally viable and not limited to special connectivity criteria. We present a scheme for walking on arbitrarily complex graphs, which can be realized using a variety of quantum systems such as a Bose-Einstein condensate trapped inside an optical lattice. This scheme is particularly elegant since the walker is not required to physically step between the nodes; only flipping coins is sufficient.

arXiv:0809.0034•Physical Review A•Dec 16, 2009•17 citations

Quantum Walk-Based Algorithms for Optimization Problems

Jincheng Zhang

This paper explores the application of quantum walk algorithms to a variety of optimization problems. Traditional optimization algorithms often struggle with complex landscapes and high dimensionality, leading to computational bottlenecks. Quantum walks, leveraging quantum superposition and interference, offer a fundamentally different approach that can potentially overcome these limitations. We present a framework for designing quantum walk algorithms specifically for optimization, focusing on key aspects such as step selection, boundary conditions, and measurement strategies. The core of our approach lies in adapting the inherent parallelism of quantum walks to efficiently explore the solution space. We demonstrate the theoretical potential of this approach through examples and outline future research directions. The algorithms presented aim to significantly improve the speed and accuracy of solving various optimization problems. The core claim is that quantum walks provide a novel approach to search and optimization. The core mechanism involves developing tailored quantum walk algorithms, capitalizing on their parallel exploration capabilities. This research expands the applicability of quantum walk theory beyond its established use cases.

•Aug 29, 2026•0 citations

Quantum Walks: Theory, Application, and Implementation

Albert T. Schmitz

The quantum walk is a method for conceptualizing and designing quantum computing algorithms and it comes in two forms: the continuous-time and discrete-time quantum walk. The thesis is organized into three parts, each of which looks to develop the concept and uses of the quantum walk. The first part is the theory of the quantum walk. This includes definitions and considerations for the various incarnations of the discrete-time quantum walk and a discussion on the general method for connecting the continuous-time and discrete-time versions. As a result, it is shown that most versions of the discrete-time quantum walk can be put into a general form and this can be used to simulate any continuous-time quantum walk. The second part uses these results for a hypothetical application. The application presented is a search algorithm that appears to scale in the time for completion independent of the size of the search space. This behavior is then elaborated upon and shown to have general qualitative agreement with simulations to within the approximations that are made. The third part introduces a method of implementation. Given a universal quantum computer, the method is discussed and shown to simulate an arbitrary discrete-time quantum walk. Some of the benefits of this method are that half the unitary evolution can be achieved without the use of any gates and there may be some possibility for error detection. The three parts combined suggest a possible experiment, given a quantum computing scheme of sufficient robustness.

•Jan 1, 2016•1 citation
In this thesis we present a theoretical study of quantum walks, with a particular focus on the development of viable schemes concerned with their physical realization. Ever since their introduction over a decade ago, quantum walks have been extensively explored for their non-intuitive dynamics which may hold the key to a new generation of quantum algorithms. This growing interest in the theoretical applications of quantum walks has been paralleled by a flurry of research into a more practical problem: how does one physically implement a quantum walk in the laboratory? We begin this thesis by first presenting an overview of the quantum walk theory, including some of its algorithmic applications. This is then followed by a comprehensive survey of numerous proposals for a physical implementation of quantum walks, underpinned by a wide range of quantum, classical and hybrid technologies. This review consequently highlights what has so far remained a major challenge for the quantum walk enthusiasts; a physical realization that is experimentally viable whilst remaining readily scalable and not limited to problems with specific connectivity criteria. It is precisely this challenge that we seek to examine in the remaining parts of this thesis.
The classical random walk formalism plays an important role in a wide range of applications. Its quantum counterpart, the quantum walk, is proposed as an important theoretical model for quantum computing. By exploiting quantum effects such as superposition, interference, and entanglement, quantum walks and their variations have been extensively studied for achieving computing power beyond that of classical computing and have been broadly used in designing quantum algorithms for algebraic and optimization problems, graph and network analysis, and quantum Hamiltonian and biochemical process simulations. Moreover, quantum walk models have been proven capable of universal quantum computation. Unlike conventional quantum circuit models, quantum walks provide a feasible path for implementing application-specific quantum computing, particularly in the noisy intermediate-scale quantum era. Recently, remarkable progress has been achieved in implementing a wide variety of quantum walks and quantum walk applications, which demonstrates the great potential of quantum walks. In this review, we provide a thorough summary of quantum walks and quantum walk computing, including theories and characteristics, physical implementations, and applications. We also discuss the challenges facing quantum walk computing, which aims to realize a practical quantum computer in the near future.
This article aims to provide an introductory survey on quantum random walks. Starting from a physical effect to illustrate the main ideas we will introduce quantum random walks, review some of their properties and outline their striking differences to classical walks. We will touch upon both physical effects and computer science applications, introducing some of the main concepts and language of present day quantum information science in this context. We will mention recent developments in this new area and outline some open questions. 1. Overview Ever since the discovery of quantum mechanics people have been puzzled by the counter-intuitive character of the laws of nature. Over time we have learned to accept more and more effects that are unimaginable in a classical Newtonian world. Modern technology exploits quantum effects both to our benefit and detriment—among the memorable examples we should cite laser technology and not omit the atomic bomb. In recent years interest in quantum information theory has been generated by the prospect of employing its laws to design devices of surprising power [1]. New ideas include quantum cryptography [2, 3] and quantum computation. In 1994 Shor [4] discovered a quantum algorithm to factor numbers efficiently (that is in time that grows only polynomically with the length of the number to be factored). This has unleashed a wave of activity across a broad range of disciplines: physics, computer science, mathematics and engineering. This fruitful axis of research has uncovered many new effects that are strikingly different from their classical counterparts, both from the physical point of view as well as from a computer science and communication theory perspective. Over time these communities have gained a greater understanding of the concepts and notions of the other. The idea that information cannot be separated from
Over the last two decades quantum walks have proven to be a very useful concept in quantum information processing, quantum communication and quantum simulations. The presented thesis reviews our contribution to this field of research. We provide a thorough introduction to methods used for the study of quantum walks and their potential applications. To keep the presentation intelligible we focus on specific examples. In particular, we analyze in detail the properties of homogeneous quantum walks on a one-dimensional lattice with two and three internal states. The application of the obtained results is illustrated on the examples persistence of unvisited sites and quantum transport to an absorbing sink. We also discuss quantum walks on finite graphs and their applications to quantum search and perfect state transfer. Extension of the presented results, which can be found in enclosed published papers, is discussed in detail.
Quantum random walks have received much interest due to their nonintuitive dynamics, which may hold the key to a new generation of quantum algorithms. What remains a major challenge is a physical realization that is experimentally viable and not limited to special connectivity criteria. We present a scheme for walking on arbitrarily complex graphs, which can be realized using a variety of quantum systems such as a Bose-Einstein condensate trapped inside an optical lattice. This scheme is particularly elegant since the walker is not required to physically step between the nodes; only flipping coins is sufficient.
This paper explores the application of quantum walk algorithms to a variety of optimization problems. Traditional optimization algorithms often struggle with complex landscapes and high dimensionality, leading to computational bottlenecks. Quantum walks, leveraging quantum superposition and interference, offer a fundamentally different approach that can potentially overcome these limitations. We present a framework for designing quantum walk algorithms specifically for optimization, focusing on key aspects such as step selection, boundary conditions, and measurement strategies. The core of our approach lies in adapting the inherent parallelism of quantum walks to efficiently explore the solution space. We demonstrate the theoretical potential of this approach through examples and outline future research directions. The algorithms presented aim to significantly improve the speed and accuracy of solving various optimization problems. The core claim is that quantum walks provide a novel approach to search and optimization. The core mechanism involves developing tailored quantum walk algorithms, capitalizing on their parallel exploration capabilities. This research expands the applicability of quantum walk theory beyond its established use cases.
The quantum walk is a method for conceptualizing and designing quantum computing algorithms and it comes in two forms: the continuous-time and discrete-time quantum walk. The thesis is organized into three parts, each of which looks to develop the concept and uses of the quantum walk. The first part is the theory of the quantum walk. This includes definitions and considerations for the various incarnations of the discrete-time quantum walk and a discussion on the general method for connecting the continuous-time and discrete-time versions. As a result, it is shown that most versions of the discrete-time quantum walk can be put into a general form and this can be used to simulate any continuous-time quantum walk. The second part uses these results for a hypothetical application. The application presented is a search algorithm that appears to scale in the time for completion independent of the size of the search space. This behavior is then elaborated upon and shown to have general qualitative agreement with simulations to within the approximations that are made. The third part introduces a method of implementation. Given a universal quantum computer, the method is discussed and shown to simulate an arbitrary discrete-time quantum walk. Some of the benefits of this method are that half the unitary evolution can be achieved without the use of any gates and there may be some possibility for error detection. The three parts combined suggest a possible experiment, given a quantum computing scheme of sufficient robustness.