In this paper the return probability of the one-dimensional discrete-time quantum walk is studied. We derive probabilistic formulas for the return probability related to the quantum walk governed by the Fibonacci coin.
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 In the existing literature, a sojourn time of a discrete-time quantum walk is not a random variable. To solve this problem, we redefine the sojourn time of a quantum walk where its coin evolution operator can be general. We first discuss a class of quantum walks governed by flip operators. We cumulatively calculate how much time a walker spends in the set of non-negative integers up to a fixed evolution time. Whether a walker makes a left or right evolution, we add up the staying times as long as it stays within the target set. We define a sojourn time as the total amount of the staying times. Compared with existing definitions, we show that this definition can satisfy the probability normalization. From this, we define a random variable about the sojourn time and discuss its probability distribution. We build a mathematical model to characterize a sojourn time that is embedded into a quantum walk. These results are also valid for a class of quantum walks governed by general coin operators. We also give a method for calculating the sojourn time and analyze the shape features of its probability distribution.
An explicit formula of the Hamiltonians generating one-dimensional discrete-time quantum walks is given. The formula is deduced by using the algebraic structure introduced before. The square of the Hamiltonian turns out to be an operator without, essentially, the ``coin register,'' and hence it can be compared with the one-dimensional continuous-time quantum walk. It is shown that, under a limit with respect to a parameter, which expresses the magnitude of the diagonal components of the unitary matrix defining the discrete-time quantum walks, the one-dimensional continuous-time quantum walk is obtained from operators defined through the Hamiltonians of the one-dimensional discrete-time quantum walks. Thus, this result can be regarded, in one-dimension, as a partial answer to a problem proposed by Ambainis.