arXiv:1203.0935

Ito's formula for the discrete-time quantum walk in two dimensions

Clement Boateng Ampadu

Published Mar 5, 2012• 0 citations

Abstract

Following [Konno, arXiv:1112.4335], 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 Z^2, the square lattice.

DOI: 10.48550/arxiv.1203.0935

Related papers

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

Clement Boateng Ampadu

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.

Journal of Quantum Information ScienceJan 1, 20121 citation

A note on Ito'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.4335Dec 19, 20112 citations

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

Norio Konno

We present an Itô'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.

Journal of Computational and Theoretical NanoscienceJun 20, 20131 citation

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.01071Jan 6, 20260 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.3557Interdisciplinary Information SciencesJan 1, 20131 citation

Connection Between Continuous and Discrete Time Quantum Walks on d-Dimensional Lattices; Extensions to General Graphs

I obtain the dynamics of the continuous time quantum walk on a d-dimensional lattice, with periodic boundary conditions, as an appropriate limit of the dynamics of the discrete time quantum walk on the same lattice. This extends the main result of [8] which proved this limit for the case of the quantum walk on the infinite line and the quantum cellular automaton proposed in [1]. By highlighting the main features of the limiting procedure, I then extend it to general graphs. For a given discrete time quantum walk on a general graph, I single out the type of continuous dynamics (Hamiltonians) that can be obtained as a limit of the discrete time dynamics. 1 Generalities on quantum walks; continuous and discrete time Consider a graph G: = {V, E} with a set of vertices V of cardinality N and a set of edges E. We assume G to be undirected and without self-loops. In the interval of time ∆t a certain fraction γ∆t of a quantity pj leaves the location of the j-th vertex to move to a neighboring vertex k. The quantity pj, j = 1,..., N, at time t + ∆t is given by 1 pj(t + ∆t) = pj(t) − deg (j)γ∆tpj(t) + ∑ (k,j)∈E γ∆tpk(t). (1) Define ⃗p the N−vector whose components are the pj’s quantities, and L the Laplacian matrix defined by Ljj = − deg (j), Ljk = 1 if (j, k) ∈ E and Ljk = 0 otherwise. L is

Jan 1, 200911 citations