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:2103.00515 · Journal of Physics A Mathematical and Theoretical

Localization of two dimensional quantum walks defined by generalized Grover coins

Amrita Mandal, Rohit Sarma Sarkar, Bibhas Adhikari

Published Jan 13, 2023• 4 citations
arXivHTMLPDF

Abstract

Abstract Localization phenomena of quantum walks makes the propagation dynamics of a walker strikingly different from that corresponding to classical random walks. In this paper, we study the localization phenomena of four-state discrete-time quantum walks on two-dimensional lattices with coin operators as one-parameter orthogonal matrices that are also permutative, a combinatorial structure of the Grover matrix. We show that the proposed walks localize at its initial position for canonical initial coin states when the coin belongs to classes which contain the Grover matrix that we consider in this paper, however, the localization phenomena depends on the coin parameter when the class of parametric coins does not contain the Grover matrix.

DOI
10.1088/1751-8121/acb304

Related papers

Limit theorems and localization of three-state quantum walks on a line defined by generalized Grover coins

Amrita Mandal, Rohit Sarma Sarkar, Shantanav Chakraborty +1 more

In this article, we undertake a detailed study of the limiting behavior of a three-state discrete-time quantum walk on a one-dimensional lattice with generalized Grover coins. Two limit theorems are proved and consequently we show that the quantum walk exhibits localization at its initial position for a wide range of coin parameters. Finally, we discuss the effect of the coin parameters on the peak velocities of probability distributions of the underlying quantum walks.

arXiv:2204.05625•Physical Review A•Oct 4, 2022•8 citations

Complete classification of trapping coins for quantum walks on the two-dimensional square lattice

Bálint Kollár, András Gilyén, Iva Tkáčová +3 more

One of the unique features of discrete-time quantum walks is called trapping, meaning the inability of the quantum walker to completely escape from its initial position, although the system is translationally invariant. The effect is dependent on the dimension and the explicit form of the local coin. A four-state discrete-time quantum walk on a square lattice is defined by its unitary coin operator, acting on the four-dimensional coin Hilbert space. The well-known example of the Grover coin leads to a partial trapping, i.e., there exists some escaping initial state for which the probability of staying at the initial position vanishes. On the other hand, some other coins are known to exhibit strong trapping, where such an escaping state does not exist. We present a systematic study of coins leading to trapping, explicitly construct all such coins for discrete-time quantum walks on the two-dimensional square lattice, and classify them according to the structure of the operator and the manifestation of the trapping effect. We distinguish three types of trapping coins exhibiting distinct dynamical properties, as exemplified by the existence or nonexistence of the escaping state and the area covered by the spreading wave packet.

arXiv:2002.08070•Physical Review A•Jul 7, 2020•8 citations

Revisiting one-dimensional discrete-time quantum walks with general coin

Mahesh N. Jayakody, Chandrakala Meena, Priodyuti Pradhan

Quantum walk (QW) is the quantum analog of the random walk. QW is an integral part of the development of numerous quantum algorithms. Hence, an in-depth understanding of QW helps us to grasp the quantum algorithms. We revisit the one-dimensional discrete-time QW and discuss basic steps in detail by incorporating the most general coin operator, constant in both space and time, and a localized initial state using numerical modeling. We investigate the impact of each parameter of the general coin operator on the probability distribution of the quantum walker. We show that by tuning the parameters of the general coin, one can regulate the probability distribution of the walker. We provide an algorithm for the one-dimensional quantum walk driven by the general coin operator. The study on general coin operators also includes the popular coins – Hadamard, Grover, and Fourier.

arXiv:2102.07207•Physics Open•Nov 10, 2023•15 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 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•154 citations

Recurrence properties of unbiased coined quantum walks on infinite d -dimensional lattices

M. Štefaňák, T. Kiss, Igor Jex

The P\'olya number characterizes the recurrence of a random walk. We apply the generalization of this concept to quantum walks [M. \ifmmode \check{S}\else \v{S}\fi{}tefa\ifmmode \check{n}\else \v{n}\fi{}\'ak et al., Phys. Rev. Lett. 100, 020501 (2008)] which is based on a specific measurement scheme. The P\'olya number of a quantum walk depends, in general, on the choice of the coin and the initial coin state, in contrast to classical random walks where the lattice dimension uniquely determines it. We analyze several examples to depict the variety of possible recurrence properties. First, we show that for the class of quantum walks driven by Hadamard tensor-product coins, the P\'olya number is independent of the initial conditions and the actual coin operators, thus resembling the property of the classical walks. We provide an estimation of the P\'olya number for this class of quantum walks. Second, we examine the two-dimensional Grover walk, which exhibits localization and thus is recurrent, except for a particular initial state for which the walk is transient. We generalize the Grover walk to show that one can construct in arbitrary dimensions a quantum walk which is recurrent. This is in great contrast with classical walks which are recurrent only for the dimensions $d=1,2$. Finally, we analyze the recurrence of the 2D Fourier walk. This quantum walk is recurrent except for a two-dimensional subspace of the initial states. We provide an estimation of the P\'olya number in its dependence on the initial state.

arXiv:0805.1322•Physical Review A•Sep 3, 2008•76 citations
Abstract Localization phenomena of quantum walks makes the propagation dynamics of a walker strikingly different from that corresponding to classical random walks. In this paper, we study the localization phenomena of four-state discrete-time quantum walks on two-dimensional lattices with coin operators as one-parameter orthogonal matrices that are also permutative, a combinatorial structure of the Grover matrix. We show that the proposed walks localize at its initial position for canonical initial coin states when the coin belongs to classes which contain the Grover matrix that we consider in this paper, however, the localization phenomena depends on the coin parameter when the class of parametric coins does not contain the Grover matrix.
One of the unique features of discrete-time quantum walks is called trapping, meaning the inability of the quantum walker to completely escape from its initial position, although the system is translationally invariant. The effect is dependent on the dimension and the explicit form of the local coin. A four-state discrete-time quantum walk on a square lattice is defined by its unitary coin operator, acting on the four-dimensional coin Hilbert space. The well-known example of the Grover coin leads to a partial trapping, i.e., there exists some escaping initial state for which the probability of staying at the initial position vanishes. On the other hand, some other coins are known to exhibit strong trapping, where such an escaping state does not exist. We present a systematic study of coins leading to trapping, explicitly construct all such coins for discrete-time quantum walks on the two-dimensional square lattice, and classify them according to the structure of the operator and the manifestation of the trapping effect. We distinguish three types of trapping coins exhibiting distinct dynamical properties, as exemplified by the existence or nonexistence of the escaping state and the area covered by the spreading wave packet.
Quantum walk (QW) is the quantum analog of the random walk. QW is an integral part of the development of numerous quantum algorithms. Hence, an in-depth understanding of QW helps us to grasp the quantum algorithms. We revisit the one-dimensional discrete-time QW and discuss basic steps in detail by incorporating the most general coin operator, constant in both space and time, and a localized initial state using numerical modeling. We investigate the impact of each parameter of the general coin operator on the probability distribution of the quantum walker. We show that by tuning the parameters of the general coin, one can regulate the probability distribution of the walker. We provide an algorithm for the one-dimensional quantum walk driven by the general coin operator. The study on general coin operators also includes the popular coins – Hadamard, Grover, and Fourier.
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.
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.
The P\'olya number characterizes the recurrence of a random walk. We apply the generalization of this concept to quantum walks [M. \ifmmode \check{S}\else \v{S}\fi{}tefa\ifmmode \check{n}\else \v{n}\fi{}\'ak et al., Phys. Rev. Lett. 100, 020501 (2008)] which is based on a specific measurement scheme. The P\'olya number of a quantum walk depends, in general, on the choice of the coin and the initial coin state, in contrast to classical random walks where the lattice dimension uniquely determines it. We analyze several examples to depict the variety of possible recurrence properties. First, we show that for the class of quantum walks driven by Hadamard tensor-product coins, the P\'olya number is independent of the initial conditions and the actual coin operators, thus resembling the property of the classical walks. We provide an estimation of the P\'olya number for this class of quantum walks. Second, we examine the two-dimensional Grover walk, which exhibits localization and thus is recurrent, except for a particular initial state for which the walk is transient. We generalize the Grover walk to show that one can construct in arbitrary dimensions a quantum walk which is recurrent. This is in great contrast with classical walks which are recurrent only for the dimensions d=1,2d=1,2d=1,2. Finally, we analyze the recurrence of the 2D Fourier walk. This quantum walk is recurrent except for a two-dimensional subspace of the initial states. We provide an estimation of the P\'olya number in its dependence on the initial state.