Hitting Reset After a Quantum Measurement

R. W. Rendell, Michael Steiner

Jan Wójcik

Mean squared displacement has been widely used as the primary metric for comparing quantum and classical random walks, with quantum walks showing quadratic scaling versus linear scaling for classical walks. However, this comparison may not capture the full picture: while the mean squared displacement is well suited for Gaussian distributions, quantum walk distributions exhibit distinctly non-Gaussian features. We propose that the mean hitting time offers a complementary perspective with clear operational meaning for search algorithms. Through analytical calculations, we show that quantum and classical walks yield identical MHT for symmetric initial conditions with two detectors, suggesting that the apparent quantum advantage seen in MSD comparisons may be context dependent. Interestingly, introducing stochastic resetting reveals more dynamics. We demonstrate analytically that quantum walks can achieve reduced MHT under stochastic reset through quasimomentum redistribution, while classical walks see no benefit. This quantum advantage naturally degrades with noise, and the quantum walk converges to classical behavior. We suggest that MHT reduction under stochastic reset can serve as an additional signature of quantum behavior, particularly useful for characterizing quantum walk implementations on noisy quantum devices. Our results indicate that different metrics can reveal different aspects of quantum-classical comparisons in walk-based algorithms.

Martin Varbanov, Hari Krovi, Todd A. Brun

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 $\ensuremath{\lambda}$. From this definition we derive an explicit formula for the hitting time, and explore its dependence on the measurement rate. As the measurement rate goes to either 0 or infinity the hitting time diverges; the first divergence reflects the weakness of the measurement, while the second limit results from the quantum zeno effect. Continuous-time quantum walks, like discrete-time quantum walks but unlike classical random walks, can have infinite hitting times. We present several conditions for existence of infinite hitting times, and discuss the connection between infinite hitting times and graph symmetry.

W. E. Lawrence

Shenggang Ying, Mingsheng Ying

Quantum walks are very useful tools in designing quantum algorithms. Amplitude amplification is a key technique to increase the success probability of a quantum-walk-based algorithm, and it is quadratically faster than classical probabilistic amplification. However, amplitude amplification only applies to quantum walks with one-shot hitting time, where no measurements except a final one are performed, and not to quantum walks with concurrent hitting time, where measurements happen or absorbing boundaries exist at each step. In this paper, we propose a procedure to modify quantum walks with concurrent hitting time by removing measurements from them. This procedure enables us to use amplitude amplification to design algorithms based on the modified quantum walks which are faster than those based on the original walks with a concurrent hitting time and more robust than those based on the corresponding walks with a one-shot hitting time.

William George Unruh