arXiv:2502.19355

Extreme Events of Quantum Walks on Graphs

Vyas, Nisarg, M. S. Santhanam

Published Feb 26, 2025• 0 citations

Abstract

Due to the unitary evolution, quantum walks display different dynamical features from that of classical random walks. In contrast to this expectation, in this work, we show that extreme events can arise in unitary dynamics and its properties are qualitatively similar to that of random walks. We consider quantum walks on a ring lattice and a scale-free graph. Firstly, we obtain quantum version of flux-fluctuation relation and use this to define to extreme events on vertices of a graph as exceedences above the mean flux. The occurrence probability for extreme events on scale-free graphs displays a power-law with the degree of vertices, in qualitative agreement with corresponding classical random walk result. For both classical and quantum walks, the extreme event probability is larger for small degree nodes compared to hubs on the graph. Further, it is shown that extreme event probability scales with threshold used to define extreme events.

DOI: 10.48550/arxiv.2502.19355

Related papers

Extreme events of quantum walks on networks

Nisarg Vyas, M. S. Santhanam

Extreme events are the ones for which the magnitude of the event is much larger than its typical values. They have been extensively investigated on classical dynamical and stochastic processes on networks. In this work, in analogy with well-studied extreme events of random walks, the extreme events of quantum walks on regular lattices, a scale-free network, and Erdős-Rényi network are studied. Due to unitary quantum evolution, the quantum walk dynamics usually differs from that of the classical random walks, and hence we expect extreme event properties to be different in classical and quantum settings. In contrast to this expectation, we report that extreme events of phase coherent quantum walks are qualitatively similar to that of classical random walks. We show that this counterintuitive behavior originates from the dominance of nodal fluctuations over internode correlations in disordered network structures. In particular, the occurrence probability for extreme events on scale-free and Erdős-Rényi networks displays a decaying power law with the degree of nodes. That is, the extreme event probability is larger for small degree nodes compared to the hubs on the network, in qualitative agreement with corresponding classical random walk results. Further, it is shown that extreme event probability scales with the threshold used to define extreme events.

Physical review. EMar 13, 20260 citations

Flux-fluctuation relation for quantum walks on networks

Nisarg Vyas, M. S. Santhanam

For classical random walks on networks, the flux-fluctuation relation is an important characteristic that relates the mean flux and strength of fluctuations on the nodes. It was extensively studied before, although equivalent relations for quantum walks on networks remain unknown. In this work, a quantum version of the flux-fluctuation relation is obtained. It is valid for quantum walks on an arbitrary network, subject to the condition that the spectrum of the unitary walk operator is nondegenerate. Remarkably, for phase coherent quantum walks, the quantum flux-fluctuation relation is qualitatively similar to its classical counterpart, and quantum effects are insignificant. We numerically simulate quantum walks on periodic lattices and scale-free and Erdős-Rényi networks, and the results are consistent with the analytical quantum flux-fluctuation relation. We discuss the implications for the quantum walk dynamics if the spectrum of the unitary walk operator violate the nondegeneracy condition.

Physical review. EJan 2, 20261 citation

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

Continuous-time quantum walks on the threshold network model

YUSUKE IDE, Norio Konno

It is well known that many real world networks have a power-law degree distribution (the scale-free property). However, there are no rigorous results for continuous-time quantum walks on such realistic graphs. In this paper, we analyse the space–time behaviour of continuous-time quantum walks and random walks on the threshold network model, which is a reasonable candidate model having the scale-free property. We show that the quantum walker exhibits localisation at the starting point, although the random walker tends to spread uniformly.

arXiv:1003.0055Mathematical Structures in Computer ScienceNov 8, 20108 citations

QUANTUM RANDOM WALK ON FRACTALS

Kai Zhao

Quantum walks are the quantum mechanical analogue of classical random walks. Discrete-time quantum walks have been introduced and studied mostly on the line Z or higher dimensional space Z d but rarely defined on graphs with fractal dimensions because the coin operator depends on the position and the Fourier transform on the fractals is not defined. Inspired by its nature of classical walks, different quantum walks will be defined by choosing different shift and coin operators. When the coin operator is uniform, the results of classical walks will be obtained upon measurement at each step. Moreover, with measurement at each step, our results reveal more information about the classical random walks. In this dissertation, two graphs with fractal dimensions will be considered. The first one is Sierpinski gasket, a degree-4 regular graph with Hausdorff di- mension of df = ln 3/ ln 2. The second is the Cantor graph derived like Cantor set, with Hausdorff dimension of df = ln 2/ ln 3. The definitions and amplitude functions of the quantum walks will be introduced. The main part of this dissertation is to derive a recursive formula to compute the amplitude Green function. The exiting probability will be computed and compared with the classical results. When the generation of graphs goes to infinity, the recursion of the walks will be investigated and the convergence rates will be obtained and compared with the classical counterparts.

Jan 1, 20180 citations

Quantum walks can unitarily match random walks on finite graphs

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

Quantum and random walks were proven to be equivalent on finite graphs by demonstrating how to construct a time-dependent random walk sharing the exact same evolution of vertex probability of any given discrete-time coined quantum walk. Such equivalence stipulated a deep connection between the processes that is far stronger than simply considering quantum walks as quantum analogues of random walks. This article expands on the connection between quantum and random walks by demonstrating a procedure that constructs a time-dependent quantum walk matching the evolution of vertex probability of any given random walk in a unitary way. It is a trivial fact that a quantum walk measured at all time steps of its evolution degrades to a random walk. More interestingly, the method presented describes a quantum walk that matches a random walk without measurement operations, such that the unitary evolution of the quantum walk captures the probability evolution of the random walk. The construction procedure is general, covering both homogeneous and non-homogeneous random walks. For the homogeneous random walk case, the properties of unitary evolution imply that the quantum walk described is time-dependent since homogeneous quantum walks do not converge for arbitrary initial conditions

Mar 11, 20211 citation