Recurrence in discrete-time quantum stochastic walks
arXiv:2501.08674 · doi:10.22331/q-2026-01-22-1982
Abstract
Interplay between quantum interference and classical randomness can enhance performance of various quantum information tasks. In the present paper we analyze recurrence phenomena in the discrete-time quantum stochastic walk on a line, which is a quantum stochastic process that interpolates between quantum and classical walk dynamics. Surprisingly, we find that introducing classical randomness can reduce the recurrence probability -- despite the fact that the classical random walk returns with certainty -- and we identify the conditions under which this intriguing phenomenon occurs. Numerical evaluation of the first-return generating function allows us to investigate the asymptotics of the return probability as the step number approaches infinity. This provides strong evidence that the suppression of recurrence probability is not a transient effect but a robust feature of the underlying quantum-classical interplay in the asymptotic limit. Our results show that for certain tasks discrete-time quantum stochastic walks outperform both classical random walks and unitary quantum walks.
References in corpus (52)
- Error mitigation for short-depth quantum circuits
- A Quantum Random Walk Search Algorithm
- Spatial search by quantum walk
- Efficient variational quantum simulator incorporating active error minimisation
- Observation of topologically protected bound states in a one dimensional photonic system
- Noise tailoring for scalable quantum computation via randomized compiling
- A random compiler for fast Hamiltonian simulation
- Quantum speedup of Monte Carlo methods
- Controlling discrete quantum walks: coins and intitial states
- Weak limits for quantum random walks
- Decoherence can be useful in quantum walks
- Scalable error mitigation for noisy quantum circuits produces competitive expectation values
- Symmetries, Topological Phases and Bound States in the One-Dimensional Quantum Walk
- Hitting time for quantum walks on the hypercube
- Recurrence for discrete time unitary evolutions
- Quantum stochastic walks: A generalization of classical random walks and quantum walks
- Recurrence and Pólya number of quantum walks
- Optimized quantum random-walk search algorithms
- Fast Escape from Quantum Mazes in Integrated Photonics
- Quantum walks with infinite hitting times
- A randomized quantum algorithm for statistical phase estimation
- Detection of a quantum particle on a lattice under repeated projective measurements
- First detected arrival of a quantum walker on an infinite line
- Measuring Topological Invariants in Disordered Discrete Time Quantum Walks
- Scalable randomized benchmarking of quantum computers using mirror circuits
- Quantum recurrence of a subspace and operator-valued Schur functions
- Restart expedites quantum walk hitting times
- Quadratic speedup for spatial search by continuous-time quantum walk
- Experimental Implementation of Quantum Walks on IBM Quantum Computers
- Bulk-edge correspondence of one-dimensional quantum walks
- QFold: Quantum Walks and Deep Learning to Solve Protein Folding
- Probing Measurement Induced Effects in Quantum Walks via Recurrence
- Combinatorial optimisation via highly efficient quantum walks
- Large fluctuations of the first detected quantum return time
- Quantum search with hybrid adiabatic-quantum walk algorithms and realistic noise
- Predicting quantum advantage by quantum walk with convolutional neural networks
- Quantum Reinforcement Learning: the Maze problem
- From classical to quantum walks with stochastic resetting on networks
- Thermodynamic formalism for dissipative quantum walks
- Pólya number of continuous-time quantum walks
- Qubit-Efficient Randomized Quantum Algorithms for Linear Algebra
- Unitary Equivalence of Quantum Walks
- Efficient implementation of discrete-time quantum walks on quantum computers
- Testing quantum speedups in exciton transport through a photosynthetic complex using quantum stochastic walks
- Quantum circuits for the realization of equivalent forms of one-dimensional discrete-time quantum walks on near-term quantum hardware
- Decoherence enhances performance of quantum walks applied to graph isomorphism testing
- Implementation of quantum stochastic walks for function approximation, two-dimensional data classification, and sequence classification
- Quantum State Discrimination on Reconfigurable Noise-Robust Quantum Networks
- Conditional limit measure of one-dimensional quantum walk with absorbing sink
- Resolving degeneracies in Google search via quantum stochastic walks
- Dynamical Phase Transitions in Open Quantum Walks
- Monitored Recurrence of a One-parameter Family of Three-state Quantum Walks