Papers
Topics
Authors
Recent
2000 character limit reached

Restart expedites quantum walk hitting times (2205.01974v2)

Published 4 May 2022 in cond-mat.stat-mech and quant-ph

Abstract: 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 strategy eliminates the problem of dark states, i.e. cases where the particle evades detection, while maintaining the ballistic propagation which is important for fast search. We find profound effects of quantum oscillations on the restart problem, namely a type of instability of the mean detection time, and optimal restart times that form staircases, with sudden drops as the rate of sampling is modified. In the absence of restart and in the Zeno limit, the detection of the walker is not possible and we examine how restart overcomes this well-known problem, showing that the optimal restart time becomes insensitive to the sampling period.

Summary

We haven't generated a summary for this paper yet.

Whiteboard

Paper to Video (Beta)

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.