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

Journal of Physics Conference Series

Quantum walks of two interacting particles on percolation graphs

Ilaria Siloi, Claudia Benedetti, Enrico Piccinini, Matteo G. A. Paris, Paolo Bordone

Published Oct 1, 2017• 2 citations
Publisher

Abstract

We address the dynamics of two indistinguishable interacting particles moving on a dynamical percolation graph, i.e., a graph where the edges are independent random telegraph processes whose values jump between 0 and 1, thus mimicking percolation. The interplay between the particle interaction strength, initial state and the percolation rate determine different dynamical regimes for the walkers. We show that, whenever the walkers are initially localised within the interaction range, fast noise enhances the particle spread compared to the noiseless case.

DOI
10.1088/1742-6596/906/1/012017

Related papers

Noisy quantum walks of two indistinguishable interacting particles

Ilaria Siloi, Claudia Benedetti, Enrico Piccinini +4 more

We investigate the dynamics of continuous-time two-particle quantum walks on a one-dimensional noisy lattice. Depending on the initial condition, we show how the interplay between particle indistinguishability and interaction determines distinct propagation regimes. A realistic model for the environment is considered by introducing non-Gaussian noise as time-dependent fluctuations of the tunneling amplitudes between adjacent sites. We observe that the combined effect of particle interaction and fast noise (weak coupling with the environment) provides a faster propagation compared to the noiseless case. This effect can be understood in terms of the band structure of the Hubbard model, and a detailed analysis as a function of both noise and system parameters is presented.

arXiv:1610.04180•Physical Review A•Feb 6, 2017•28 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•52 citations

Continuous-time quantum walks on spatially correlated noisy lattices

Matteo A. C. Rossi, Claudia Benedetti, Massimo Borrelli +2 more

We address memory effects and diffusive properties of a continuous-time quantum walk on a one-dimensional percolation lattice affected by spatially correlated random telegraph noise. In particular, by introducing spatially correlated time-dependent fluctuations in nearest-neighbor hopping amplitudes, we describe random domains characterized by global noise. The resulting open dynamics of the walker is then unraveled by an ensemble average over all the noise realizations. Our results show that time-dependent noise assisted by spatial correlations leads to strong memory effects in the walker dynamics and to robust diffusive behavior against the detrimental action of uncorrelated noise. We also show that spatially correlated classical noise enhances localization breaking, thus making a quantum particle spread on longer distances across the lattice.

arXiv:1707.01441•Physical Review A•Oct 4, 2017•27 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•30 citations

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

Zoltán Darázs, Tamás Kiss

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.

arXiv:1211.3550•Journal of Physics A Mathematical and Theoretical•Aug 29, 2013•18 citations

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

Z. Darázs, T. Kiss

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 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 numerical simulations of the phenomena for different graphs. We also analyze the effect of finite step-size on the evolution.

•Jan 1, 2013•13 citations
We address the dynamics of two indistinguishable interacting particles moving on a dynamical percolation graph, i.e., a graph where the edges are independent random telegraph processes whose values jump between 0 and 1, thus mimicking percolation. The interplay between the particle interaction strength, initial state and the percolation rate determine different dynamical regimes for the walkers. We show that, whenever the walkers are initially localised within the interaction range, fast noise enhances the particle spread compared to the noiseless case.
We investigate the dynamics of continuous-time two-particle quantum walks on a one-dimensional noisy lattice. Depending on the initial condition, we show how the interplay between particle indistinguishability and interaction determines distinct propagation regimes. A realistic model for the environment is considered by introducing non-Gaussian noise as time-dependent fluctuations of the tunneling amplitudes between adjacent sites. We observe that the combined effect of particle interaction and fast noise (weak coupling with the environment) provides a faster propagation compared to the noiseless case. This effect can be understood in terms of the band structure of the Hubbard model, and a detailed analysis as a function of both noise and system parameters is presented.
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.
We address memory effects and diffusive properties of a continuous-time quantum walk on a one-dimensional percolation lattice affected by spatially correlated random telegraph noise. In particular, by introducing spatially correlated time-dependent fluctuations in nearest-neighbor hopping amplitudes, we describe random domains characterized by global noise. The resulting open dynamics of the walker is then unraveled by an ensemble average over all the noise realizations. Our results show that time-dependent noise assisted by spatial correlations leads to strong memory effects in the walker dynamics and to robust diffusive behavior against the detrimental action of uncorrelated noise. We also show that spatially correlated classical noise enhances localization breaking, thus making a quantum particle spread on longer distances across the lattice.
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 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.
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 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 numerical simulations of the phenomena for different graphs. We also analyze the effect of finite step-size on the evolution.