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

Open Systems & Information Dynamics

Non-reversal Open Quantum Walks

Y. H. Goolam Hossen, Ilya Sinayskiy, Francesco Petruccione

Published Dec 1, 2018• 4 citations
Publisher

Abstract

A model of non-reversal quantum walk is introduced. The process is introduced in 1D and 2D using the formalism of open quantum walks (OQWs). In such a walk, a particle cannot go back to previously visited sites but it can jump on the same site or move to a new site. Examples of some non-reversal quantum trajectories and distributions are given and their difference with normal OQWs is discussed. Finally, a linear relationship is formulated between the radius of the spread and the number of steps of the walk that might have interesting applications.

DOI
10.1142/s1230161218500178

Related papers

Open Quantum Walks: a short introduction

Ilya Sinayskiy, Francesco Petruccione

The concept of open quantum walks (OQW), quantum walks exclusively driven by the interaction with the external environment, is reviewed. OQWs are formulated as discrete completely positive maps on graphs. The basic properties of OQWs are summarised and new examples of OQWs on and their simulation by means of quantum trajectories are presented.

arXiv:1402.2146•Journal of Physics Conference Series•Jun 10, 2013•31 citations

Dynamics and computation in linear open quantum walks

Pedro Linck, Nadja K. Bernardes

Open Quantum Walks (OQW) are a type of quantum walk governed by the system's interaction with its environment. We explore the time evolution and the limit behavior of the OQW framework for Quantum Computation and show how we can represent random unitary quantum channels, such as the dephasing and depolarizing channels, in this model. We also develop a simulation protocol with circuit representation for this model, which is heavily inspired by the fact that graphs represent OQW and are, thereby, local (meaning that the state in a particular node interacts only with its neighborhood). We obtain asymptotic advantages in the system's dimension, circuit depth, and CNOT count compared to other simulation methods.

arXiv:2503.17591•Physical Review A•Sep 4, 2025•3 citations

Quantum optical implementation of open quantum walks

Ilya Sinayskiy, Francesco Petruccione

A quantum optical implementation of the recently proposed open quantum walks (OQWs) is suggested. In the presented quantum optical scheme a two level atom plays the role of the "walker" and the Fock states of the cavity mode correspond to the lattice sites of the OQW. Using the small unitary rotations approach the effective dynamics of the system is shown to be an OQW. The presented scheme allows for a simple physical implementation of the OQW formalism, but it can be extended to create more diverse OQWs.

International Journal of Quantum Information•Mar 1, 2014•15 citations

Lazy open quantum walks

Garreth Kemp, Ilya Sinayskiy, Francesco Petruccione

Open quantum walks (OQWs) describe a quantum walker on an underlying graph whose dynamics is purely driven by dissipation and decoherence. Mathematically, they are formulated as completely positive trace preserving (CPTP) maps on the space of density matrices for the walker on the graph. Any microscopically derived OQW must include the possibility of remaining on the same site on the graph when the map is applied. We extend the CPTP map to describe a lazy OQW. We derive a central limit theorem for lazy OQWs on a $d$-dimensional lattice, where the distribution converges to a Gaussian. We show that the properties of this Gaussian computed using conventional methods agree with the general formulas derived from our central limit theorem.

arXiv:1908.04124•Physical Review A•Jul 27, 2020•8 citations

Open Quantum Walks as a Tool for Dissipative Quantum Computing

Francesco Petruccione, Ilya Sinayskiy

Recently, open quantum walks (OQW) have been formulated as quantum Markov chains on graphs. It is shown that OQWs are a very useful tool for the formulation of dissipative quantum computing algorithms and for dissipative quantum state preparation.

Research in Optical Sciences•Jan 1, 2012•1 citation

Quantum walks on graphs and quantum scattering theory

Edgar Feldman, Mark S. Hillery

We discuss a particular kind of quantum walk on a general graph. We affix two semi-infinite lines to a general finite graph, which we call tails. On the tails, the particle making the walk simply advances one unit at each time step, so that its behavior there is analogous to free propagation We are interested in how many steps it will take the particle, starting on one tail and propagating through the graph (where its propagation is not free), to emerge onto the other tail. The probability to make such a walk in n steps and the hitting time for such a walk can be expressed in terms of the transmission amplitude for the graph, which is one element of its S matrix. Demonstrating this necessitates a study of the analyticity properties of the transmission and reflection amplitudes of a graph. We show that the graph can have bound states that cannot be accessed by a particle entering the graph from one of its tails. Time-reversal invariance of a quantum walk is defined and used to show that the transmission amplitudes for the particle entering the graph from different directions are the same if the walk is time-reversal invariant.

arXiv:quant-ph/0403066•Contemporary mathematics - American Mathematical Society•Jan 1, 2005•38 citations
A model of non-reversal quantum walk is introduced. The process is introduced in 1D and 2D using the formalism of open quantum walks (OQWs). In such a walk, a particle cannot go back to previously visited sites but it can jump on the same site or move to a new site. Examples of some non-reversal quantum trajectories and distributions are given and their difference with normal OQWs is discussed. Finally, a linear relationship is formulated between the radius of the spread and the number of steps of the walk that might have interesting applications.
Open Quantum Walks (OQW) are a type of quantum walk governed by the system's interaction with its environment. We explore the time evolution and the limit behavior of the OQW framework for Quantum Computation and show how we can represent random unitary quantum channels, such as the dephasing and depolarizing channels, in this model. We also develop a simulation protocol with circuit representation for this model, which is heavily inspired by the fact that graphs represent OQW and are, thereby, local (meaning that the state in a particular node interacts only with its neighborhood). We obtain asymptotic advantages in the system's dimension, circuit depth, and CNOT count compared to other simulation methods.
A quantum optical implementation of the recently proposed open quantum walks (OQWs) is suggested. In the presented quantum optical scheme a two level atom plays the role of the "walker" and the Fock states of the cavity mode correspond to the lattice sites of the OQW. Using the small unitary rotations approach the effective dynamics of the system is shown to be an OQW. The presented scheme allows for a simple physical implementation of the OQW formalism, but it can be extended to create more diverse OQWs.
Open quantum walks (OQWs) describe a quantum walker on an underlying graph whose dynamics is purely driven by dissipation and decoherence. Mathematically, they are formulated as completely positive trace preserving (CPTP) maps on the space of density matrices for the walker on the graph. Any microscopically derived OQW must include the possibility of remaining on the same site on the graph when the map is applied. We extend the CPTP map to describe a lazy OQW. We derive a central limit theorem for lazy OQWs on a ddd-dimensional lattice, where the distribution converges to a Gaussian. We show that the properties of this Gaussian computed using conventional methods agree with the general formulas derived from our central limit theorem.
We discuss a particular kind of quantum walk on a general graph. We affix two semi-infinite lines to a general finite graph, which we call tails. On the tails, the particle making the walk simply advances one unit at each time step, so that its behavior there is analogous to free propagation We are interested in how many steps it will take the particle, starting on one tail and propagating through the graph (where its propagation is not free), to emerge onto the other tail. The probability to make such a walk in n steps and the hitting time for such a walk can be expressed in terms of the transmission amplitude for the graph, which is one element of its S matrix. Demonstrating this necessitates a study of the analyticity properties of the transmission and reflection amplitudes of a graph. We show that the graph can have bound states that cannot be accessed by a particle entering the graph from one of its tails. Time-reversal invariance of a quantum walk is defined and used to show that the transmission amplitudes for the particle entering the graph from different directions are the same if the walk is time-reversal invariant.