Recent experimental advances have measured individual coin components in discrete time quantum walks, which have not received the due attention in most theoretical studies on the theme. Here is presented a detailed investigation of the properties of M, the difference between square modulus of coin states of discrete quantum walks on a linear chain. Local expectation values are obtained in terms of real and imaginary parts of the Fourier transformed wave function. A simple expression is found for the average difference between coin states in terms of an angle θ gauging the coin operator and its initial state. These results are corroborated by numerical integration of dynamical equations in real space. The local dependence is characterized both by large and short period modulations. The richness of revealed patterns suggests that the amount of information stored and retrieved from quantum walks is significantly enhanced if M is taken into account.
Recent experimental advances have measured individual coin components in discrete time quantum walks, which have not received the due attention in most theoretical studies on the theme. Here is presented a detailed investigation of the properties of M, the difference between square modulus of coin states of discrete quantum walks on a linear chain. Local expectation values are obtained in terms of real and imaginary parts of the Fourier transformed wave function. A simple expression is found for the average difference between coin states in terms of an angle θ gauging the coin operator and its initial state. These results are corroborated by numerical integration of dynamical equations in real space. The local dependence is characterized both by large and short period modulations. The richness of revealed patterns suggests that the amount of information stored and retrieved from quantum walks is significantly enhanced if M is taken into account.
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.
Abstract We investigate the evolution of a discrete-time one-dimensional quantum walk driven by a position-dependent coin. The rotation angle, which depends upon the position of a quantum particle, parameterizes the coin operator. For different values of the rotation angle, we observe that such a coin leads to a variety of probability distributions, e.g. localized, periodic, classical-like, semi-classical-like, and quantum-like. Further, we study the Shannon entropy associated with position and the coin space of a quantum particle, and compare them with the case of the position-independent coin. Our results show that the entropy is smaller for most values of the rotation angle as compared to the case of the position-independent coin. We also study the effect of entanglement on the behavior of probability distribution and Shannon entropy by considering a quantum walk with two identical position-dependent entangled coins. We observe that in general, a wave function becomes more localized as compared to the case of the position-independent coin and hence the corresponding Shannon entropy is lower. Our results show that a position-dependent coin can be used as a controlling tool of quantum walks.
Properties of one-dimensional discrete-time quantum walks (DTQWs) are sensitive to the presence of inhomogeneities in the substrate, which can be generated by defining position-dependent coin operators. Deterministic aperiodic sequences of two or more symbols provide ideal environments where these properties can be explored in a controlled way. Based on an exhaustive numerical study, this work discusses a two-coin model resulting from the construction rules that lead to the usual fractal Cantor set. Although the fraction of the less frequent coin [Formula: see text] as the size of the chain is increased, it leaves peculiar properties in the walker dynamics. They are characterized by the wave function, from which results for the probability distribution and its variance, as well as the entanglement entropy, were obtained. A number of results for different choices of the two coins are presented. The entanglement entropy has shown to be very sensitive to uncovering subtle quantum effects present in the model.
A unit evolution step of discrete-time quantum walks (QWs) is determined by both a coin-flip operator and a position-shift operator. The behavior of quantum walkers after many steps delicately depends on the coin-flip operator and an initial condition of the walk. To get the behavior, a lot of long-time limit distributions for the QWs starting with a localized initial state have been derived. In this paper, we compute limit distributions of a 2-state QW with a delocalized initial state, not a localized initial state, and discuss how the walker depends on the coin-flip operator. The initial state induced from the Fourier series expansion, which is called the (α, β) delocalized initial state in this paper, provides different limit density functions from the ones of the quantum walk with a localized initial state.
The field of quantum information applies the concepts of quantum physics to problems in computer science, and shows great potential for allowing efficient computation. \nIn this thesis I concentrate on a particular quantum information theoretic tool known as the quantum walk. There are two widely studied versions of the quantum walk, the continuous time walk, and the discrete time walk. The discrete time walk is particularly amenable to investigation using numerical methods, from which most of the results in this thesis are derived, and is the main focus of the work presented. Two aspects of the discrete time walk are investigated: their transport properties \nand their interpretation as quantum computers. I investigated the transport properties in two ways, by looking for a particular type of transport known as perfect \nstate transfer, and examining the transport properties of a new type of coin operator. \nThe search for perfect state transfer concentrated on modifications of small cycles. I found that perfect state transfer is rare for the choices of coin operators \ntested. The structures tested for perfect state transfer were based on cycles, and it appears that the type of modification has more of an effect than the size of the \ncycle. This makes intuitive sense, as the modifications found to lead to walks exhibiting perfect state transfer affected only the initial and target node of the cycle. \nI then investigated a new type of coin operator which does not allow amplitude to return to the node it has come from. This effectively simulates a dimer. Using the general form of this type of operator and random variables for each parameter, I found that the expected distance of the walker from the origin, and standard deviation, were independent of the initial condition. The second half of the thesis concentrates on computational applications of quantum \nwalks using the language acceptance model. I first note their equivalence to a type of quantum automaton known as the QFA-WOM, and this provides an intuitive understanding of the role of the WOM. I then use a more direct construction to show that they can accept a range of formal languages. Using this construction allows us to use superpositions of words as inputs, and the insights provided by investigating these suggest a new way of approaching the problem of quantum state discrimination.
Quantum walks, both discrete (coined) and continuous time, form the basis of several recent quantum algorithms. Here we use numerical simulations to study the properties of discrete, coined quantum walks. We investigate the variation in the entanglement between the coin and the position of the particle by calculating the entropy of the reduced density matrix of the coin. We consider both dynamical evolution and asymptotic limits for coins of dimensions from two to eight on regular graphs. For low coin dimensions, quantum walks which spread faster (as measured by the mean square deviation of their distribution from uniform) also exhibit faster convergence towards the asymptotic value of the entanglement between the coin and particle's position. For high-dimensional coins, the DFT coin operator is more efficient at spreading than the Grover coin. We study the entanglement of the coin on regular finite graphs such as cycles, and also show that on complete bipartite graphs, a quantum walk with a Grover coin is always periodic with period four. We generalize the 'glued trees' graph used by Childs et al (2003 Proc. STOC , pp 59–68) to higher branching rate (fan out) and verify that the scaling with branching rate and with tree depth is polynomial.