Related papers: Hitting statistics from quantum jumps
Random walks (or Markov chains) are models extensively used in theoretical computer science. Several tools, including analysis of quantities such as hitting and mixing times, are helpful for devising randomized algorithms. A notable example…
In this work we make use of generalized inverses associated with quantum channels acting on finite-dimensional Hilbert spaces, so that one may calculate the mean hitting time for a particle to reach a chosen goal subspace. The questions…
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…
In this paper we define new Monte Carlo type classical and quantum hitting times, and we prove several relationships among these and the already existing Las Vegas type definitions. In particular, we show that for some marked state the two…
We consider the quantum first detection problem for a particle evolving on a graph under repeated projective measurements with fixed rate $1/\tau$. A general formula for the mean first detected transition time is obtained for a quantum walk…
A new model of quantum random walks is introduced, on lattices as well as on finite graphs. These quantum random walks take into account the behavior of open quantum systems. They are the exact quantum analogues of classical Markov chains.…
A quantum random walk model is established on a one-dimensional periodic lattice that fluctuates between two possible states. This model is defined by Lindblad rate equations that incorporate the transition rates between the two lattice…
Hitting times provide a fundamental measure of distance in random processes, quantifying the expected number of steps for a random walk starting at node $u$ to reach node $v$. They have broad applications across domains such as network…
We first use the quantum method to replicate the well-known results of a single atom relaxing, whilst demonstrating the intuitive picture it provides for dissipative dynamics. By use of individual "quantum trajectories", the method allows…
In the classical theory of Markov chains, one may study the mean time to reach some chosen state, and it is well-known that in the irreducible, finite case, such quantity can be calculated in terms of the fundamental matrix of the walk, as…
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…
We investigate the convergence of hitting times for jump-diffusion processes. Specifically, we study a sequence of stochastic differential equations with jumps. Under reasonable assumptions, we establish the convergence of solutions to the…
We consider Markovian open quantum systems subject to stochastic resetting, which means that the dissipative time evolution is reset at randomly distributed times to the initial state. We show that the ensuing dynamics is non-Markovian and…
In this work, we consider a general feedback protocol based on quantum-jump detections, where the last detected jump channel is stored in a memory and subsequently used to implement a feedback action, such as modifying the system…
We introduce jumptime unraveling as a distinct description of open quantum systems. As our starting point, we consider quantum jump trajectories, which emerge, physically, from continuous quantum measurements, or, formally, from the…
The continuous limit of one dimensional discrete-time quantum walks with time- and space-dependent coefficients is investigated. A given quantum walk does not generally admit a continuous limit but some families (1-jets) of quantum walks…
We show that a quantum state transfer, previously studied as a continuous time process in networks of interacting spins, can be achieved within the model of discrete time quantum walks with position dependent coin. We argue that due to…
We study first-passage statistics for one-dimensional random walks $S_n$ with independent and identically distributed jumps starting from the origin. We focus on the joint distribution of the first-passage time $\tau_b$ and first-passage…
Universal quantum computation can be realised using both continuous-time and discrete-time quantum walks. We present a version based on single particle discrete-time quantum walk to realize multi-qubit computation tasks. The scalability of…
We investigate the splitting probability of a monitored continuous-time quantum walk with two targets and show that, in stark contrast to a classical random walk, it exhibits a nonanalytic, phase-transition-like behavior controlled by the…