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:1603.03699 · Physical Review A

Physical realizability of continuous-time quantum stochastic walks

Bruno G. Taketani, Luke C. G. Govia, Frank K. Wilhelm

Published May 31, 2018• 5 citations
arXivHTMLPDF

Abstract

Quantum walks are a promising methodology that can be used to both understand and implement quantum information processing tasks. The quantum stochastic walk is a recently developed framework that combines the concept of a quantum walk with that of a classical random walk, through open system evolution of a quantum system. Quantum stochastic walks have been shown to have applications in as far reaching fields as artificial intelligence. However, there are significant constraints on the kind of open system evolutions that can be realized in a physical experiment. In this work, we discuss the restrictions on the allowed open system evolution and the physical assumptions underpinning them. We show that general direct implementations would require the complete solution of the underlying unitary dynamics and sophisticated reservoir engineering, thus weakening the benefits of experimental implementation.

DOI
10.1103/physreva.97.052132

Related papers

Quantum simulation of a quantum stochastic walk

Luke C. G. Govia, Bruno G. Taketani, Peter K Schuhmacher +1 more

Abstract The study of quantum walks has been shown to have a wide range of applications in areas such as artificial intelligence, the study of biological processes, and quantum transport. The quantum stochastic walk (QSW), which allows for incoherent movement of the walker, and therefore, directionality, is a generalization on the fully coherent quantum walk. While a QSW can always be described in Lindblad formalism, this does not mean that it can be microscopically derived in the standard weak-coupling limit under the Born–Markov approximation. This restricts the class of QSWs that can be experimentally realized in a simple manner. To circumvent this restriction, we introduce a technique to simulate open system evolution on a fully coherent quantum computer, using a quantum trajectories style approach. We apply this technique to a broad class of QSWs, and show that they can be simulated with minimal experimental resources. Our work opens the path towards the experimental realization of QSWs on large graphs with existing quantum technologies.

arXiv:1606.08096•Quantum Science and Technology•Dec 15, 2016•12 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

Quantum simulation of a discrete-time quantum stochastic walk

Peter K. Schuhmacher, Luke C. G. Govia, Bruno G. Taketani +1 more

Abstract Quantum walks have been shown to have a wide range of applications, from artificial intelligence, to photosynthesis, and quantum transport. Quantum stochastic walks (QSWs) generalize this concept to additional non-unitary evolution. In this paper, we propose a trajectory-based quantum simulation protocol to effectively implement a family of discrete-time QSWs in a quantum device. After deriving the protocol for a 2-vertex graph with a single edge, we show how our protocol generalizes to a graph with arbitrary topology and connectivity. The straightforward generalization leads to simple scaling of the protocol to complex graphs. Finally, we show how to simulate a restricted class of continuous-time QSWs by a discrete-time QSW, and how this is amenable to our simulation protocol for discrete-time QSWs.

arXiv:2004.06151•Europhysics Letters (EPL)•Mar 1, 2021•4 citations

Continuous-time quantum random walks require discrete space

K Manouchehri, J B Wang

Quantum random walks are shown to have non-intuitive dynamics which makes them an attractive area of study for devising quantum algorithms for long-standing open problems as well as those arising in the field of quantum computing. In the case of continuous-time quantum random walks, such peculiar dynamics can arise from simple evolution operators closely resembling the quantum free-wave propagator. We investigate the divergence of quantum walk dynamics from the free-wave evolution and show that, in order for continuous-time quantum walks to display their characteristic propagation, the state space must be discrete. This behavior rules out many continuous quantum systems as possible candidates for implementing continuous-time quantum random walks.

arXiv:quant-ph/0611129•Journal of Physics A Mathematical and Theoretical•Oct 23, 2007•14 citations

Continuous-Time Quantum Random Walks Require Discrete Space

Kia Manouchehri, Jingbo B. Wang

Quantum random walks are shown to have non-intuitive dynamics which makes them an attractive area of study for devising quantum algorithms for long-standing open problems as well as those arising in the field of quantum computing. In the case of continuous-time quantum random walks, such peculiar dynamics can arise from simple evolution operators closely resembling the quantum free-wave propagator. We investigate the divergence of quantum walk dynamics from the free-wave evolution and show that in order for continuous-time quantum walks to display their characteristic propagation, the state space must be discrete. This behavior rules out many continuous quantum systems as possible candidates for implementing continuous-time quantum random walks. Furthermore our findings demonstrate that the properties of the quantum walk are critically dependant on its initialization which in turn impacts any subsequent quantum algorithms based upon it.

•Nov 12, 2006•11 citations

Quantum walks: theory and implementation

Kia Manouchehri

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.

•Jan 1, 2010•0 citations
Quantum walks are a promising methodology that can be used to both understand and implement quantum information processing tasks. The quantum stochastic walk is a recently developed framework that combines the concept of a quantum walk with that of a classical random walk, through open system evolution of a quantum system. Quantum stochastic walks have been shown to have applications in as far reaching fields as artificial intelligence. However, there are significant constraints on the kind of open system evolutions that can be realized in a physical experiment. In this work, we discuss the restrictions on the allowed open system evolution and the physical assumptions underpinning them. We show that general direct implementations would require the complete solution of the underlying unitary dynamics and sophisticated reservoir engineering, thus weakening the benefits of experimental implementation.
Abstract The study of quantum walks has been shown to have a wide range of applications in areas such as artificial intelligence, the study of biological processes, and quantum transport. The quantum stochastic walk (QSW), which allows for incoherent movement of the walker, and therefore, directionality, is a generalization on the fully coherent quantum walk. While a QSW can always be described in Lindblad formalism, this does not mean that it can be microscopically derived in the standard weak-coupling limit under the Born–Markov approximation. This restricts the class of QSWs that can be experimentally realized in a simple manner. To circumvent this restriction, we introduce a technique to simulate open system evolution on a fully coherent quantum computer, using a quantum trajectories style approach. We apply this technique to a broad class of QSWs, and show that they can be simulated with minimal experimental resources. Our work opens the path towards the experimental realization of QSWs on large graphs with existing quantum technologies.
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.
Abstract Quantum walks have been shown to have a wide range of applications, from artificial intelligence, to photosynthesis, and quantum transport. Quantum stochastic walks (QSWs) generalize this concept to additional non-unitary evolution. In this paper, we propose a trajectory-based quantum simulation protocol to effectively implement a family of discrete-time QSWs in a quantum device. After deriving the protocol for a 2-vertex graph with a single edge, we show how our protocol generalizes to a graph with arbitrary topology and connectivity. The straightforward generalization leads to simple scaling of the protocol to complex graphs. Finally, we show how to simulate a restricted class of continuous-time QSWs by a discrete-time QSW, and how this is amenable to our simulation protocol for discrete-time QSWs.
Quantum random walks are shown to have non-intuitive dynamics which makes them an attractive area of study for devising quantum algorithms for long-standing open problems as well as those arising in the field of quantum computing. In the case of continuous-time quantum random walks, such peculiar dynamics can arise from simple evolution operators closely resembling the quantum free-wave propagator. We investigate the divergence of quantum walk dynamics from the free-wave evolution and show that, in order for continuous-time quantum walks to display their characteristic propagation, the state space must be discrete. This behavior rules out many continuous quantum systems as possible candidates for implementing continuous-time quantum random walks.
Quantum random walks are shown to have non-intuitive dynamics which makes them an attractive area of study for devising quantum algorithms for long-standing open problems as well as those arising in the field of quantum computing. In the case of continuous-time quantum random walks, such peculiar dynamics can arise from simple evolution operators closely resembling the quantum free-wave propagator. We investigate the divergence of quantum walk dynamics from the free-wave evolution and show that in order for continuous-time quantum walks to display their characteristic propagation, the state space must be discrete. This behavior rules out many continuous quantum systems as possible candidates for implementing continuous-time quantum random walks. Furthermore our findings demonstrate that the properties of the quantum walk are critically dependant on its initialization which in turn impacts any subsequent quantum algorithms based upon it.
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.