Related papers: Continuous-time open quantum walks in one dimensio…
Inspired by the classical spectral analysis of birth-death chains using orthogonal polynomials, we study an analogous set of constructions in the context of open quantum dynamics and related walks. In such setting, block tridiagonal…
Quantum Markov chains (QMCs) are positive maps on a trace-class space describing open quantum dynamics on graphs. Such objects have a statistical resemblance with classical random walks, while at the same time it allows for internal…
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, which allows for incoherent…
In this paper, we consider multi-dimensional birth and death chains and continuous time quantum walks (CTQW) related to them. For CTQW related to our forms of multi-dimensional birth and death chains, we obtain the time scaled independence…
Recently, quantized versions of random walks have been explored as effective elements for quantum algorithms. In the simplest case of one dimension, the theory has remained divided into the discrete-time quantum walk and the continuous-time…
We present a collection of methods to simulate entangled dynamics of open quantum systems governed by the Lindblad equation with tensor network methods. Tensor network methods using matrix product states have been proven very useful to…
We survey the equations of continuous-time quantum walks on simple one-dimensional lattices, which include the finite and infinite lines and the finite cycle, and compare them with the classical continuous-time Markov chains. The focus of…
In this expository note, we discuss spatially inhomogeneous quantum walks in one dimension and describe a genre of mathematical methods that enables one to translate information about the time-independent eigenvalue equation for the unitary…
Quantum open systems are described in the Markovian limit by master equations in Lindblad form. I argue that common ``quantum trajectory'' techniques corresponding to continuous measurement schemes, which solve the master equation by…
We consider a discrete-time quantum walk, called the Grover walk, on a distance regular graph $X$. Given that $X$ has diameter $d$ and invertible adjacency matrix, we show that the square of the transition matrix of the Grover walk on $X$…
We consider a neighbourhood random walk on a quadrant, $\{(X_1(t),X_2(t),\varphi(t)):t\geq 0\}$, with state space \begin{eqnarray*} \mathcal{S}&=&\{(n,m,i):n,m=0,1,2,\ldots;i=1,2,\ldots,k(n,m)\}. \end{eqnarray*} Assuming start in state…
We study two classes of open systems: discrete-time quantum walks (a type of Floquet-engineered discrete quantum map) and the Lindblad master equation (a general framework of dissipative quantum systems), focusing on the non-equilibrium…
The foundational work of Karlin and McGregor established a powerful connection between random walks with tridiagonal transition matrices and the theory of orthogonal polynomials. We consider a particular extension of this framework, where…
We make use of matrix representations of completely positive maps in order to study open quantum dynamics on graphs, with emphasis on quantum walks and the associated trajectories obtained via a monitoring of the position. We discuss the…
Semigroups describing the time evolution of open quantum systems in finite-dimensional spaces have generators of a special form, known as Lindblad generators. These generators and the corresponding processes of time evolution are analyzed,…
Quantum walks on graphs are fundamental to quantum computing and have led to many interesting open problems in algebraic graph theory. This review article highlights three key classes of open problems in this domain; perfect state transfer,…
The Lindblad quantum master equation is one of the central approaches to the physics of open quantum systems. In particular, boundary driving enables the study of transport, where a steady state emerges in the long-time limit, which…
We consider open quantum walks on a graph, and consider the random variables defined as the passage time and number of visits to a given point of the graph. We study in particular the probability that the passage time is finite, the…
We address the problem of the construction of quantum walks on Cayley graphs. Our main motivation is the relationship between quantum algorithms and quantum walks. In particular, we discuss the choice of the dimension of the local Hilbert…
It is demonstrated that in gate-based quantum computing architectures quantum walk is a natural mathematical description of quantum gates. It originates from field-matter interaction driving the system, but is not attached to specific qubit…