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:1510.01674 · Open Systems & Information Dynamics

Microscopic Derivation of Open Quantum Walk on Two-Node Graph

Ilya Sinayskiy, Francesco Petruccione

Published Sep 1, 2013• 5 citations
arXivHTMLPDF

Abstract

A microscopic derivation of an open quantum walk on a two-node graph is presented. It is shown that for the considered microscopic model of the system–bath interaction the resulting quantum master equation takes the form of a generalised master equation. The explicit form of the “quantum coin” operators is derived. The formalism is demonstrated on the example of a two-level system walking on a two-node graph.

DOI
10.1142/s1230161213400076

Related papers

Microscopic derivation of open quantum walks

Ilya Sinayskiy, Francesco Petruccione

A microscopic derivation of an open quantum walk of a three level system on a two node graph is presented.The explicit form of the "quantum coin" operators is derived.

AIP conference proceedings•Jan 1, 2014•0 citations

Microscopic derivation of open quantum walks

Ilya Sinayskiy, Francesco Petruccione

Open quantum walks (OQWs) are exclusively driven by dissipation and are formulated as completely positive trace-preserving (CPTP) maps on underlying graphs. The microscopic derivation of discrete and continuous-in-time OQWs is presented. It is assumed that connected nodes are weakly interacting via a common bath. The resulting reduced master equation of the quantum walker on the lattice is in the generalized master equation form. The time discretization of the generalized master equation leads to the OQW formalism. The explicit form of the transition operators establishes a connection between dynamical properties of the OQWs and thermodynamical characteristics of the environment. The derivation is demonstrated for the examples of the OQW on a circle of nodes and on a finite chain of nodes. For both examples, a transition between diffusive and ballistic quantum trajectories is observed and found to be related to the temperature of the bath.

arXiv:1510.01677•Physical Review A•Sep 8, 2015•19 citations

Quantum walks based on an interferometric analogy

Mark S. Hillery, János A. Bergou, Edgar Feldman

There are presently two models for quantum walks on graphs. The ``coined'' walk uses discrete-time steps, and contains, besides the particle making the walk, a second quantum system, the coin, that determines the direction in which the particle will move. The continuous walk operates with continuous time. Here a third model for quantum walks is proposed, which is based on an analogy to optical interferometers. It is a discrete-time model, and the unitary operator that advances the walk one step depends only on the local structure of the graph on which the walk is taking place. This type of walk also allows us to introduce elements, such as phase shifters, that have no counterpart in classical random walks. Several examples are discussed.

arXiv:quant-ph/0302161•Physical Review A•Sep 26, 2003•92 citations

Internal degrees of freedom from quantum walks without quantum coin

Giacomo Mauro D’Ariano, Marco Erba, Paolo Perinotti

Quantum walks (QWs) describe the evolution of quantum systems on graphs. An intrinsic degree of freedom---called the coin and represented by a finite-dimensional Hilbert space---is associated to each node. Scalar quantum walks are QWs with a one-dimensional coin. We propose a general strategy allowing one to construct scalar QWs on a broad variety of graphs, which admit embedding in Eulidean spaces, thus having a direct geometric interpretation. After reviewing the technique that allows one to regroup cells of nodes into new nodes, transforming finite spatial blocks into internal degrees of freedom, we prove that no QW with a two-dimensional coin can be derived from an isotropic scalar QW in this way. Finally we show that the Weyl and Dirac QWs can be derived from scalar QWs in spaces of dimension up to three, via our construction.

•Feb 26, 2019•0 citations

Controllability of Quantum Walks on Graphs

Francesca Albertini, Domenico D’Alessandro

In this paper, we consider discrete time quantum walks on graphs with coin focusing on the decentralized model, where the coin operation is allowed to change with the vertex of the graph. When the coin operations can be modified at every time step, these systems can be looked at as control systems and techniques of geometric control theory can be applied. In particular, the set of states that one can achieve can be described by studying controllability. Extending previous results, we give a characterization of the set of reachable states in terms of an appropriate Lie algebra. We then prove general results and criteria relating controllability to the algebraic and topological properties of the walk. As a consequence of these results, we prove that if the degree of the underlying graph is larger than $\frac{N}{2}$, where $N$ is the number of nodes, the quantum walk is always completely controllable, i.e., it is possible to having it to evolve according to an arbitrary unitary evolution. Another result is that controllability for decentralized models only depends on the graph and not on the particular quantum walk defined on it. We also provide explicit algorithms for control and quantify the number of steps needed for an arbitrary state transfer. The results of the paper are of interest in quantum information theory where quantum walks are used and analyzed in the development of quantum algorithms.

arXiv:1006.2405•Jun 11, 2010•3 citations

Asymptotic Dynamics of Coined Quantum Walks on Percolation Graphs

Bálint Kollár, T. Kiss, Jaroslav Novotný +1 more

Quantum walks obey unitary dynamics: they form closed quantum systems. The system becomes open if the walk suffers from imperfections represented as missing links on the underlying basic graph structure, described by dynamical percolation. Openness of the system's dynamics creates decoherence, leading to strong mixing. We present a method to analytically solve the asymptotic dynamics of coined, percolated quantum walks for a general graph structure. For the case of a circle and a linear graph we derive the explicit form of the asymptotic states. We find that a rich variety of asymptotic evolutions occur: not only the fully mixed state, but other stationary states; stable periodic and quasiperiodic oscillations can emerge, depending on the coin operator, the initial state, and the topology of the underlying graph.

arXiv:1204.6149•Physical Review Letters•Jun 5, 2012•54 citations
A microscopic derivation of an open quantum walk on a two-node graph is presented. It is shown that for the considered microscopic model of the system–bath interaction the resulting quantum master equation takes the form of a generalised master equation. The explicit form of the “quantum coin” operators is derived. The formalism is demonstrated on the example of a two-level system walking on a two-node graph.
Open quantum walks (OQWs) are exclusively driven by dissipation and are formulated as completely positive trace-preserving (CPTP) maps on underlying graphs. The microscopic derivation of discrete and continuous-in-time OQWs is presented. It is assumed that connected nodes are weakly interacting via a common bath. The resulting reduced master equation of the quantum walker on the lattice is in the generalized master equation form. The time discretization of the generalized master equation leads to the OQW formalism. The explicit form of the transition operators establishes a connection between dynamical properties of the OQWs and thermodynamical characteristics of the environment. The derivation is demonstrated for the examples of the OQW on a circle of nodes and on a finite chain of nodes. For both examples, a transition between diffusive and ballistic quantum trajectories is observed and found to be related to the temperature of the bath.
There are presently two models for quantum walks on graphs. The ``coined'' walk uses discrete-time steps, and contains, besides the particle making the walk, a second quantum system, the coin, that determines the direction in which the particle will move. The continuous walk operates with continuous time. Here a third model for quantum walks is proposed, which is based on an analogy to optical interferometers. It is a discrete-time model, and the unitary operator that advances the walk one step depends only on the local structure of the graph on which the walk is taking place. This type of walk also allows us to introduce elements, such as phase shifters, that have no counterpart in classical random walks. Several examples are discussed.
Quantum walks (QWs) describe the evolution of quantum systems on graphs. An intrinsic degree of freedom---called the coin and represented by a finite-dimensional Hilbert space---is associated to each node. Scalar quantum walks are QWs with a one-dimensional coin. We propose a general strategy allowing one to construct scalar QWs on a broad variety of graphs, which admit embedding in Eulidean spaces, thus having a direct geometric interpretation. After reviewing the technique that allows one to regroup cells of nodes into new nodes, transforming finite spatial blocks into internal degrees of freedom, we prove that no QW with a two-dimensional coin can be derived from an isotropic scalar QW in this way. Finally we show that the Weyl and Dirac QWs can be derived from scalar QWs in spaces of dimension up to three, via our construction.
In this paper, we consider discrete time quantum walks on graphs with coin focusing on the decentralized model, where the coin operation is allowed to change with the vertex of the graph. When the coin operations can be modified at every time step, these systems can be looked at as control systems and techniques of geometric control theory can be applied. In particular, the set of states that one can achieve can be described by studying controllability. Extending previous results, we give a characterization of the set of reachable states in terms of an appropriate Lie algebra. We then prove general results and criteria relating controllability to the algebraic and topological properties of the walk. As a consequence of these results, we prove that if the degree of the underlying graph is larger than N2\frac{N}{2}2N​, where NNN is the number of nodes, the quantum walk is always completely controllable, i.e., it is possible to having it to evolve according to an arbitrary unitary evolution. Another result is that controllability for decentralized models only depends on the graph and not on the particular quantum walk defined on it. We also provide explicit algorithms for control and quantify the number of steps needed for an arbitrary state transfer. The results of the paper are of interest in quantum information theory where quantum walks are used and analyzed in the development of quantum algorithms.
Quantum walks obey unitary dynamics: they form closed quantum systems. The system becomes open if the walk suffers from imperfections represented as missing links on the underlying basic graph structure, described by dynamical percolation. Openness of the system's dynamics creates decoherence, leading to strong mixing. We present a method to analytically solve the asymptotic dynamics of coined, percolated quantum walks for a general graph structure. For the case of a circle and a linear graph we derive the explicit form of the asymptotic states. We find that a rich variety of asymptotic evolutions occur: not only the fully mixed state, but other stationary states; stable periodic and quasiperiodic oscillations can emerge, depending on the coin operator, the initial state, and the topology of the underlying graph.