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

IET Quantum Communication

Continuous‐Time Quantum Walk on the Homogeneous Tree

Qi Han, Rong Zhang, Lijie Gou, Shuai Wang

Published Jan 1, 2026• 0 citations
Publisher

Abstract

ABSTRACT In this paper, we explore continuous‐time quantum walk on homogeneous tree. By applying the stratification method, we treat vertices in the same stratum of a homogeneous tree as a single vertex and obtain the probability amplitudes for different strata in finite homogeneous tree parts. In particular, when (where denotes the number of strata), we derive the probability amplitudes for each stratum of the homogeneous tree, considering the homogeneous tree's transition from a finite to infinite structure.

DOI
10.1049/qtc2.70031

Related papers

The continuous-time quantum walk on some graphs based on the view of quantum probability

Qi Han, Yaxin Kou, Ning Bai +1 more

In this paper, continuous-time quantum walk is discussed based on the view of quantum probability, i.e. the quantum decomposition of the adjacency matrix A of graph. Regard adjacency matrix A as Hamiltonian which is a real symmetric matrix with elements 0 or 1, so we regard [Formula: see text] as an unbiased evolution operator, which is related to the calculation of probability amplitude. Combining the quantum decomposition and spectral distribution [Formula: see text] of adjacency matrix A, we calculate the probability amplitude reaching each stratum in continuous-time quantum walk on complete bipartite graphs, finite two-dimensional lattices, binary tree, [Formula: see text]-ary tree and [Formula: see text]-fold star power [Formula: see text]. Of course, this method is also suitable for studying some other graphs, such as growing graphs, hypercube graphs and so on, in addition, the applicability of this method is also explained.

International Journal of Quantum Information•Apr 29, 2022•6 citations

CONTINUOUS-TIME QUANTUM WALKS ON TREES IN QUANTUM PROBABILITY THEORY

Norio Konno

A quantum central limit theorem for a continuous-time quantum walk on a homogeneous tree is derived from quantum probability theory. As a consequence, a new type of limit theorems for another continuous-time walk introduced by the walk is presented. The limit density is similar to that given by a continuous-time quantum walk on the one-dimensional lattice.

arXiv:quant-ph/0602213•Infinite Dimensional Analysis Quantum Probability and Related Topics•Jun 1, 2006•44 citations

Algorithms for finding the maximum clique based on continuous time quantum walks

Xi Li, Mingyou Wu, Hanwu Chen +1 more

In this work, the application of continuous time quantum walks (CTQW) to the Maximum Clique (MC) problem was studied. Performing CTQW on graphs can generate distinct periodic probability amplitudes for different vertices. We found that the intensities of the probability amplitudes at some frequencies imply the clique structure of special kinds of graphs. Recursive algorithms with time complexity O(N^6) in classical computers were proposed to determine the maximum clique. We have experimented on random graphs where each edge exists with different probabilities. Although counter examples were not found for random graphs, whether these algorithms are universal is beyond the scope of this work.

arXiv:1912.02728•Quantum Information and Computation•Feb 1, 2021•4 citations

Investigation of continuous-time quantum walk via modules of Bose–Mesner and Terwilliger algebras

M. A. Jafarizadeh, S. Salimi

The continuous-time quantum walk on the underlying graphs of association schemes has been studied, via the algebraic combinatorics structures of association schemes, namely semi-simple modules of their Bose–Mesner and Terwilliger algebras. It is shown that the Terwilliger algebra stratifies the graph into a ( d + 1) disjoint union of strata which is different from the stratification based on distance, except for distance regular graphs. In underlying graphs of association schemes, the probability amplitudes and average probabilities are given in terms of dual eigenvalues of association schemes, such that the amplitudes of observing the continuous-time quantum walk on all sites belonging to a given stratum are the same, therefore there are at most ( d + 1) different observing probabilities. The importance of association scheme in continuous-time quantum walk is shown by some worked out examples such as arbitrary finite group association schemes followed by symmetric S n , Dihedral D 2 m and cyclic groups. At the end it is shown that the highest irreducible representations of Terwilliger algebras pave the way to use the spectral distributions method of Jafarizadeh and Salimi (2005 Preprint quant-ph/0510174) in studying quantum walk on some rather important graphs called distance regular graphs.

arXiv:quant-ph/0603139•Journal of Physics A Mathematical and General•Oct 4, 2006•29 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

Limit Theorems for Discrete-Time Quantum Walks on Trees

Kota Chisaki, Masatoshi Hamada, Norio Konno +1 more

We consider a discrete-time quantum walk Wt given by the Grover transformation on the homogeneous tree. We reduce Wt to a quantum walk Xt on a half line with a wall at the origin. This paper presents two types of limit theorems for Xt. The first one is Xt as t→∞, which corresponds to a localization in the case of an initial qubit state. The second one is Xt⁄t as t→∞, whose limit density is given by the Konno density function [1–4]. The density appears in various situations of discrete-time cases. The corresponding similar limit theorem was proved in [5] for a continuous-time case on the homogeneous tree.

arXiv:0903.4508•Interdisciplinary Information Sciences•Jan 1, 2009•37 citations
ABSTRACT In this paper, we explore continuous‐time quantum walk on homogeneous tree. By applying the stratification method, we treat vertices in the same stratum of a homogeneous tree as a single vertex and obtain the probability amplitudes for different strata in finite homogeneous tree parts. In particular, when (where denotes the number of strata), we derive the probability amplitudes for each stratum of the homogeneous tree, considering the homogeneous tree's transition from a finite to infinite structure.
In this paper, continuous-time quantum walk is discussed based on the view of quantum probability, i.e. the quantum decomposition of the adjacency matrix A of graph. Regard adjacency matrix A as Hamiltonian which is a real symmetric matrix with elements 0 or 1, so we regard [Formula: see text] as an unbiased evolution operator, which is related to the calculation of probability amplitude. Combining the quantum decomposition and spectral distribution [Formula: see text] of adjacency matrix A, we calculate the probability amplitude reaching each stratum in continuous-time quantum walk on complete bipartite graphs, finite two-dimensional lattices, binary tree, [Formula: see text]-ary tree and [Formula: see text]-fold star power [Formula: see text]. Of course, this method is also suitable for studying some other graphs, such as growing graphs, hypercube graphs and so on, in addition, the applicability of this method is also explained.
In this work, the application of continuous time quantum walks (CTQW) to the Maximum Clique (MC) problem was studied. Performing CTQW on graphs can generate distinct periodic probability amplitudes for different vertices. We found that the intensities of the probability amplitudes at some frequencies imply the clique structure of special kinds of graphs. Recursive algorithms with time complexity O(N^6) in classical computers were proposed to determine the maximum clique. We have experimented on random graphs where each edge exists with different probabilities. Although counter examples were not found for random graphs, whether these algorithms are universal is beyond the scope of this work.
The continuous-time quantum walk on the underlying graphs of association schemes has been studied, via the algebraic combinatorics structures of association schemes, namely semi-simple modules of their Bose–Mesner and Terwilliger algebras. It is shown that the Terwilliger algebra stratifies the graph into a ( d + 1) disjoint union of strata which is different from the stratification based on distance, except for distance regular graphs. In underlying graphs of association schemes, the probability amplitudes and average probabilities are given in terms of dual eigenvalues of association schemes, such that the amplitudes of observing the continuous-time quantum walk on all sites belonging to a given stratum are the same, therefore there are at most ( d + 1) different observing probabilities. The importance of association scheme in continuous-time quantum walk is shown by some worked out examples such as arbitrary finite group association schemes followed by symmetric S n , Dihedral D 2 m and cyclic groups. At the end it is shown that the highest irreducible representations of Terwilliger algebras pave the way to use the spectral distributions method of Jafarizadeh and Salimi (2005 Preprint quant-ph/0510174) in studying quantum walk on some rather important graphs called distance regular graphs.
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.
We consider a discrete-time quantum walk Wt given by the Grover transformation on the homogeneous tree. We reduce Wt to a quantum walk Xt on a half line with a wall at the origin. This paper presents two types of limit theorems for Xt. The first one is Xt as t→∞, which corresponds to a localization in the case of an initial qubit state. The second one is Xt⁄t as t→∞, whose limit density is given by the Konno density function [1–4]. The density appears in various situations of discrete-time cases. The corresponding similar limit theorem was proved in [5] for a continuous-time case on the homogeneous tree.