We propose a robust and efficient way to store and transport quantum information via one-dimensional discrete time quantum walks. We show how to attain an effective dispersionless wave packet evolution using only two types of local unitary operators (quantum coins or gates), properly engineered to act at predetermined times and at specific lattice sites during the system's time evolution. In particular, we show that a qubit initially localized about a Gaussian distribution can be almost perfectly confined during long times or sent hundreds lattice sites away from its original location and later almost perfectly reconstructed using only Hadamard and $\sigma_x$ gates.
We propose a robust and efficient way to store and transport quantum information via one-dimensional discrete time quantum walks. We show how to attain an effective dispersionless wave packet evolution using only two types of local unitary operators (quantum coins or gates), properly engineered to act at predetermined times and at specific lattice sites during the system's time evolution. In particular, we show that a qubit initially localized about a Gaussian distribution can be almost perfectly confined during long times or sent hundreds lattice sites away from its original location and later almost perfectly reconstructed using only Hadamard and σx gates.
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.
A coinless, discrete-time quantum walk possesses a Hilbert space whose dimension is smaller compared to the widely studied coined walk. Coined walks require the direct product of the site basis with the coin space; coinless walks operate purely in the site basis, which is clearly minimal. These coinless quantum walks have received considerable attention recently because they have evolution operators that can be obtained by a graphical method based on lattice tessellations and they have been shown to be as efficient as the best known coined walks when used as a quantum search algorithm. We argue that both formulations in their most general form are equivalent. In particular, we demonstrate how to transform the one-dimensional version of the coinless quantum walk into an equivalent extended coined version for a specific family of evolution operators. We present some of its basic, asymptotic features for the one-dimensional lattice with some examples of tessellations, and analyze the mixing time and limiting probability distributions on cycles.
We show that a perfect state transfer of an arbitrary unknown two-qubit state can be achieved via a discrete-time quantum walk with various settings of coin flips and extend this method to the distribution of an arbitrary unknown multiqubit entangled state between every pair of sites in the multidimensional network. Furthermore, we study the routing of quantum information on this network in a quantum-walk architecture, which can be used as quantum information processors to communicate between separated qubits.
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 have wide applications in quantum information, such as universal quantum computation, so it is important to explore properties of quantum walks thoroughly. We propose a novel method to implement discrete-time quantum walks (DTQWs) using only a single qubit, in which both coin and walker are encoded in the two-dimensional state space of a single qubit, operations are realized using single-qubit gates only, and high-dimensional final states of DTQWs can be obtained naturally. With this "one-qubit" approach, DTQW experiments can be realized much more easily, compared with previous methods, in most quantum systems and all properties based on quantum states of DTQWs (such as quantum correlation and coherence) can be investigated. By this approach, we experimentally implement one-particle and two-particle DTQWs with seven steps using single photons. Furthermore, we systematically investigate quantum correlations and coherence (based on the full state of the coin and walker) of the DTQW systems with different initial states of the coin, which have not been obtained and studied in DTQW experiments. As an application, we also study the assisted distillation of quantum coherence using the full state of the two-particle DTQW from the experiment. The maximal increase in distillable coherence for high-dimensional mixed states is investigated for the first time by obtaining its upper and lower bounds. Our work opens a new door to implement DTQW experiments and to better explore properties of quantum walks.
We investigate the evolution dynamics of inhomogeneous discrete-time one-dimensional quantum walks displaying long-range correlations in both space and time. The associated quantum coin operators of internal states are built to exhibit random inhomogeneity distribution of long-range correlations embedded in the time evolution protocol through a fractional Brownian motion with spectrum following a power-law behavior, S(k)∼1/k^{ν}. From extensive numerical simulations with averages over a large number of independent realizations of the phases of quantum coins, the power-law correlated disorder encoded in the coin phases is shown to give rise to a wide variety of spreading patterns of the qubit states, from localized to subdiffusive, diffusive, and superdiffusive (including ballistic) behavior, depending on the relative strength of the parameters driving the correlation degree. Dispersion control is possible in one-dimensional discrete-time quantum walks by tuning the long-range correlation properties assigned to the inhomogeneous quantum coin operator.