Quantum walks are powerful tools not only to construct the quantum speedup algorithms but also to describe specific models in physical processes.Furthermore, the discrete time quantum walk has been experimentally realized in various setups.We show the limit distribution of the discrete time quantum walk with the periodic position measurement under the time scale transformation.
Quantum walks are powerful tools not only to construct the quantum speedup algorithms but also to describe specific models in physical processes.Furthermore, the discrete time quantum walk has been experimentally realized in various setups.We show the limit distribution of the discrete time quantum walk with the periodic position measurement under the time scale transformation.
Quantum walks are powerful tools not only for constructing the quantum speedup algorithms but also for describing specific models in physical processes. Furthermore, the discrete time quantum walk has been experimentally realized in various setups. We apply the concept of the quantum walk to the problems in quantum foundations. We show that randomness and the arrow of time in the quantum walk gradually emerge by periodic projective measurements from the mathematically obtained limit distribution under the time-scale transformation.
This dissertation presents investigations on dynamics of discrete-time quantum walk and some of its applications. Quantum walks has been exploited as an useful tool for quantum algorithms in quantum computing. Beyond quantum computational purposes, it has been used to explain and control the dynamics in various physical systems. In order to use the quantum walk to its fullest potential, it is important to know and optimize the properties purely due to quantum dynamics and in presence of noise. Various studies of its dynamics in the absence and presence of noise have been reported. We propose new approaches to optimize the dynamics, discuss symmetries and effect of noise on the quantum walk. Making use of its properties, we propose the use of quantum walk as an efficient new tool for various applications in physical systems and quantum information processing. In the first and second part of this dissertation, we discuss evolution process of the quantum walks, propose and demonstrate the optimization of discrete-time quantum walk using quantum coin operation from SU(2) group and discuss some of its properties. We investigate symmetry operations and environmental effects on dynamics of the walk on a line and an n-cycle highlighting the interplay between noise and topology. Using the properties and behavior of quantum walk discussed in part two, in part three we propose the application of quantum walk to realize quantum phase transition in optical lattice, that is to efficiently control and redistribute ultracold atoms in optical lattice. We also discuss the implementation scheme. Another application we consider is creation of spatial entanglement using quantum walk on a quantum many body system.
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(NlogN), 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) 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).
Quantum walks, a counterpart of classical random walks, have many applications due to their neoteric features. Since they were first proposed, quantum walks have been explored in many fields theoretically and have also been demonstrated experimentally in various physical systems. In this paper, we review the experimental realizations of discrete-time quantum walks in photonic systems with different physical structures, such as bulk optics and time-multiplexed framework. Then, some typical applications using quantum walks are introduced. Finally, the advantages and disadvantages of these physical systems are discussed.