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

International Journal of Theoretical Physics

Variable-step Discrete-time Quantum Walks on Binary Tree

Qi Han, Ziyi Ma, Xuexin Huang, Xiao Wu, Junlin Li

Published Nov 5, 2026• 0 citations
Publisher
DOI
10.1007/s10773-026-06317-1

Related papers

Discrete quantum walk on a binary tree

Zlatko Dimcovic, Ian Milligan, Dan Rockwell +3 more

Bulletin of the American Physical Society•Mar 24, 2011•0 citations

Framework for discrete-time quantum walks and a symmetric walk on a binary tree

Zlatko Dimcovic, Daniel Rockwell, Ian Milligan +3 more

We formulate a framework for discrete-time quantum walks, motivated by classical random walks with memory. We present a specific representation of the classical walk with memory 2, on which this is based. The framework has no need for coin spaces, it imposes no constraints on the evolution operator other than unitarity, and is unifying of other approaches. As an example we construct a symmetric discrete-time quantum walk on the semi-infinite binary tree. The generating function of the amplitude at the root is computed in closed form, as a function of time and the initial level $n$ in the tree, and we find the asymptotic and a full numerical solution for the amplitude. It exhibits a sharp interference peak and a power-law tail, as opposed to the exponentially decaying tail of a broadly peaked distribution of the classical symmetric random walk on a binary tree. The probability peak is orders of magnitude larger than it is for the classical walk (already at small $n$). The quantum walk shows a polynomial algorithmic speedup in $n$ over the classical walk, which we conjecture to be of the order $2/3$, based on strong trends in data.

arXiv:1107.4201•Physical Review A•Sep 8, 2011•13 citations

Discrete-time quantum walks and graph structures

Chris D. Godsil, Hanmeng Zhan

arXiv:1701.04474•Journal of Combinatorial Theory Series A•May 16, 2019•33 citations

State transfer on two-fold Cayley trees via quantum walks*

Xiling Xue, Yue Ruan

Perfect state transfer (PST) has great significance due to its applications in quantum information processing and quantum computation. The main problem we study in this paper is to determine whether the two-fold Cayley tree, an extension of the Cayley tree, admits perfect state transfer between two roots using quantum walks. We show that PST can be achieved by means of the so-called nonrepeating quantum walk [Phys. Rev. A 89 042332 (2014)] within time steps that are the distance between the two roots; while both the continuous-time quantum walk and the typical discrete-time quantum walk with Grover coin approaches fail. Our results suggest that in some cases the dynamics of a discrete-time quantum walk may be much richer than that of the continuous-time quantum walk.

Chinese Physics B•Dec 2, 2020•2 citations

Partition-based discrete-time quantum walks

Norio Konno, Renato Portugal, Iwao Sato +1 more

arXiv:1707.07127•Quantum Information Processing•Mar 12, 2018•28 citations

Automated Quantum Circuit Synthesis and Cost Estimation for the Binary Welded Tree Oracle

Mrityunjay Ghosh, Amlan Chakrabarti, Niraj Kumar Jha

Quantum computing is a new computational paradigm that promises an exponential speed-up over classical algorithms. To develop efficient quantum algorithms for problems of a non-deterministic nature, random walk is one of the most successful concepts employed. In this article, we target both continuous-time and discrete-time random walk in both the classical and quantum regimes. Binary Welded Tree (BWT), or glued tree, is one of the most well-known quantum walk algorithms in the continuous-time domain. Prior work implements quantum walk on the BWT with static welding. In this context, static welding is randomized but case-specific. We propose a solution to automatically generate the circuit for the Oracle for welding. We implement the circuit using the Quantum Assembly Language, which is a language for describing quantum circuits. We then optimize the generated circuit using the Fault-Tolerant Quantum Logic Synthesis tool for any BWT instance. Automatic welding enables us to provide a generalized solution for quantum walk on the BWT.

ACM Journal on Emerging Technologies in Computing Systems•Jun 29, 2017•7 citations
We formulate a framework for discrete-time quantum walks, motivated by classical random walks with memory. We present a specific representation of the classical walk with memory 2, on which this is based. The framework has no need for coin spaces, it imposes no constraints on the evolution operator other than unitarity, and is unifying of other approaches. As an example we construct a symmetric discrete-time quantum walk on the semi-infinite binary tree. The generating function of the amplitude at the root is computed in closed form, as a function of time and the initial level nnn in the tree, and we find the asymptotic and a full numerical solution for the amplitude. It exhibits a sharp interference peak and a power-law tail, as opposed to the exponentially decaying tail of a broadly peaked distribution of the classical symmetric random walk on a binary tree. The probability peak is orders of magnitude larger than it is for the classical walk (already at small nnn). The quantum walk shows a polynomial algorithmic speedup in nnn over the classical walk, which we conjecture to be of the order 2/32/32/3, based on strong trends in data.
Perfect state transfer (PST) has great significance due to its applications in quantum information processing and quantum computation. The main problem we study in this paper is to determine whether the two-fold Cayley tree, an extension of the Cayley tree, admits perfect state transfer between two roots using quantum walks. We show that PST can be achieved by means of the so-called nonrepeating quantum walk [Phys. Rev. A 89 042332 (2014)] within time steps that are the distance between the two roots; while both the continuous-time quantum walk and the typical discrete-time quantum walk with Grover coin approaches fail. Our results suggest that in some cases the dynamics of a discrete-time quantum walk may be much richer than that of the continuous-time quantum walk.
Quantum computing is a new computational paradigm that promises an exponential speed-up over classical algorithms. To develop efficient quantum algorithms for problems of a non-deterministic nature, random walk is one of the most successful concepts employed. In this article, we target both continuous-time and discrete-time random walk in both the classical and quantum regimes. Binary Welded Tree (BWT), or glued tree, is one of the most well-known quantum walk algorithms in the continuous-time domain. Prior work implements quantum walk on the BWT with static welding. In this context, static welding is randomized but case-specific. We propose a solution to automatically generate the circuit for the Oracle for welding. We implement the circuit using the Quantum Assembly Language, which is a language for describing quantum circuits. We then optimize the generated circuit using the Fault-Tolerant Quantum Logic Synthesis tool for any BWT instance. Automatic welding enables us to provide a generalized solution for quantum walk on the BWT.