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

Chinese Physics B

Localization of quantum walks on finite graphs

Yang-Yi Hu, Ping‐Xing Chen

Published Nov 29, 2016• 0 citations
Publisher

Abstract

We analyze the localization of quantum walks on a one-dimensional finite graph using vector-distance. We first vectorize the probability distribution of a quantum walker in each node. Then we compute out the probability distribution vectors of quantum walks in infinite and finite graphs in the presence of static disorder respectively, and get the distance between these two vectors. We find that when the steps taken are small and the boundary condition is tight, the localization between the infinite and finite cases is greatly different. However, the difference is negligible when the steps taken are large or the boundary condition is loose. It means quantum walks on a one-dimensional finite graph may also suffer from localization in the presence of static disorder. Our approach and results can be generalized to analyze the localization of quantum walks in higher-dimensional cases.

DOI
10.1088/1674-1056/25/12/120303

Related papers

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

Anderson localization of a one-dimensional quantum walker

Stanislav Derevyanko

We study the evolution of a system performing a one-dimensional quantum walk in the presence of static phase disorder. The same model also describes the propagation of classical light pulses in photonic mesh lattices. We study the interplay between the coupling (i.e. the bias of the "quantum coin") and disorder. We provide an exact analytical expression for the localization length for two limiting cases of strong and weak phase disorder. In all the cases of interest we supply numerical simulations for participation ratio, Lyapunov exponent and the return probability as functions of the coupling parameter.

Scientific Reports•Jan 23, 2018•40 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, 2021•0 citations

Disorder-free localization in quantum walks

Burçin Danacı, İ. Yalçınkaya, Barış Çakmak +3 more

The phenomenon of localization usually happens due to the existence of disorder in a medium. Nevertheless, certain quantum systems allow dynamical localization solely due to the nature of internal interactions. We study a discrete time quantum walker which exhibits disorder-free localization. The quantum walker moves on a one-dimensional lattice and interacts with on-site spins by coherently rotating them around a given axis at each step. Since the spins do not have dynamics of their own, the system poses the local spin components along the rotation axis as an extensive number of conserved moments. When the interaction is weak, the spread of the walker shows subdiffusive behavior having downscaled ballistic tails in the evolving probability distribution at intermediate timescales. However, as the interaction gets stronger the walker gets completely localized in total absence of disorder in both lattice and initial state. Using a matrix-product-state ansatz, we investigate the relaxation and entanglement dynamics of the on-site spins due to their coupling with the quantum walker. Surprisingly, we find that, even in the delocalized regime, entanglement growth and relaxation occur slowly, unlike majority of the other models displaying a localization transition.

arXiv:2009.04571•Physical Review A•Feb 15, 2021•16 citations

Localization of quantum walks on a deterministic recursive tree

X. P. Xu

Localization of quantum walks can be characterized by the return probability, i.e., the probability for the walker returning to its original site. In this paper, we consider localization of continuous-time quantum walks in terms of return probability on a deterministic recursive tree, which is generated by adding one node and connecting it to each node of the existing tree recursively. We obtain an approximate form for the return probability using the complete eigenvalues and eigenstates of Laplace matrix of the structure. It is found that the return probability depends on the initial node of the excitation. When the walk starts at the central nodes, the return probability converges to a constant value even in the limit of infinite system, in contrast to an exponential decay of the return probability if the walk starts at the outlying nodes. We also observe a bipartite structure for the distribution of return probability, and provide theoretical interpretation for all our findings. Our results suggest that quantum walks display significant localization and well-bedded structure of return probability on heterogeneous trees.

Quantum Information and Computation•Mar 1, 2011•3 citations

One-dimensional lackadaisical quantum walks

Kun Wang, Nan Wu, Ping Xu +1 more

Abstract In this paper, we study the properties of lackadaisical quantum walks (LQWs) on a line. This model was first proposed in Wong (2015 J. Phys. A: Math. Theor . 48 435304) as a quantum analogue of lazy random walks where each vertex is attached to τ self-loops. We derive an analytic expression for the localization probability of the walker at the origin after infinite steps, and obtain the peak velocities of the walker. We also calculate the wave function of the walker starting from the origin and obtain a long-time approximation for the entire probability density function. As an application of the density function, we prove that lackadaisical quantum walks spread ballistically for arbitrary τ , and give an analytic solution for the variance of the walker’s probability distribution.

arXiv:1612.03370•Journal of Physics A Mathematical and Theoretical•Nov 24, 2017•10 citations
We analyze the localization of quantum walks on a one-dimensional finite graph using vector-distance. We first vectorize the probability distribution of a quantum walker in each node. Then we compute out the probability distribution vectors of quantum walks in infinite and finite graphs in the presence of static disorder respectively, and get the distance between these two vectors. We find that when the steps taken are small and the boundary condition is tight, the localization between the infinite and finite cases is greatly different. However, the difference is negligible when the steps taken are large or the boundary condition is loose. It means quantum walks on a one-dimensional finite graph may also suffer from localization in the presence of static disorder. Our approach and results can be generalized to analyze the localization of quantum walks in higher-dimensional cases.
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 evolution of a system performing a one-dimensional quantum walk in the presence of static phase disorder. The same model also describes the propagation of classical light pulses in photonic mesh lattices. We study the interplay between the coupling (i.e. the bias of the "quantum coin") and disorder. We provide an exact analytical expression for the localization length for two limiting cases of strong and weak phase disorder. In all the cases of interest we supply numerical simulations for participation ratio, Lyapunov exponent and the return probability as functions of the coupling parameter.
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.
The phenomenon of localization usually happens due to the existence of disorder in a medium. Nevertheless, certain quantum systems allow dynamical localization solely due to the nature of internal interactions. We study a discrete time quantum walker which exhibits disorder-free localization. The quantum walker moves on a one-dimensional lattice and interacts with on-site spins by coherently rotating them around a given axis at each step. Since the spins do not have dynamics of their own, the system poses the local spin components along the rotation axis as an extensive number of conserved moments. When the interaction is weak, the spread of the walker shows subdiffusive behavior having downscaled ballistic tails in the evolving probability distribution at intermediate timescales. However, as the interaction gets stronger the walker gets completely localized in total absence of disorder in both lattice and initial state. Using a matrix-product-state ansatz, we investigate the relaxation and entanglement dynamics of the on-site spins due to their coupling with the quantum walker. Surprisingly, we find that, even in the delocalized regime, entanglement growth and relaxation occur slowly, unlike majority of the other models displaying a localization transition.
Localization of quantum walks can be characterized by the return probability, i.e., the probability for the walker returning to its original site. In this paper, we consider localization of continuous-time quantum walks in terms of return probability on a deterministic recursive tree, which is generated by adding one node and connecting it to each node of the existing tree recursively. We obtain an approximate form for the return probability using the complete eigenvalues and eigenstates of Laplace matrix of the structure. It is found that the return probability depends on the initial node of the excitation. When the walk starts at the central nodes, the return probability converges to a constant value even in the limit of infinite system, in contrast to an exponential decay of the return probability if the walk starts at the outlying nodes. We also observe a bipartite structure for the distribution of return probability, and provide theoretical interpretation for all our findings. Our results suggest that quantum walks display significant localization and well-bedded structure of return probability on heterogeneous trees.
Abstract In this paper, we study the properties of lackadaisical quantum walks (LQWs) on a line. This model was first proposed in Wong (2015 J. Phys. A: Math. Theor . 48 435304) as a quantum analogue of lazy random walks where each vertex is attached to τ self-loops. We derive an analytic expression for the localization probability of the walker at the origin after infinite steps, and obtain the peak velocities of the walker. We also calculate the wave function of the walker starting from the origin and obtain a long-time approximation for the entire probability density function. As an application of the density function, we prove that lackadaisical quantum walks spread ballistically for arbitrary τ , and give an analytic solution for the variance of the walker’s probability distribution.