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:1108.0984

Localization of Two-Dimensional Five-State Quantum Walks

Clement Boateng Ampadu

Published Aug 4, 2011• 2 citations
arXivHTMLPDF

Abstract

We investigate a generalized Hadamard walk in two dimensions with five inner states. The particle governed by a five-state quantum walk (5QW) moves, in superposition, either leftward, rightward, upward, or downward according to the inner state. In addition to the four degrees of freedom, it is allowed to stay at the same position. We calculate rigorously the wave function of the particle starting from the origin in the plane for any initial state, and give the spatial distribution of probability of finding the particle. We also investigate the localization problem for the two-dimensional five-state quantum walk: Does the probability of finding a particle anywhere on the plane converge to zero even after infinite time steps except initial states?

DOI
10.48550/arxiv.1108.0984

Related papers

One-dimensional three-state quantum walk

Norio Inui, Norio Konno, Etsuo Segawa

We study a generalized Hadamard walk in one dimension with three inner states. The particle governed by the three-state quantum walk moves, in superposition, both to the left and to the right according to the inner state. In addition to these two degrees of freedom, it is allowed to stay at the same position. We calculate rigorously the wave function of the particle starting from the origin for any initial qubit state and show the spatial distribution of probability of finding the particle. In contrast with the Hadamard walk with two inner states on a line, the probability of finding the particle at the origin does not converge to zero even after infinite time steps except special initial states. This implies that the particle is trapped near the origin after a long time with high probability.

arXiv:quant-ph/0507207•Physical Review E•Nov 10, 2005•174 citations

Localization of two-dimensional quantum walks

Norio Inui, Yoshinao Konishi, Norio Konno

The Grover walk, which is related to Grover's search algorithm on a quantum computer, is one of the typical discrete time quantum walks. However, a localization of the two-dimensional Grover walk starting from a fixed point is strikingly different from other types of quantum walks. The present paper explains the reason why the walker who moves according to the degree-four Grover operator can remain at the starting point with a high probability. It is shown that the key factor for the localization is due to the degeneration of eigenvalues of the time evolution operator. In fact, the global time evolution of the quantum walk on a large lattice is mainly determined by the degree of degeneration. The dependence of the localization on the initial state is also considered by calculating the wave function analytically.

arXiv:quant-ph/0311118•Physical Review A•May 19, 2004•153 citations

Unidirectional quantum walks: Evolution and exit times

Miquel Montero

In this paper we focus our attention on a particle that follows a unidirectional quantum walk, an alternative version of the currently widespread discrete-time quantum walk on a line. Here the walker at each time step can either remain in place or move in a fixed direction, e.g., rightward or upward. While both formulations are essentially equivalent, the present approach leads us to consider discrete Fourier transforms, which eventually results in obtaining explicit expressions for the wave functions in terms of finite sums and allows the use of efficient algorithms based on the fast Fourier transform. The wave functions here obtained govern the probability of finding the particle at any given location but determine as well the exit-time probability of the walker from a fixed interval, which is also analyzed.

arXiv:1306.1807•Physical Review A•Jul 31, 2013•18 citations

Discrete-time quantum walk with two-step memory

Chris Jones

We examine a discrete-time quantum walk with two-step memory for a particle on a onedimensional infinite space. The walk is defined with a four-state memory space analogous to the two-state coin space commonly used in discrete time quantum walks, and a method is presented for calculating the time evolution by using the Fourier transform. An integral expression for the probability is calculated, and this is used to produce numerical solutions for the probability distribution as a function of the time step and position. The results show two peaks in the probability distribution. One peak propagates ballistically with time, which is a common feature of quantum walks. The other peak is stationary with time and located at the initial site of the particle. This feature is not common in quantum walks and suggests that tracing the immediate history of the particle using two-step memory may represent the beginning of a transition to a classical system.

•Jun 7, 2012•0 citations

Localization in quantum walks on a honeycomb network

Changyuan Lyu, Luyan Yu, Shengjun Wu

We systematically study the localization effect in discrete-time quantum walks on a honeycomb network and establish the mathematical framework. We focus on the Grover walk first and rigorously derive the limit form of the walker's state, showing it has a certain probability to be localized at the starting position. The relationship between localization and the initial coin state is concisely represented by a linear map. We also define and calculate the average probability of localization by generating random initial states. Further, coin operators varying with positions are considered and the sufficient condition for localization is discussed. We also similarly analyze another four-state Grover walk. Theoretical predictions are all in accord with numerical simulation results. Finally, our results are compared with previous works to demonstrate the unusual trapping effect of quantum walks on a honeycomb network, as well as the advantages of our method.

arXiv:1509.03919•Physical Review A•Nov 5, 2015•20 citations

Localization and limit laws of a three-state alternate quantum walk on a two-dimensional lattice

Takuya Machida, C. M. Chandrashekar

A two-dimensional discrete-time quantum walk (DTQW) can be realized by alternating a two-state DTQW in one spatial dimension followed by an evolution in the other dimension. This was shown to reproduce a probability distribution for a certain configuration of a four-state DTQW on a two-dimensional lattice. In this work we present a three-state alternate DTQW with a parametrized coin-flip operator and show that it can produce localization that is also observed for a certain other configuration of the four-state DTQW and nonreproducible using the two-state alternate DTQW. We will present two limit theorems for the three-state alternate DTQW. One of the limit theorems describes a long-time limit of a return probability, and the other presents a convergence in distribution for the position of the walker on a rescaled space by time. We find that the spatial entanglement generated by the three-state alternate DTQW is higher than that by the four-state DTQW. Using all our results, we outline the relevance of these walks in three-level physical systems.

arXiv:1510.02885•Physical Review A•Dec 3, 2015•15 citations
We investigate a generalized Hadamard walk in two dimensions with five inner states. The particle governed by a five-state quantum walk (5QW) moves, in superposition, either leftward, rightward, upward, or downward according to the inner state. In addition to the four degrees of freedom, it is allowed to stay at the same position. We calculate rigorously the wave function of the particle starting from the origin in the plane for any initial state, and give the spatial distribution of probability of finding the particle. We also investigate the localization problem for the two-dimensional five-state quantum walk: Does the probability of finding a particle anywhere on the plane converge to zero even after infinite time steps except initial states?
We study a generalized Hadamard walk in one dimension with three inner states. The particle governed by the three-state quantum walk moves, in superposition, both to the left and to the right according to the inner state. In addition to these two degrees of freedom, it is allowed to stay at the same position. We calculate rigorously the wave function of the particle starting from the origin for any initial qubit state and show the spatial distribution of probability of finding the particle. In contrast with the Hadamard walk with two inner states on a line, the probability of finding the particle at the origin does not converge to zero even after infinite time steps except special initial states. This implies that the particle is trapped near the origin after a long time with high probability.
The Grover walk, which is related to Grover's search algorithm on a quantum computer, is one of the typical discrete time quantum walks. However, a localization of the two-dimensional Grover walk starting from a fixed point is strikingly different from other types of quantum walks. The present paper explains the reason why the walker who moves according to the degree-four Grover operator can remain at the starting point with a high probability. It is shown that the key factor for the localization is due to the degeneration of eigenvalues of the time evolution operator. In fact, the global time evolution of the quantum walk on a large lattice is mainly determined by the degree of degeneration. The dependence of the localization on the initial state is also considered by calculating the wave function analytically.
In this paper we focus our attention on a particle that follows a unidirectional quantum walk, an alternative version of the currently widespread discrete-time quantum walk on a line. Here the walker at each time step can either remain in place or move in a fixed direction, e.g., rightward or upward. While both formulations are essentially equivalent, the present approach leads us to consider discrete Fourier transforms, which eventually results in obtaining explicit expressions for the wave functions in terms of finite sums and allows the use of efficient algorithms based on the fast Fourier transform. The wave functions here obtained govern the probability of finding the particle at any given location but determine as well the exit-time probability of the walker from a fixed interval, which is also analyzed.
We examine a discrete-time quantum walk with two-step memory for a particle on a onedimensional infinite space. The walk is defined with a four-state memory space analogous to the two-state coin space commonly used in discrete time quantum walks, and a method is presented for calculating the time evolution by using the Fourier transform. An integral expression for the probability is calculated, and this is used to produce numerical solutions for the probability distribution as a function of the time step and position. The results show two peaks in the probability distribution. One peak propagates ballistically with time, which is a common feature of quantum walks. The other peak is stationary with time and located at the initial site of the particle. This feature is not common in quantum walks and suggests that tracing the immediate history of the particle using two-step memory may represent the beginning of a transition to a classical system.
We systematically study the localization effect in discrete-time quantum walks on a honeycomb network and establish the mathematical framework. We focus on the Grover walk first and rigorously derive the limit form of the walker's state, showing it has a certain probability to be localized at the starting position. The relationship between localization and the initial coin state is concisely represented by a linear map. We also define and calculate the average probability of localization by generating random initial states. Further, coin operators varying with positions are considered and the sufficient condition for localization is discussed. We also similarly analyze another four-state Grover walk. Theoretical predictions are all in accord with numerical simulation results. Finally, our results are compared with previous works to demonstrate the unusual trapping effect of quantum walks on a honeycomb network, as well as the advantages of our method.
A two-dimensional discrete-time quantum walk (DTQW) can be realized by alternating a two-state DTQW in one spatial dimension followed by an evolution in the other dimension. This was shown to reproduce a probability distribution for a certain configuration of a four-state DTQW on a two-dimensional lattice. In this work we present a three-state alternate DTQW with a parametrized coin-flip operator and show that it can produce localization that is also observed for a certain other configuration of the four-state DTQW and nonreproducible using the two-state alternate DTQW. We will present two limit theorems for the three-state alternate DTQW. One of the limit theorems describes a long-time limit of a return probability, and the other presents a convergence in distribution for the position of the walker on a rescaled space by time. We find that the spatial entanglement generated by the three-state alternate DTQW is higher than that by the four-state DTQW. Using all our results, we outline the relevance of these walks in three-level physical systems.