Accelerated first detection in discrete-time quantum walks using sharp restarts
arXiv:2411.09477 · doi:10.1103/PhysRevResearch.7.023069
Abstract
Restart is a common strategy observed in nature that accelerates first-passage processes and has been extensively studied using classical random walks. In the quantum regime, restart in continuous-time quantum walks (CTQWs) has been shown to expedite the quantum hitting times. Here, we study how restarting monitored discrete-time quantum walks (DTQWs) affects the quantum hitting times. We show that the restarted DTQWs outperform classical random walks in target searches, benefiting from quantum ballistic propagation, a feature shared with their continuous-time counterparts. Moreover, the explicit coin degree of freedom in DTQWs allows them to surpass even CTQWs in target detection without sacrificing any quantum advantage. Additionally, knowledge of the target's parity or position relative to the origin can be leveraged to tailor DTQWs for even faster searches. Our study paves the way for more efficient use of DTQWs in quantum-walk-based search algorithms, simulations and modeling of quantum transport towards targeted sites in complex quantum networks.
6 pages, 8 figures
References in corpus (43)
- Quantum Computation and Decision Trees
- Environment-Assisted Quantum Walks in Photosynthetic Energy Transfer
- A Quantum Random Walk Search Algorithm
- Anderson localization and nonlinearity in one dimensional disordered photonic lattices
- Quantum walks: a comprehensive review
- Diffusion with Stochastic Resetting
- Photons Walking the Line: A quantum walk with adjustable coin operations
- Realization of a quantum walk with one and two trapped ions
- Discrete single-photon quantum walks with tunable decoherence
- Diffusion with Optimal Resetting
- First Passage Under Restart
- Continuous-Time Quantum Walks: Models for Coherent Transport on Complex Networks
- Experimental Implementation of Discrete Time Quantum Random Walk on an NMR Quantum Information Processor
- Diffusion with resetting in arbitrary spatial dimension
- The Michaelis-Menten reaction scheme as a unified approach towards the optimal restart problem
- Stochastic resetting: A (very) brief review
- Recurrence and Pólya number of quantum walks
- Quantum walks with infinite hitting times
- Simplicity of Completion Time Distributions for Common Complex Biochemical Processes
- Detection of a quantum particle on a lattice under repeated projective measurements
- Quantum walks: the first detected passage time problem
- Recurrence properties of unbiased coined quantum walks on infinite -dimensional lattices
- First detected arrival of a quantum walker on an infinite line
- First passage under restart for discrete space and time: application to one dimensional confined lattice random walks
- Restart expedites quantum walk hitting times
- Chemical continuous time random walks
- Two-component Dirac-like Hamiltonian for generating quantum walk on one-, two- and three-dimensional lattices
- Specificity and Completion Time Distributions of Biochemical Processes
- Experimental realization of a momentum-space quantum walk
- Simulating Dirac Hamiltonian in Curved Space-time by Split-step Quantum Walk
- Dynamics and energy spectra of aperiodic discrete-time quantum walks
- Dark states of quantum search cause imperfect detection
- Lattice quantum magnetometry
- Bounds on the dynamics of periodic quantum walks and emergence of the gapless and gapped Dirac equation
- Measurement induced quantum walks on an IBM Quantum Computer
- Uncertainty and symmetry bounds for the quantum total detection probability
- Measurement induced quantum walks
- Instability in the quantum restart problem
- Discrete-time quantum walks on one-dimensional lattices
- Quantum magnetometry using discrete-time quantum walk
- Tail-behavior roadmap for sharp restart
- Multi-qubit quantum computing using discrete-time quantum walks on closed graphs
- Quantum-walk search in motion