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:2604.00908

Quantum walk on a random comb

François David, Thordur Jonsson

quant-phcond-mat.dis-nnmath-phSubmitted Apr 1, 2026• Announced Apr 2, 2026• 0 citations
v1 · Apr 1, 2026v2 · Jul 2, 2026
arXivHTMLPDF

Abstract

We study continuous time quantum walk on a random comb graph with infinite teeth. Due to localization effects along the spine, the walk cannot go to infinity in the spine direction, while it can escape to infinity along the teeth of the comb. Starting from an initial vertex the walk has a nonzero probability to stay trapped in a finite region. These results are obtained by studying the spectrum and eigenstates of the random Hamiltonian for the graph and analysing its properties. We use both analytic and numerical methods many of which come from the theory of Anderson localization in one dimension.

Comments
82 pages, 18 figures

Related papers

Quantum walk on a comb with infinite teeth

François David, Thórdur Jónsson

Abstract We study continuous time quantum walk on a comb with infinite teeth and show that the return probability to the starting point decays with time t as t −1 . We analyse the diffusion along the spine and into the teeth and show that the walk can escape into the teeth with a finite probability and goes to infinity along the spine with a finite probability. The walk along the spine and into the teeth behaves qualitatively as a quantum walk on a line. This behaviour is quite different from that of classical random walk on the comb.

arXiv:2107.08866•Journal of Physics A Mathematical and Theoretical•Jan 6, 2022•1 citation

Localization, delocalization, and topological phase transitions in the one-dimensional split-step quantum walk

Tibor Rakovszky, János K. Asbóth

Quantum walks are promising for information processing tasks because in regular graphs they spread quadratically more rapidly than random walks. Static disorder, however, can turn the tables: unlike random walks, quantum walks can suffer Anderson localization, with their wave function staying within a finite region even in the infinite time limit, with a probability exponentially close to 1. It is thus important to understand when a quantum walk will be Anderson localized and when we can expect it to spread to infinity even in the presence of disorder. In this work we analyze the response of a one-dimensional quantum walk---the split-step walk---to different forms of static disorder. We find that introducing static, symmetry-preserving disorder in the parameters of the walk leads to Anderson localization. In the completely disordered limit, however, a delocalization transition occurs, and the walk spreads subdiffusively to infinity. Using an efficient numerical algorithm, we calculate the bulk topological invariants of the disordered walk and find that the disorder-induced Anderson localization and delocalization transitions are governed by the topological phases of the quantum walk.

arXiv:1505.04513•Physical Review A•Nov 10, 2015•63 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

Localization in quantum walks on a honeycomb network

Changyuan Lyu, Luyan Yu, Shengjun Wu

We systematically study the localization effect in discrete-time quantum walks on a honeycomb network and establish the mathematical framework. We focus on the Grover walk first and rigorously derive the limit form of the walker's state, showing it has a certain probability to be localized at the starting position. The relationship between localization and the initial coin state is concisely represented by a linear map. We also define and calculate the average probability of localization by generating random initial states. Further, coin operators varying with positions are considered and the sufficient condition for localization is discussed. We also similarly analyze another four-state Grover walk. Theoretical predictions are all in accord with numerical simulation results. Finally, our results are compared with previous works to demonstrate the unusual trapping effect of quantum walks on a honeycomb network, as well as the advantages of our method.

arXiv:1509.03919•Physical Review A•Nov 5, 2015•20 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

Anderson localization in 1-D quantum random walk

A. N. Bondarenko, Дедок Василий Александрович

In this paper we intend to present some new results concerning two quantum models: quantum scattering model and discrete quantum random walk. We present the analytical solution of the 1D quantum random walk and give an explicit formula of the quantum return probability. The exact solution provides weak Anderson localization in discrete quantum random walk theory. Connectivity between these theories is introduced.

Russian-Korean International Symposium on Science and Technology (KORUS)•Oct 4, 2006•2 citations
We study continuous time quantum walk on a random comb graph with infinite teeth. Due to localization effects along the spine, the walk cannot go to infinity in the spine direction, while it can escape to infinity along the teeth of the comb. Starting from an initial vertex the walk has a nonzero probability to stay trapped in a finite region. These results are obtained by studying the spectrum and eigenstates of the random Hamiltonian for the graph and analysing its properties. We use both analytic and numerical methods many of which come from the theory of Anderson localization in one dimension.
Abstract We study continuous time quantum walk on a comb with infinite teeth and show that the return probability to the starting point decays with time t as t −1 . We analyse the diffusion along the spine and into the teeth and show that the walk can escape into the teeth with a finite probability and goes to infinity along the spine with a finite probability. The walk along the spine and into the teeth behaves qualitatively as a quantum walk on a line. This behaviour is quite different from that of classical random walk on the comb.
Quantum walks are promising for information processing tasks because in regular graphs they spread quadratically more rapidly than random walks. Static disorder, however, can turn the tables: unlike random walks, quantum walks can suffer Anderson localization, with their wave function staying within a finite region even in the infinite time limit, with a probability exponentially close to 1. It is thus important to understand when a quantum walk will be Anderson localized and when we can expect it to spread to infinity even in the presence of disorder. In this work we analyze the response of a one-dimensional quantum walk---the split-step walk---to different forms of static disorder. We find that introducing static, symmetry-preserving disorder in the parameters of the walk leads to Anderson localization. In the completely disordered limit, however, a delocalization transition occurs, and the walk spreads subdiffusively to infinity. Using an efficient numerical algorithm, we calculate the bulk topological invariants of the disordered walk and find that the disorder-induced Anderson localization and delocalization transitions are governed by the topological phases of the quantum walk.
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 systematically study the localization effect in discrete-time quantum walks on a honeycomb network and establish the mathematical framework. We focus on the Grover walk first and rigorously derive the limit form of the walker's state, showing it has a certain probability to be localized at the starting position. The relationship between localization and the initial coin state is concisely represented by a linear map. We also define and calculate the average probability of localization by generating random initial states. Further, coin operators varying with positions are considered and the sufficient condition for localization is discussed. We also similarly analyze another four-state Grover walk. Theoretical predictions are all in accord with numerical simulation results. Finally, our results are compared with previous works to demonstrate the unusual trapping effect of quantum walks on a honeycomb network, as well as the advantages of our method.
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.