Related papers: Localization of Two-Dimensional Quantum Walks
Quantum walks are quantum counterparts of random walks and their probability distributions are different from each other. A quantum walker distributes on a Hilbert space and it is observed at a location with a probability. The finding…
We study a quantum walk (QW) whose time evolution is induced by a random walk (RW) first introduced by Szegedy (2004). We focus on a relation between recurrent properties of the RW and localization of the corresponding QW. We find the…
There is a property called localization, which is essential for applications of quantum walks. From a mathematical point of view, the occurrence of localization is known to be equivalent to the existence of eigenvalues of the time evolution…
The existence of localization for the Grover walk on the multi-dimensional lattice is known. This paper gives some conditions for the existence of localization for the space-homogeneous quantum walks. We also prove that localization does…
The quantum walk differs fundamentally from the classical random walk in a number of ways, including its linear spreading and initial condition dependent asymmetries. Using stationary phase approximations, precise asymptotics have been…
Based on studies on four specific networks, we conjecture a general relation between the walk dimensions $d_{w}$ of discrete-time random walks and quantum walks with the (self-inverse) Grover coin. In each case, we find that $d_{w}$ of the…
Localization is a characteristic phenomenon of space-inhomogeneous quantum walks in one dimension, where particles remain localized around their initial position. The existence of eigenvalues of time evolution operators is a necessary and…
We focus on a 2-period time-dependent quantum walk on the half line in this paper. The quantum walker launches at the edge of the half line in a localized superposition state and its time evolution is carried out with two unitary operations…
We present a generalized definition of discrete-time quantum walks convenient for capturing a rather broad spectrum of walker's behavior on arbitrary graphs. It includes and covers both: the geometry of possible walker's positions with…
We consider discrete-time evolution equations in which the stochastic operator of a classical random walk is replaced by a unitary operator. Such a problem has gained much attention as a framework for coined quantum walks that are essential…
The phenomenon of localization usually happens due to the existence of disorder in a medium. Nevertheless, certain quantum systems allow dynamical localization solely due to the nature of internal interactions. We study a discrete time…
We present a new scheme for a discrete-time quantum walk on two- and three-dimensional lattices using a two-state particle. We use different Pauli basis as translational eigestates for different axis and show that the coin operation, which…
The dynamics of a one dimensional quantum walker on the lattice with two internal degrees of freedom, the coin states, is considered. The discrete time unitary dynamics is determined by the repeated action of a coin operator in U(2) on the…
We formulate Grover's unstructured search algorithm as a chiral quantum walk, where transitioning in one direction has a phase conjugate to transitioning in the opposite direction. For small phases, this breaking of time-reversal symmetry…
Multilayer network is a potent platform which paves a way to study the interactions among entities in various networks with multiple types of relationships. In this study, the dynamics of discrete-time quantum walk on a multilayer network…
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, albeit the system is translationally invariant. The effect is…
We show analytically that particle trapping appears in a quantum process called "quantum walk", in which the particle moves macroscopically correlating to the inner states. It has been well known that a particle in the ``Hadamard walk" with…
We consider quantum walks defined on arbitrary infinite graphs, parameterized by a family of scattering matrices attached to the vertices. Multiplying each scattering matrix by an i.i.d. random phase, we obtain a random scattering quantum…
Recurrence of a random walk is described by the Polya number. For quantum walks, recurrence is understood as the return of the walker to the origin, rather than the full-revival of its quantum state. Localization for two dimensional quantum…
Localization is a critical aspect of mobile robotics, enabling robots to navigate their environment efficiently and avoid obstacles. Current probabilistic localization methods, such as the Adaptive-Monte Carlo localization (AMCL) algorithm,…