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:1103.4185 · Physical Review A

Discrete-time quantum walk approach to state transfer

Paweł Kurzyński, Antoni Wójcik

Published Jun 13, 2011• 76 citations
arXivHTMLPDF

Abstract

We show that a quantum-state transfer, previously studied as a continuous-time process in networks of interacting spins, can be achieved within the model of discrete-time quantum walks with a position-dependent coin. We argue that, due to additional degrees of freedom, discrete-time quantum walks allow one to observe effects which cannot be observed in the corresponding continuous-time case. First, we study a discrete-time version of the engineered coupling protocol due to Christandl et al. [Phys. Rev. Lett. 92, 187902 (2004)] and then we discuss the general idea of conversion between continuous-time quantum walks and discrete-time quantum walks.

DOI
10.1103/physreva.83.062315

Related papers

Generic quantum walk using a coin-embedded shift operator

C. M. Chandrashekar

The study of quantum walk processes has been widely divided into two standard variants, the discrete-time quantum walk (DTQW) and the continuous-time quantum walk (CTQW). The connection between the two variants has been established by considering the limiting value of the coin operation parameter in the DTQW, and the coin degree of freedom was shown to be unnecessary [F. W. Strauch, Phys. Rev. A 74, 030301(R) (2006)]. But the coin degree of freedom is an additional resource which can be exploited to control the dynamics of the QW process. In this paper we present a generic quantum walk model using a quantum coin-embedded unitary shift operation ${U}_{C}$. The standard version of the DTQW and the CTQW can be conveniently retrieved from this generic model, retaining the features of the coin degree of freedom in both variants.

arXiv:0810.1556•Physical Review A•Nov 5, 2008•10 citations

Universal quantum computation using the discrete-time quantum walk

Neil B. Lovett, Sally Cooper, Matthew Everitt +2 more

A proof that continuous-time quantum walks are universal for quantum computation, using unweighted graphs of low degree, has recently been presented by A. M. Childs [Phys. Rev. Lett. 102, 180501 (2009)]. We present a version based instead on the discrete-time quantum walk. We show that the discrete-time quantum walk is able to implement the same universal gate set and thus both discrete and continuous-time quantum walks are computational primitives. Additionally, we give a set of components on which the discrete-time quantum walk provides perfect state transfer.

arXiv:0910.1024•Physical Review A•Apr 30, 2010•510 citations

Continuum Limits of the 1D Discrete Time Quantum Walk

Michael Manighalam, Mark Kon

The discrete time quantum walk (DTQW) is a universal quantum computational model. Significant relationships between discrete and corresponding continuous quantum systems have been studied since the work of Pauli and Feynman. This work continues the study of relationships between discrete quantum models and their ostensive continuum counterparts by developing a formal transition between discrete and continuous quantum systems through a formal framework for continuum limits of the DTQW. Under this framework, we prove two constructive theorems concerning which internal discrete transitions ("coins") admit nontrivial continuum limits. We additionally prove that the continuous space limit of the continuous time limit of the DTQW can only yield massless states which obey the Dirac equation. Finally, we demonstrate that the continuous time limit of the DTQW can be identified with the canonical continuous time quantum walk (CTQW) when the coin is allowed to transition through the continuous limit process.

arXiv:1909.07531•Sep 17, 2019•4 citations

Discrete-time quantum walk with feed-forward quantum coin

Yutaka Shikano, Tatsuaki Wada, Junsei Horikawa

Constructing a discrete model like a cellular automaton is a powerful method for understanding various dynamical systems. However, the relationship between the discrete model and its continuous analogue is, in general, nontrivial. As a quantum-mechanical cellular automaton, a discrete-time quantum walk is defined to include various quantum dynamical behavior. Here we generalize a discrete-time quantum walk on a line into the feed-forward quantum coin model, which depends on the coin state of the previous step. We show that our proposed model has an anomalous slow diffusion characterized by the porous-medium equation, while the conventional discrete-time quantum walk model shows ballistic transport.

arXiv:1303.3432•Scientific Reports•Mar 21, 2014•48 citations

Quantum walk with a time-dependent coin

Mari Carmen Bañuls, Carlos Navarrete–Benlloch, Armando Pérez +2 more

We introduce quantum walks with a time-dependent coin, and show how they include, as a particular case, the generalized quantum walk recently studied by Wojcik et al. [Phys. Rev. Lett. 93, 180601 (2004)] which exhibits interesting dynamical localization and quasiperiodic dynamics. Our proposal allows for a much easier implementation of this particularly rich dynamics than the original one. Moreover, it allows for an additional control on the walk, which can be used to compensate for phases appearing due to external interactions. To illustrate its feasibility, we discuss an example using an optical cavity. We also derive an approximated solution in the continuous limit (long-wavelength approximation) which provides physical insight about the process.

arXiv:quant-ph/0510046•Physical Review A•Jun 6, 2006•75 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•2 citations
We show that a quantum-state transfer, previously studied as a continuous-time process in networks of interacting spins, can be achieved within the model of discrete-time quantum walks with a position-dependent coin. We argue that, due to additional degrees of freedom, discrete-time quantum walks allow one to observe effects which cannot be observed in the corresponding continuous-time case. First, we study a discrete-time version of the engineered coupling protocol due to Christandl et al. [Phys. Rev. Lett. 92, 187902 (2004)] and then we discuss the general idea of conversion between continuous-time quantum walks and discrete-time quantum walks.
The study of quantum walk processes has been widely divided into two standard variants, the discrete-time quantum walk (DTQW) and the continuous-time quantum walk (CTQW). The connection between the two variants has been established by considering the limiting value of the coin operation parameter in the DTQW, and the coin degree of freedom was shown to be unnecessary [F. W. Strauch, Phys. Rev. A 74, 030301(R) (2006)]. But the coin degree of freedom is an additional resource which can be exploited to control the dynamics of the QW process. In this paper we present a generic quantum walk model using a quantum coin-embedded unitary shift operation UC{U}_{C}UC​. The standard version of the DTQW and the CTQW can be conveniently retrieved from this generic model, retaining the features of the coin degree of freedom in both variants.
A proof that continuous-time quantum walks are universal for quantum computation, using unweighted graphs of low degree, has recently been presented by A. M. Childs [Phys. Rev. Lett. 102, 180501 (2009)]. We present a version based instead on the discrete-time quantum walk. We show that the discrete-time quantum walk is able to implement the same universal gate set and thus both discrete and continuous-time quantum walks are computational primitives. Additionally, we give a set of components on which the discrete-time quantum walk provides perfect state transfer.
The discrete time quantum walk (DTQW) is a universal quantum computational model. Significant relationships between discrete and corresponding continuous quantum systems have been studied since the work of Pauli and Feynman. This work continues the study of relationships between discrete quantum models and their ostensive continuum counterparts by developing a formal transition between discrete and continuous quantum systems through a formal framework for continuum limits of the DTQW. Under this framework, we prove two constructive theorems concerning which internal discrete transitions ("coins") admit nontrivial continuum limits. We additionally prove that the continuous space limit of the continuous time limit of the DTQW can only yield massless states which obey the Dirac equation. Finally, we demonstrate that the continuous time limit of the DTQW can be identified with the canonical continuous time quantum walk (CTQW) when the coin is allowed to transition through the continuous limit process.
Constructing a discrete model like a cellular automaton is a powerful method for understanding various dynamical systems. However, the relationship between the discrete model and its continuous analogue is, in general, nontrivial. As a quantum-mechanical cellular automaton, a discrete-time quantum walk is defined to include various quantum dynamical behavior. Here we generalize a discrete-time quantum walk on a line into the feed-forward quantum coin model, which depends on the coin state of the previous step. We show that our proposed model has an anomalous slow diffusion characterized by the porous-medium equation, while the conventional discrete-time quantum walk model shows ballistic transport.
We introduce quantum walks with a time-dependent coin, and show how they include, as a particular case, the generalized quantum walk recently studied by Wojcik et al. [Phys. Rev. Lett. 93, 180601 (2004)] which exhibits interesting dynamical localization and quasiperiodic dynamics. Our proposal allows for a much easier implementation of this particularly rich dynamics than the original one. Moreover, it allows for an additional control on the walk, which can be used to compensate for phases appearing due to external interactions. To illustrate its feasibility, we discuss an example using an optical cavity. We also derive an approximated solution in the continuous limit (long-wavelength approximation) which provides physical insight about the process.
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.