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

Quantum Interchange Walk as a Unifying Approach

Zlatko Dimcovic, Yevgeniy Kovchegov

Published Apr 26, 2010• 0 citations
OpenAlex

Abstract

We construct a quantum interchange walk, related to classical walks with memory. This gives us a coinless discrete walk, while the origin in classical walks with memory offers the promise of use of existing tools from classical memoried walks. This approach readily reproduces all standard approaches. We briefly discuss its generality and advantages.

Related papers

Discrete-time quantum walks via interchange framework and memory in quantum evolution

Zlatko Dimcovic

•Jun 14, 2012•2 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

Unveiling two-dimensional discrete quantum walks dynamics via dispersion relations

Sergio Cantero‐Chinchilla, A. Romanelli, Eugenio Roldán +1 more

The discrete, or coined, quantum walk (QW) [1] is a process originally introduced as the quantum counterpart of the classical random walk (RW). In both cases there is a walker and a coin: at every time step the coin is tossed and the walker moves depending on the toss output. Unlike the RW, in the QW the walker and coin are quantum in nature what allows the coherent superpositions right/left and head/tail happen.

Conference on Lasers and Electro-Optics Europe & European Quantum Electronics Conference (CLEO/Europe-EQEC)•May 1, 2011•0 citations

A hybrid quantum walk model unifying discrete and continuous quantum walks

Tianen Chen, Yun Shang

Quantum walks, both discrete and continuous, serve as fundamental tools in quantum information processing with diverse applications. This work introduces a hybrid quantum walk model that integrates the coin mechanism of discrete walks with the Hamiltonian-driven time evolution of continuous walks. Through systematic analysis of probability distributions, standard deviations, and entanglement entropy on fundamental graph structures, we reveal distinctive dynamical characteristics that differentiate our model from conventional quantum walk paradigms. The proposed framework demonstrates unifying capabilities by naturally encompassing existing quantum walk models as special cases. Two significant applications emerge from this hybrid architecture: (1) We develop a novel protocol for perfect state transfer(PST) in general connected graphs, overcoming the limitations of previous graph-specific approaches. A PST on a tree graph has been implemented on a quantum superconducting processor. (2) We devise a quantum algorithm for multiplying K adjacency matrices of n -vertex regular graphs with time complexity O ( n 2 d 1 ⋯ d K ), outperforming classical matrix multiplication ( O ( n 2.371552 )) when vertex degrees d i are bounded. The algorithm’s efficacy for triangle counting is experimentally validated through the quantum simulation on PennyLane. These results establish the hybrid quantum walk as a versatile framework bridging discrete and continuous paradigms while enabling practical quantum advantage in graph computation tasks.

arXiv:2509.09221•npj Quantum Information•Dec 30, 2025•3 citations

Connecting the discrete- and continuous-time quantum walks

Frederick W. Strauch

Recently, quantized versions of random walks have been explored as effective elements for quantum algorithms. In the simplest case of one dimension, the theory has remained divided into the discrete-time quantum walk and the continuous-time quantum walk. Though the properties of these two walks have shown similarities, it has remained an open problem to find the exact relation between the two. The precise connection of these two processes, both quantally and classically, is presented. Extension to higher dimensions is also discussed.

arXiv:quant-ph/0606050•Physical Review A•Sep 7, 2006•178 citations

Second-order topological insulator in a coinless discrete-time quantum walk

Ya Meng, Gang Chen, Suotang Jia

Higher-order topological insulators not only exhibit the exotic bulk-boundary correspondence principle but also have an important application in quantum computing. However, it seems they have not been achieved in the discrete-time quantum walk. In this paper we construct a two-dimensional coinless discrete-time quantum walk to simulate the second-order topological insulator with zero-dimensional corner states. We show that both of the corner and edge states can be observed through the probability distribution of the walker after a multistep coinless discrete-time quantum walk. Finally, we propose a possible experimental implementation to realize this coinless discrete-time quantum walk in a three-dimensional integrated photonic circuit and verify the robustness of the corner states against the small disorder. Our work offers an alternative route to explore exotic higher-order topological matters using discrete-time quantum walks.

arXiv:2003.08637•Physical Review A•Jul 7, 2020•6 citations
We construct a quantum interchange walk, related to classical walks with memory. This gives us a coinless discrete walk, while the origin in classical walks with memory offers the promise of use of existing tools from classical memoried walks. This approach readily reproduces all standard approaches. We briefly discuss its generality and advantages.
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.
Quantum walks, both discrete and continuous, serve as fundamental tools in quantum information processing with diverse applications. This work introduces a hybrid quantum walk model that integrates the coin mechanism of discrete walks with the Hamiltonian-driven time evolution of continuous walks. Through systematic analysis of probability distributions, standard deviations, and entanglement entropy on fundamental graph structures, we reveal distinctive dynamical characteristics that differentiate our model from conventional quantum walk paradigms. The proposed framework demonstrates unifying capabilities by naturally encompassing existing quantum walk models as special cases. Two significant applications emerge from this hybrid architecture: (1) We develop a novel protocol for perfect state transfer(PST) in general connected graphs, overcoming the limitations of previous graph-specific approaches. A PST on a tree graph has been implemented on a quantum superconducting processor. (2) We devise a quantum algorithm for multiplying K adjacency matrices of n -vertex regular graphs with time complexity O ( n 2 d 1 ⋯ d K ), outperforming classical matrix multiplication ( O ( n 2.371552 )) when vertex degrees d i are bounded. The algorithm’s efficacy for triangle counting is experimentally validated through the quantum simulation on PennyLane. These results establish the hybrid quantum walk as a versatile framework bridging discrete and continuous paradigms while enabling practical quantum advantage in graph computation tasks.
Recently, quantized versions of random walks have been explored as effective elements for quantum algorithms. In the simplest case of one dimension, the theory has remained divided into the discrete-time quantum walk and the continuous-time quantum walk. Though the properties of these two walks have shown similarities, it has remained an open problem to find the exact relation between the two. The precise connection of these two processes, both quantally and classically, is presented. Extension to higher dimensions is also discussed.
Higher-order topological insulators not only exhibit the exotic bulk-boundary correspondence principle but also have an important application in quantum computing. However, it seems they have not been achieved in the discrete-time quantum walk. In this paper we construct a two-dimensional coinless discrete-time quantum walk to simulate the second-order topological insulator with zero-dimensional corner states. We show that both of the corner and edge states can be observed through the probability distribution of the walker after a multistep coinless discrete-time quantum walk. Finally, we propose a possible experimental implementation to realize this coinless discrete-time quantum walk in a three-dimensional integrated photonic circuit and verify the robustness of the corner states against the small disorder. Our work offers an alternative route to explore exotic higher-order topological matters using discrete-time quantum walks.