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:1203.0935 · Journal of Quantum Information Science

Ito’s Formula for the Discrete-Time Quantum Walk in Two Dimensions

Clement Boateng Ampadu

Published Jan 1, 2012• 1 citation
arXivHTMLPDF

Abstract

Following Konno [1], it is natural to ask: What is the Ito’s formula for the discrete time quantum walk on a graph different than Z, the set of integers? In this paper we answer the question for the discrete time quantum walk on Z2, the square lattice.
DOI
10.4236/jqis.2012.22008

Related papers

A Note on Itô's Formula for Discrete-Time Quantum Walk

Norio Konno

We present an Ito's formula for the one-dimensional discrete-time quantum walk and give some examples including a Tanaka's formula by using the formula. Moreover we discuss integrals for the quantum walk.

arXiv:1112.4335•Journal of Computational and Theoretical Nanoscience•Jun 20, 2013•4 citations

The Hamiltonians Generating One-Dimensional Discrete-Time Quantum Walks

Tatsuya Tate

An explicit formula of the Hamiltonians generating one-dimensional discrete-time quantum walks is given. The formula is deduced by using the algebraic structure introduced before. The square of the Hamiltonian turns out to be an operator without, essentially, the ``coin register,'' and hence it can be compared with the one-dimensional continuous-time quantum walk. It is shown that, under a limit with respect to a parameter, which expresses the magnitude of the diagonal components of the unitary matrix defining the discrete-time quantum walks, the one-dimensional continuous-time quantum walk is obtained from operators defined through the Hamiltonians of the one-dimensional discrete-time quantum walks. Thus, this result can be regarded, in one-dimension, as a partial answer to a problem proposed by Ambainis.

arXiv:1306.3557•Interdisciplinary Information Sciences•Jan 1, 2013•1 citation

Ergodicity in discrete-time quantum walks

Kiran Kumar, Mostafa Sabri

We undertake a detailed analysis of ergodicity for homogeneous discrete-time quantum walks on the integer lattice. The most significant result of our paper holds in dimension one, and gives a complete equivalence between the absolutely continuous spectrum of the unitary operator encoding the walk, and the equidistribution of its dynamics in position space, which appears for the first time in the context of large-volume quantum ergodicity. In higher dimensions, we give a criterion for full and partial ergodicity in terms of a finer property of the spectrum which we dub ``No Repeating Graphs'', and we distinguish how strongly the equidistribution is taking place (weak convergence vs total variation). Many examples are included to illustrate the criterion and to distinguish between the types of ergodicity.

arXiv:2603.16837•Mar 17, 2026•2 citations

The generator and quantum Markov semigroup for quantum walks

Chul Ki Ko, Hyun Jae Yoo

The quantum walks in the lattice spaces are represented as unitary evolutions. We find a generator for the evolution and apply it to further understand the walks. We first extend the discrete time quantum walks to continuous time walks. Then we construct the quantum Markov semigroup for quantum walks and characterize it in an invariant subalgebra. In the meanwhile, we obtain the limit distributions of the quantum walks in one-dimension with a proper scaling, which was obtained by Konno by a different method.

arXiv:1305.1749•Kodai Mathematical Journal•Jun 1, 2013•8 citations

Molchanov's Formula and Quantum Walks: A Probabilistic Approach

Hoang Vu

This paper establishes a robust link between quantum dynamics and classical ones by deriving probabilistic representation for both continuous time and discrete time quantum walks. We first adapt Molchanov formula, originally employed in the study of Schrodinger operators on multidimensional integer lattice, to characterize the evolution of continuous time quantum walks. Extending this framework, we develop a probabilistic method to represent discrete time quantum walks on an infinite integer line, bypassing the locality constraints that typically inhibit direct application of Molchanov formula. The validity of our representation is empirically confirmed through a benchmark analysis of the Hadamard walk, demonstrating high fidelity with traditional unitary evolution. Our results suggest that this probabilistic lens offer a powerful alternative for learning multidimensional quantum walks and provides new analytical pathways for investigating quantum systems via classical stochastic processes.

quant-pharXiv:2601.01071•Jan 6, 2026•1 citation

Continuous limit of discrete quantum walks

M N Dheeraj, Todd A. Brun

Quantum walks can be defined in two quite distinct ways: discrete-time and continuous-time quantum walks (DTQWs and CTQWs). For classical random walks, there is a natural sense in which continuous-time walks are a limit of discrete-time walks. Quantum mechanically, in the discrete-time case, an additional ``coin space'' must be appended for the walk to have nontrivial time evolution. Continuous-time quantum walks, however, have no such constraints. This means that there is no completely straightforward way to treat a CTQW as a limit of a DTQW, as can be done in the classical case. Various approaches to this problem have been taken in the past. We give a construction for walks on $d$-regular, $d$-colorable graphs when the coin flip operator is Hermitian: from a standard DTQW we construct a family of discrete-time walks with a well-defined continuous-time limit on a related graph. One can think of this limit as a ``coined'' continuous-time walk. We show that these CTQWs share some properties with coined DTQWs. In particular, we look at a spatial search by a DTQW over the two-dimensional (2D) torus (a grid with periodic boundary conditions) of size $\sqrt{N}\ifmmode\times\else\texttimes\fi{}\sqrt{N}$, where it was shown that a coined DTQW can search in time $O(\sqrt{N}logN)$, but a standard CTQW takes $\mathrm{\ensuremath{\Omega}}(N)$ time to search for a marked element. The continuous limit of the DTQW search over the 2D torus exhibits the $O(\sqrt{N}logN)$ scaling, like the coined walk it is derived from. We also look at the effects of graph symmetry on the limiting walk, and show that the properties are similar to those of the DTQW as shown in Krovi and Brun, Phys. Rev. A 75, 062332 (2007).

arXiv:1501.06950•Physical Review A•Jun 5, 2015•17 citations
An explicit formula of the Hamiltonians generating one-dimensional discrete-time quantum walks is given. The formula is deduced by using the algebraic structure introduced before. The square of the Hamiltonian turns out to be an operator without, essentially, the ``coin register,'' and hence it can be compared with the one-dimensional continuous-time quantum walk. It is shown that, under a limit with respect to a parameter, which expresses the magnitude of the diagonal components of the unitary matrix defining the discrete-time quantum walks, the one-dimensional continuous-time quantum walk is obtained from operators defined through the Hamiltonians of the one-dimensional discrete-time quantum walks. Thus, this result can be regarded, in one-dimension, as a partial answer to a problem proposed by Ambainis.
We undertake a detailed analysis of ergodicity for homogeneous discrete-time quantum walks on the integer lattice. The most significant result of our paper holds in dimension one, and gives a complete equivalence between the absolutely continuous spectrum of the unitary operator encoding the walk, and the equidistribution of its dynamics in position space, which appears for the first time in the context of large-volume quantum ergodicity. In higher dimensions, we give a criterion for full and partial ergodicity in terms of a finer property of the spectrum which we dub ``No Repeating Graphs'', and we distinguish how strongly the equidistribution is taking place (weak convergence vs total variation). Many examples are included to illustrate the criterion and to distinguish between the types of ergodicity.
The quantum walks in the lattice spaces are represented as unitary evolutions. We find a generator for the evolution and apply it to further understand the walks. We first extend the discrete time quantum walks to continuous time walks. Then we construct the quantum Markov semigroup for quantum walks and characterize it in an invariant subalgebra. In the meanwhile, we obtain the limit distributions of the quantum walks in one-dimension with a proper scaling, which was obtained by Konno by a different method.
This paper establishes a robust link between quantum dynamics and classical ones by deriving probabilistic representation for both continuous time and discrete time quantum walks. We first adapt Molchanov formula, originally employed in the study of Schrodinger operators on multidimensional integer lattice, to characterize the evolution of continuous time quantum walks. Extending this framework, we develop a probabilistic method to represent discrete time quantum walks on an infinite integer line, bypassing the locality constraints that typically inhibit direct application of Molchanov formula. The validity of our representation is empirically confirmed through a benchmark analysis of the Hadamard walk, demonstrating high fidelity with traditional unitary evolution. Our results suggest that this probabilistic lens offer a powerful alternative for learning multidimensional quantum walks and provides new analytical pathways for investigating quantum systems via classical stochastic processes.
Quantum walks can be defined in two quite distinct ways: discrete-time and continuous-time quantum walks (DTQWs and CTQWs). For classical random walks, there is a natural sense in which continuous-time walks are a limit of discrete-time walks. Quantum mechanically, in the discrete-time case, an additional ``coin space'' must be appended for the walk to have nontrivial time evolution. Continuous-time quantum walks, however, have no such constraints. This means that there is no completely straightforward way to treat a CTQW as a limit of a DTQW, as can be done in the classical case. Various approaches to this problem have been taken in the past. We give a construction for walks on ddd-regular, ddd-colorable graphs when the coin flip operator is Hermitian: from a standard DTQW we construct a family of discrete-time walks with a well-defined continuous-time limit on a related graph. One can think of this limit as a ``coined'' continuous-time walk. We show that these CTQWs share some properties with coined DTQWs. In particular, we look at a spatial search by a DTQW over the two-dimensional (2D) torus (a grid with periodic boundary conditions) of size $\sqrt{N}\ifmmode\times\else\texttimes\fi{}\sqrt{N}$, where it was shown that a coined DTQW can search in time O(NlogN)O(\sqrt{N}logN)O(N​logN), but a standard CTQW takes $\mathrm{\ensuremath{\Omega}}(N)$ time to search for a marked element. The continuous limit of the DTQW search over the 2D torus exhibits the O(NlogN)O(\sqrt{N}logN)O(N​logN) scaling, like the coined walk it is derived from. We also look at the effects of graph symmetry on the limiting walk, and show that the properties are similar to those of the DTQW as shown in Krovi and Brun, Phys. Rev. A 75, 062332 (2007).