arXiv:2008.00510 · Physical review. E

From classical to quantum walks with stochastic resetting on networks

Sascha Wald, Lucas Böttcher

Published Jan 19, 2021• 28 citations

Abstract

Random walks are fundamental models of stochastic processes with applications in various fields, including physics, biology, and computer science. We study classical and quantum random walks under the influence of stochastic resetting on arbitrary networks. Based on the mathematical formalism of quantum stochastic walks, we provide a framework of classical and quantum walks whose evolution is determined by graph Laplacians. We study the influence of quantum effects on the stationary and long-time average probability distribution by interpolating between the classical and quantum regime. We compare our analytical results on stationary and long-time average probability distributions with numerical simulations on different networks, revealing differences in the way resets affect the sampling properties of classical and quantum walks.

DOI: 10.1103/physreve.103.012122

Related papers

Random Walks: A Review of Algorithms and Applications

Feng Xia, Jiaying Liu, Hansong Nie +3 more

A random walk is known as a random process which describes a path including a succession of random steps in the mathematical space. It has increasingly been popular in various disciplines such as mathematics and computer science. Furthermore, in quantum mechanics, quantum walks can be regarded as quantum analogues of classical random walks. Classical random walks and quantum walks can be used to calculate the proximity between nodes and extract the topology in the network. Various random walk related models can be applied in different fields, which is of great significance to downstream tasks such as link prediction, recommendation, computer vision, semi-supervised learning, and network embedding. In this article, we aim to provide a comprehensive review of classical random walks and quantum walks. We first review the knowledge of classical random walks and quantum walks, including basic concepts and some typical algorithms. We also compare the algorithms based on quantum walks and classical random walks from the perspective of time complexity. Then we introduce their applications in the field of computer science. Finally we discuss the open issues from the perspectives of efficiency, main-memory volume, and computing time of existing algorithms. This study aims to contribute to this growing area of research by exploring random walks and quantum walks together.

arXiv:2008.03639IEEE Transactions on Emerging Topics in Computational IntelligenceNov 25, 2019295 citations

Discrete-time walk on one-dimensional lattice under stochastic resetting: Advantage of quantum over classical scenario

Przemysław Chełminiak, Jan Wójcik, Antoni Wójcik

We investigate the effect of stochastic restart/resetting on discrete-time quantum walks concerning its impact on the meantime to absorption in the walk on the one-dimensional lattice terminated by a pair of totally absorbing sites. The two distinguished sites also play the role of an apparatus that detects the moment of time when a quantum walk reaches these boundaries. Our results reveal a notable difference between the quantum walk and its classical counterpart. Specifically, we focus on instances of classical random walks in which stochastic resetting fails to reduce the meantime to absorption. Conversely, we show that stochastic resetting can be utilized to effectively diminish the meantime to absorption in the quantum version of this walk. We relate the observed difference between quantum and classical cases to the fact that restarting the quantum state not only changes position distribution but inevitably changes complementary quasimomentum distribution.

Physical review. EApr 30, 20252 citations

Characterizing the Relationship Between Unitary Quantum Walks and Non-Homogeneous Random Walks

Matheus Guedes de Andrade, Franklin de Lima Marquezino, Daniel R. Figueiredo

Quantum walks on graphs are ubiquitous in quantum computing finding a myriad of applications. Likewise, random walks on graphs are a fundamental building block for a large number of algorithms with diverse applications. While the relationship between quantum and random walks has been recently discussed in specific scenarios, this work establishes a formal equivalence between the two processes on arbitrary finite graphs and general conditions for shift and coin operators. It requires empowering random walks with time heterogeneity, where the transition probability of the walker is non-uniform and time dependent. The equivalence is obtained by equating the probability of measuring the quantum walk on a given node of the graph and the probability that the random walk is at that same node, for all nodes and time steps. The first result establishes procedure for a stochastic matrix sequence to induce a random walk that yields the exact same vertex probability distribution sequence of any given quantum walk, including the scenario with multiple interfering walkers. The second result establishes a similar procedure in the opposite direction. Given any random walk, a time-dependent quantum walk with the exact same vertex probability distribution is constructed. Interestingly, the matrices constructed by the first procedure allows for a different simulation approach for quantum walks where node samples respect neighbor locality and convergence is guaranteed by the law of large numbers, enabling efficient (polynomial-time) sampling of quantum graph trajectories. Furthermore, the complexity of constructing this sequence of matrices is discussed in the general case.

Jun 29, 20210 citations

Advances in Random and Quantum Walks: Bridging Classical and Quantum Computational Paradigms

Anurag Soni, Akhtar Rasool, Dhirendra Pratap Singh

In the world of computational probing, random walks and quantum walks are two separate but tightly linked paradigms. Classical stochastic processes like random walks are based on the random movement of particles in mathematical space and have been extensively used in data mining, network analysis, computer vision, etc. Quantum walks, by contrast generalize random walks into the quantum realm, taking the benefit of the quantum superposition and interference in order to investigate multiple paths at the same time. Quantum walks provide significant potential for algorithmic development: in quantum computing and communication, and in Scientific modelling and simulation. This paper provides an in-depth survey of random walks and quantum walks, outlining historical context, fundamental principles, applications, challenges, and future prospects. In this paper, motivated by the abstractness of both random walks and quantum walks, we survey the field of computational exploration at large scales, coalescing the myriad notions and difficult challenges addressed by existing research efforts on random and quantum walks, inferring a nuanced and multifaceted view on how both random walks and quantum walks are involved in paving the way to future development in many fields.

Procedia Computer ScienceJan 1, 20251 citation

Recurrence in discrete-time quantum stochastic walks

M. Štefaňák, Václav Potoček, İ. Yalçınkaya +2 more

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.

arXiv:2501.08674QuantumJan 22, 20262 citations

Stochastic resetting induces quantum non-Markovianity

Federico Carollo, Sascha Wald

Stochastic resetting describes dynamics which are reinitialized to a reference state at random times. These protocols are attracting significant interest: they can stabilize nonequilibrium stationary states, generate correlations in noninteracting systems, and enable optimal search strategies. While a constant reset probability results in a Markovian dynamics, much less is known about non-Markovian effects in quantum stochastic resetting. Here, we analyze memory effects in these processes -- examining the evolution of quantum states and of observables -- through witnesses of non-Markovianity for open quantum systems. We focus on discrete-time reset processes, which are of particular interest as they can be implemented on existing gate-operated quantum devices. We show that these processes are generically described by non-divisible maps and, in non-classical scenarios where the effective reset probability can become negative, can feature revivals in the state distinguishability. Our results reveal non-Markovian effects in quantum stochastic resetting and show that a time-dependent reset may be exploited to engineer enhanced stationary quantum correlations.

quant-pharXiv:2601.13367Jan 21, 20260 citations