Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1211.3550 · Journal of Physics A Mathematical and Theoretical

Time evolution of continuous-time quantum walks on dynamical percolation graphs

Z. Darázs, T. Kiss

Published Aug 29, 2013• 20 citations
arXivHTMLPDF

Abstract

We study the time evolution of continuous-time quantum walks on randomly changing graphs. At certain moments, edges of the graph appear or disappear with a given probability, as in percolation. We treat this problem in a strong noise limit. We focus on the case when the time interval between the subsequent changes of the graph tends to zero. We derive explicit formulae for the general evolution in this limit. We find that the percolation in this limit causes an effective time rescaling. Independently of the graph and the initial state of the walk, the time is rescaled by the probability of keeping an edge. Both the individual trajectories for a single system and average properties with a superoperator formalism are discussed. We give an analytical proof for our theorem and we also present results from the numerical simulations of the phenomena for different graphs. We also analyze the effect of finite step-size on the evolution.

DOI
10.1088/1751-8113/46/37/375305

Related papers

Discrete time quantum walks on percolation graphs

Bálint Kollár, Jaroslav Novotný, T. Kiss +1 more

Randomly breaking connections in a graph alters its transport properties, a model used to describe percolation. In the case of quantum walks, dynamic percolation graphs represent a special type of imperfections, where the connections appear and disappear randomly in each step during the time evolution. The resulting open system dynamics is hard to treat numerically in general. We shortly review the literature on this problem. We then present our method to solve the evolution on finite percolation graphs in the long time limit, applying the asymptotic methods concerning random unitary maps. We work out the case of one-dimensional chains in detail and provide a concrete, step-by-step numerical example in order to give more insight into the possible asymptotic behavior. The results about the case of the two-dimensional integer lattice are summarized, focusing on the Grover-type coin operator.

arXiv:1404.4509•The European Physical Journal Plus•May 1, 2014•18 citations

Short-time behavior of continuous-time quantum walks on graphs

Balázs Endre Szigeti, Gábor Homa, Zoltán Zimborás +1 more

Dynamical evolution of systems with sparse Hamiltonians can always be recognized as continuous-time quantum walks (CTQWs) on graphs. In this paper, we analyze the short-time asymptotics of CTQWs. In recent studies, it was shown that for the classical diffusion process the short-time asymptotics of the transition probabilities follows power laws whose exponents are given by the usual combinatorial distances of the nodes. Inspired by this result, we perform a similar analysis for CTQWs in both closed and open systems, including time-dependent couplings. For time-reversal symmetric coherent quantum evolutions, the short-time asymptotics of the transition probabilities is completely determined by the topology of the underlying graph analogously to the classical case, but with a doubled power-law exponent. Moreover, this result is robust against the introduction of on-site potential terms. However, we show that time-reversal symmetry-breaking terms and noncoherent effects can significantly alter the short-time asymptotics. The analytical formulas are checked against numerics, and excellent agreement is found. Furthermore, we discuss in detail the relevance of our results for quantum evolutions on particular network topologies.

arXiv:1905.03914•Physical Review A•Dec 16, 2019•5 citations

Coined quantum walks on percolation graphs

Godfrey Leung, Paul Knott, Joe Bailey +1 more

Quantum walks, both discrete (coined) and continuous time, form the basis of several quantum algorithms and have been used to model processes such as transport in spin chains and quantum chemistry. The enhanced spreading and mixing properties of quantum walks compared with their classical counterparts have been well studied on regular structures and also shown to be sensitive to defects and imperfections in the lattice. As a simple example of a disordered system, we consider percolation lattices, in which edges or sites are randomly missing, interrupting the progress of the quantum walk. We use numerical simulation to study the properties of coined quantum walks on these percolation lattices in one and two dimensions. In one dimension (the line), we introduce a simple notion of quantum tunnelling and determine how this affects the properties of the quantum walk as it spreads. On two-dimensional percolation lattices, we show how the spreading rate varies from linear in the number of steps down to zero as the percolation probability decreases towards the critical point. This provides an example of fractional scaling in quantum-walk dynamics.

arXiv:1006.1283•New Journal of Physics•Dec 9, 2010•49 citations

Asymptotic Dynamics of Coined Quantum Walks on Percolation Graphs

Bálint Kollár, T. Kiss, Jaroslav Novotný +1 more

Quantum walks obey unitary dynamics: they form closed quantum systems. The system becomes open if the walk suffers from imperfections represented as missing links on the underlying basic graph structure, described by dynamical percolation. Openness of the system's dynamics creates decoherence, leading to strong mixing. We present a method to analytically solve the asymptotic dynamics of coined, percolated quantum walks for a general graph structure. For the case of a circle and a linear graph we derive the explicit form of the asymptotic states. We find that a rich variety of asymptotic evolutions occur: not only the fully mixed state, but other stationary states; stable periodic and quasiperiodic oscillations can emerge, depending on the coin operator, the initial state, and the topology of the underlying graph.

arXiv:1204.6149•Physical Review Letters•Jun 5, 2012•53 citations

Continuous-time quantum walks on dynamical percolation graphs

Claudia Benedetti, Matteo A. C. Rossi, Matteo G. A. Paris

We address continuous-time quantum walks on graphs in the presence of time- and space-dependent noise. Noise is modeled as generalized dynamical percolation, i.e. , classical time-dependent fluctuations affecting the tunneling amplitudes of the walker. In order to illustrate the general features of the model, we review recent results on two paradigmatic examples: the dynamics of quantum walks on the line and the effects of noise on the performances of quantum spatial search on the complete and the star graph. We also discuss future perspectives, including extension to many-particle quantum walk, to noise model for on-site energies and to the analysis of different noise spectra. Finally, we address the use of quantum walks as a quantum probe to characterize defects and perturbations occurring in complex, classical and quantum, networks.

arXiv:1812.06676•Europhysics Letters (EPL)•Jan 4, 2019•27 citations

Properties of distribution and entanglement in discrete-time quantum walk with percolation

An Zhiyun, Zhi-Jian Li

We investigate one-dimensional discrete-time quantum walk on the line where the links between neighboring sites are randomly broken. Two link-broken ways, static percolation and dynamical percolation, are considered. The former means that the broken links are fixed in position space at each time step, while the latter is that broken links are varied with time step. Our attention focuses on the effects of these disorders on two physical quantities, the probability distribution and the entanglement between the coin degree of freedom and position degree of freedom. Choosing Hadamard coin operator and assuming the walker to start from the position eigenstate|0〉and attach itself to a coherent coin state 1/√2 (|↑〉+ i|↓〉), we give the statistical average results after making numerical calculations many times. The choices of coin operator and initial state, resulting in a symmetric probability distribution about origin in the ideal case, is helpful in comparing with different cases in different disorder strengths. It is shown that the probability distribution of static percolation quantum walk can change from a coherent behavior at short time to Anderson localization at longer time, while the dynamical percolation quantum walk can change to a classical diffusive behavior. With the decrease of the percolation probability, these transitions become faster. The entanglement for ideal case without disorder reaches a constant value after a short time evolution. The static percolation makes the entanglement less than that of ideal case and fluctuate irregularly around a certain value. The situation is very different for the dynamical percolation:the entanglement increases smoothly with the time step and can exceed the constant value in the ideal case at some time. Both of entanglements for two types of percolations decrease with reducing percolation probability. As a striking characteristic, the entanglement in dynamical case can tend to maximum regardless of percolation probability in long time limit, while the static case cannot. In the model for our study, the randomized unitary operations, induced by the static and dynamical percolations, can lead to some noticeable effects on the transport and entanglement of discrete time quantum walk. The results about the interplay between disorder and entanglement not only assist quantum information processing, but also give more options to further explore and understand disorder physical processes in nature.

Acta Physica Sinica•Jan 1, 2017•0 citations
We study the time evolution of continuous-time quantum walks on randomly changing graphs. At certain moments, edges of the graph appear or disappear with a given probability, as in percolation. We treat this problem in a strong noise limit. We focus on the case when the time interval between the subsequent changes of the graph tends to zero. We derive explicit formulae for the general evolution in this limit. We find that the percolation in this limit causes an effective time rescaling. Independently of the graph and the initial state of the walk, the time is rescaled by the probability of keeping an edge. Both the individual trajectories for a single system and average properties with a superoperator formalism are discussed. We give an analytical proof for our theorem and we also present results from the numerical simulations of the phenomena for different graphs. We also analyze the effect of finite step-size on the evolution.
Randomly breaking connections in a graph alters its transport properties, a model used to describe percolation. In the case of quantum walks, dynamic percolation graphs represent a special type of imperfections, where the connections appear and disappear randomly in each step during the time evolution. The resulting open system dynamics is hard to treat numerically in general. We shortly review the literature on this problem. We then present our method to solve the evolution on finite percolation graphs in the long time limit, applying the asymptotic methods concerning random unitary maps. We work out the case of one-dimensional chains in detail and provide a concrete, step-by-step numerical example in order to give more insight into the possible asymptotic behavior. The results about the case of the two-dimensional integer lattice are summarized, focusing on the Grover-type coin operator.
Dynamical evolution of systems with sparse Hamiltonians can always be recognized as continuous-time quantum walks (CTQWs) on graphs. In this paper, we analyze the short-time asymptotics of CTQWs. In recent studies, it was shown that for the classical diffusion process the short-time asymptotics of the transition probabilities follows power laws whose exponents are given by the usual combinatorial distances of the nodes. Inspired by this result, we perform a similar analysis for CTQWs in both closed and open systems, including time-dependent couplings. For time-reversal symmetric coherent quantum evolutions, the short-time asymptotics of the transition probabilities is completely determined by the topology of the underlying graph analogously to the classical case, but with a doubled power-law exponent. Moreover, this result is robust against the introduction of on-site potential terms. However, we show that time-reversal symmetry-breaking terms and noncoherent effects can significantly alter the short-time asymptotics. The analytical formulas are checked against numerics, and excellent agreement is found. Furthermore, we discuss in detail the relevance of our results for quantum evolutions on particular network topologies.
Quantum walks, both discrete (coined) and continuous time, form the basis of several quantum algorithms and have been used to model processes such as transport in spin chains and quantum chemistry. The enhanced spreading and mixing properties of quantum walks compared with their classical counterparts have been well studied on regular structures and also shown to be sensitive to defects and imperfections in the lattice. As a simple example of a disordered system, we consider percolation lattices, in which edges or sites are randomly missing, interrupting the progress of the quantum walk. We use numerical simulation to study the properties of coined quantum walks on these percolation lattices in one and two dimensions. In one dimension (the line), we introduce a simple notion of quantum tunnelling and determine how this affects the properties of the quantum walk as it spreads. On two-dimensional percolation lattices, we show how the spreading rate varies from linear in the number of steps down to zero as the percolation probability decreases towards the critical point. This provides an example of fractional scaling in quantum-walk dynamics.
Quantum walks obey unitary dynamics: they form closed quantum systems. The system becomes open if the walk suffers from imperfections represented as missing links on the underlying basic graph structure, described by dynamical percolation. Openness of the system's dynamics creates decoherence, leading to strong mixing. We present a method to analytically solve the asymptotic dynamics of coined, percolated quantum walks for a general graph structure. For the case of a circle and a linear graph we derive the explicit form of the asymptotic states. We find that a rich variety of asymptotic evolutions occur: not only the fully mixed state, but other stationary states; stable periodic and quasiperiodic oscillations can emerge, depending on the coin operator, the initial state, and the topology of the underlying graph.
We address continuous-time quantum walks on graphs in the presence of time- and space-dependent noise. Noise is modeled as generalized dynamical percolation, i.e. , classical time-dependent fluctuations affecting the tunneling amplitudes of the walker. In order to illustrate the general features of the model, we review recent results on two paradigmatic examples: the dynamics of quantum walks on the line and the effects of noise on the performances of quantum spatial search on the complete and the star graph. We also discuss future perspectives, including extension to many-particle quantum walk, to noise model for on-site energies and to the analysis of different noise spectra. Finally, we address the use of quantum walks as a quantum probe to characterize defects and perturbations occurring in complex, classical and quantum, networks.
We investigate one-dimensional discrete-time quantum walk on the line where the links between neighboring sites are randomly broken. Two link-broken ways, static percolation and dynamical percolation, are considered. The former means that the broken links are fixed in position space at each time step, while the latter is that broken links are varied with time step. Our attention focuses on the effects of these disorders on two physical quantities, the probability distribution and the entanglement between the coin degree of freedom and position degree of freedom. Choosing Hadamard coin operator and assuming the walker to start from the position eigenstate|0〉and attach itself to a coherent coin state 1/√2 (|↑〉+ i|↓〉), we give the statistical average results after making numerical calculations many times. The choices of coin operator and initial state, resulting in a symmetric probability distribution about origin in the ideal case, is helpful in comparing with different cases in different disorder strengths. It is shown that the probability distribution of static percolation quantum walk can change from a coherent behavior at short time to Anderson localization at longer time, while the dynamical percolation quantum walk can change to a classical diffusive behavior. With the decrease of the percolation probability, these transitions become faster. The entanglement for ideal case without disorder reaches a constant value after a short time evolution. The static percolation makes the entanglement less than that of ideal case and fluctuate irregularly around a certain value. The situation is very different for the dynamical percolation:the entanglement increases smoothly with the time step and can exceed the constant value in the ideal case at some time. Both of entanglements for two types of percolations decrease with reducing percolation probability. As a striking characteristic, the entanglement in dynamical case can tend to maximum regardless of percolation probability in long time limit, while the static case cannot. In the model for our study, the randomized unitary operations, induced by the static and dynamical percolations, can lead to some noticeable effects on the transport and entanglement of discrete time quantum walk. The results about the interplay between disorder and entanglement not only assist quantum information processing, but also give more options to further explore and understand disorder physical processes in nature.