Related papers: First Hitting Times on a Quantum Computer: Trackin…
We study the first detected recurrence time problem of continuous-time quantum walks on graphs. While previous works have employed projective measurements to determine the first return time, we implement a protocol based on weak…
We study a quantum walk of a single particle that is subject to stroboscopic projective measurements on a graph with two sites. This two-level system is the minimal model of a measurement induced quantum walk. The mean first detected…
We investigate a tight binding quantum walk on a graph. Repeated stroboscopic measurements of the position of the particle yield a measured "trajectory", and a combination of classical and quantum mechanical properties for the walk are…
Even after decades of research the problem of first passage time statistics for quantum dynamics remains a challenging topic of fundamental and practical importance. Using a projective measurement approach, with a sampling time $\tau$, we…
Measurements on a quantum particle unavoidably affect its state, since the otherwise unitary evolution of the system is interrupted by a non-unitary projection operation. In order to probe measurement-induced effects in the state dynamics…
The quantum first-detection problem concerns the statistics of the time at which a system, subject to repeated measurements, is observed in a prescribed target state for the first time. Unlike its classical counterpart, the measurement back…
Hitting times for discrete quantum walks on graphs give an average time before the walk reaches an ending condition. To be analogous to the hitting time for a classical walk, the quantum hitting time must involve repeated measurements as…
Classical first-passage times under restart are used in a wide variety of models, yet the quantum version of the problem still misses key concepts. We study the quantum hitting time with restart using a monitored quantum walk. The restart…
We define the hitting time for a model of continuous-time open quantum walks in terms of quantum jumps. Our starting point is a master equation in Lindblad form, which can be taken as the quantum analogue of the rate equation for a…
We define the hitting (or absorbing) time for the case of continuous quantum walks by measuring the walk at random times, according to a Poisson process with measurement rate $\lambda$. From this definition we derive an explicit formula for…
We investigate the statistics of the first detected passage time of a quantum walk. The postulates of quantum theory, in particular the collapse of the wave function upon measurement, reveal an intimate connection between the wave function…
We introduce a novel time-energy uncertainty relation within the context of restarts in monitored quantum dynamics. Initially, we investigate the concept of ``first hitting time'' in quantum systems using an IBM quantum computer and a…
The problem of the detection statistics of a quantum walker has received increasing interest, connected as it is to the problem of quantum search. We investigate the effect of employing a moving detector, using a projective measurement…
Quantum walks constitute a versatile platform for simulating transport phenomena on discrete graphs including topological material properties while providing a high control over the relevant parameters at the same time. To experimentally…
In recent years, quantum walks have been widely researched and have shown exciting properties. One such is a quadratic speed-up in hitting time compared to its classical counterpart. In this paper, we design a quantum circuit for the MNRS…
Hitting times are the average time it takes a walk to reach a given final vertex from a given starting vertex. The hitting time for a classical random walk on a connected graph will always be finite. We show that, by contrast, quantum walks…
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 discrete-time quantum walk on a graph is the repeated application of a unitary evolution operator to a Hilbert space corresponding to the graph. Hitting times for discrete quantum walks on graphs give an average time before the walk…
We study the first hitting time statistics between a one-dimensional run-and-tumble particle and a target site that switches intermittently between visible and invisible phases. The two-state dynamics of the target is independent of the…
Discrete quantum walks are dynamical protocols for controlling a single quantum particle. Despite of its simplicity, quantum walks display rich topological phenomena and provide one of the simplest systems to study and understand…