Quantization and asymptotic behaviour of a variant of discrete random walk on integers are investigated. This variant, the $ε_{V^{k}}$ walk, has the novel feature that it uses many identical quantum coins keeping at the same time characteristic quantum features like the quadratically faster than the classical spreading rate, and unexpected distribution cutoffs. A weak limit of the position probability distribution (pd) is obtained, and universal properties of this arch sine asymptotic distribution function are examined. Questions of driving the walk are investigated by means of a quantum optical interaction model that reveals robustness of quantum features of walker's asymptotic pd, against stimulated and spontaneous quantum noise on the coin system.
Rules for quantizing the walker+coin parts of a classical random walk are provided by treating them as interacting quantum systems. A quantum optical random walk (QORW), is introduced by means of a new rule that treats quantum or classical noise affecting the coin's state, as sources of quantization. The long term asymptotic statistics of QORW walker's position that shows enhanced diffusion rates as compared to classical case, is exactly solved. A quantum optical cavity implementation of the walk provides the framework for quantum simulation of its asymptotic statistics. The simulation utilize…
We study the transport and quantum walk of nonclassical light in an array of coupled waveguides which have novel properties like very low decoherence and thus making them ideal for storage of quantum information. We show how squeezing gets turned over from one waveguide to another. We further show how input nonclassical light can generate entanglement among different waveguides. Our results involve both first quantization due to array structure and second quantization due to the quantum nature of fields and can also be used to discuss the Talbot effect in the quantum regime.
We present a mathematical formalism for the description of unrestricted quantum walks with entangled coins and one walker. The numerical behaviour of such walks is examined when using a Bell state as the initial coin state, two different coin operators, two different shift operators, and one walker. We compare and contrast the performance of these quantum walks with that of a classical random walk consisting of one walker and two maximally correlated coins as well as quantum walks with coins sharing different degrees of entanglement. We illustrate that the behaviour of our walk with entangled …
We consider asymptotic behaviour of a Hadamard walk on a cycle. For a walk which starts with a state in which all the probability is concentrated on one node, we find the explicit formula for the limiting distribution and discuss its asymptotic behaviour when the length of the cycle tends to infinity. We also demonstrate that for a carefully chosen initial state, the limiting distribution of a quantum walk on cycle can lie further away from the uniform distribution than its initial state.
We analyze the asymptotic scaling of persistence of unvisited sites for quantum walks on a line. In contrast to the classical random walk there is no connection between the behaviour of persistence and the scaling of variance. In particular, we find that for a two-state quantum walks persistence follows an inverse power-law where the exponent is determined solely by the coin parameter. Moreover, for a one-parameter family of three-state quantum walks containing the Grover walk the scaling of persistence is given by two contributions. The first is the inverse power-law. The second contribution …
We study the resonances of the quantum kicked rotor subjected to an excitation that follows an aperiodic Fibonacci prescription. In such a case the secondary resonances show a sub-ballistic behaviour like the quantum walk with the same aperiodic prescription for the coin. The principal resonances maintain the well-known ballistic behaviour. Then the parallelism previusly established between the kicked rotor and the generalized quantum walk is retained only with the secondary resonances.
Random walks describe diffusion processes, where movement at every time step is restricted to only the neighbouring locations. We construct a quantum random walk algorithm, based on discretisation of the Dirac evolution operator inspired by staggered lattice fermions. We use it to investigate the spatial search problem, i.e. finding a marked vertex on a $d$-dimensional hypercubic lattice. The restriction on movement hardly matters for $d>2$, and scaling behaviour close to Grover's optimal algorithm (which has no restriction on movement) can be achieved. Using numerical simulations, we optimise…
We demonstrate quantum walks of correlated photons in a 2D network of directly laser written waveguides coupled in a 'swiss cross' arrangement. The correlated detection events show high-visibility quantum interference and unique composite behaviour: strong correlation and independence of the quantum walkers, between and within the planes of the cross. Violations of a classically defined inequality, for photons injected in the same plane and in orthogonal planes, reveal non-classical behaviour in a non-planar structure.
We present a detailed circuit implementation of Szegedy's quantization of the Metropolis-Hastings walk. This quantum walk is usually defined with respect to an oracle. We find that a direct implementation of this oracle requires costly arithmetic operations and thus reformulate the quantum walk in a way that circumvents the implementation of that specific oracle and which closely follows the classical Metropolis-Hastings walk. We also present heuristic quantum algorithms that use the quantum walk in the context of discrete optimization problems and numerically study their performances. Our num…
We perform the fidelity analysis for Boltzmann-Gibbs-like states in order to investigate whether the topological order of 1D fermionic systems at zero temperature is maintained at finite temperatures. We use quantum walk protocols that are known to simulate topological phases and the respective quantum phase transitions for chiral symmetric Hamiltonians. Using the standard approaches of the fidelity analysis and the study of edge states, we conclude that no thermal-like phase transitions occur as temperature increases, i.e., the topological behaviour is washed out gradually. We also show that …
We study electric quantum walks in two dimensions considering Grover, Alternate, Hadamard, and DFT quantum walks. In the Grover walk the behaviour under an electric field is easy to summarize: when the field direction coincides with the x or y axes, it produces a transient trapping of the probability distribution along the direction of the field, while when it is directed along the diagonals, a perfect 2D trapping is frustrated. The analysis of the alternate walk helps to understand the behaviour of the Grover walk as both walks are partially equivalent; in particular, it helps to understand t…
In an interacting continuous time quantum walk, while the walker (the cursor) is moving on a graph, computational primitives (unitary operators associated with the edges) are applied to ancillary qubits (the register). The model with one walker was originally proposed by R. Feynman, who thus anticipated many features of the Continuous Time Quantum Walk (CTWQ) computing paradigm. In this note we examine the behaviour of an interacting CTQW with two walkers and examine the interaction of the walkers with noncommuting primitives. We endow such a walk with a notion of trajectory, in the sense of s…
This tutorial article showcases the many varieties and uses of quantum walks. Discrete time quantum walks are introduced as counterparts of classical random walks. The emphasis is on the connections and differences between the two types of processes (with rather different underlying dynamics) for producing random distributions. We discuss algorithmic applications for graph-searching and compare the two approaches. Next, we look at quantization of Markov chains and show how it can lead to speedups for sampling schemes. Finally, we turn to continuous time quantum walks and their applications, wh…
One goal in the quantum-walk research is the exploitation of the intrinsic quantum nature of multiple walkers, in order to achieve the full computational power of the model. Here we study the behaviour of two non-interacting particles performing a quantum walk on the line when the possibility of lattice imperfections, in the form of missing links, is considered. We investigate two regimes, statical and dynamical percolation, that correspond to different time scales for the imperfections evolution with respect to the quantum-walk one. By studying the qualitative behaviour of three two-particle …
Many disordered systems show a superdiffusive dynamics, intermediate between the diffusive one, typical of a classical stochastic process, and the so called ballistic behaviour, which is generally expected for the spreading in a quantum process. We have experimentally investigated the superdiffusive behaviour of a quantum walk (QW), whose dynamics can be related to energy transport phenomena, with a resolution which is high enough to clearly distinguish between different disorder regimes. By our experimental setup, the region between ballistic and diffusive spreading can be effectively scanned…
The first general analytic solutions for the one-dimensional walk in position and momentum space are derived. These solutions reveal, among other things, new symmetry features of quantum walk probability densities and further insight into the behaviour of their moments. The analytic expressions for the quantum walk probability distributions provide a means of modelling quantum phenomena that is analogous to that provided by random walks in the classical domain.
In a seminal paper, Szegedy showed how to construct a quantum walk $W(P)$ for any reversible Markov chain $P$ such that its eigenvector with eigenphase $0$ is a quantum sample of the limiting distribution of the random walk and its eigenphase gap is quadratically larger than the spectral gap of $P$. The standard construction of Szegedy's quantum walk requires an ancilla register of Hilbert-space dimension equal to the size of the state space of the Markov chain. We show that it is possible to avoid this doubling of state space for certain Markov chains that employ a symmetric proposal probabil…
We consider a discrete time quantum walker in one dimension, where at each step, the step length $\ell$ is chosen from a distribution $P(\ell) \propto \ell^{-δ-1}$ with $\ell \leq \ell_{max}$. We evaluate the probability $f(x,t)$ that the walker is at position $x$ at time $t$ and its first two moments. As expected, the disorder effectively localizes the walk even for large values of $δ$. Asymptotically, $\langle x^2 \rangle \propto t^{3/2}$ and $\langle x \rangle \propto t^{1/2}$ independent of $δ$ and $\ell$, both finite. The scaled distribution $f(x,t)t^{1/2}$ plotted versus $x/t^{1/2}$ show…
We investigate the spatial search problem on the two-dimensional square lattice, using the Dirac evolution operator discretised according to the staggered lattice fermion formalism. $d=2$ is the critical dimension for the spatial search problem, where infrared divergence of the evolution operator leads to logarithmic factors in the scaling behaviour. As a result, the construction used in our accompanying article \cite{dgt2search} provides an $O(\sqrt{N}\log N)$ algorithm, which is not optimal. The scaling behaviour can be improved to $O(\sqrt{N\log N})$ by cleverly controlling the massless Dir…
We introduce the model of generalized open quantum walks on networks using the Transition Operation Matrices formalism. We focus our analysis on the mean first passage time and the average return time in Apollonian networks. These results differ significantly from a classical walk on these networks. We show a comparison of the classical and quantum behaviour of walks on these networks.
A discrete time quantum walker is considered in one dimension, where at each step, the translation can be more than one unit length chosen randomly. In the simplest case, the probability that the distance travelled is $\ell$ is taken as $P(\ell) = αδ(\ell-1) + (1-α) δ(\ell-2^n)$ with $n \geq 1$. Even the $n=1$ case shows a drastic change in the scaling behaviour for any $α\neq 0,1$. Specifically, $\langle x^2\rangle \propto t^{3/2}$ for $0 < α< 1$, implying the walk is slower compared to the usual quantum walk. This scaling behaviour, which is neither conventional quantum nor classical, can be…
Out-of time-ordered correlators (OTOC) have recently attracted significant attention from the physics of many-body systems, to quantum black-holes, with an exponential growth of the OTOC indicating quantum chaos. Here we consider OTOC in the context of coined discrete quantum walks, a very well studied model of quantization of classical random walks with applications to quantum algorithms. Three separate cases of operators, variously localized in the coin and walker spaces, are discussed in this context and it is found that the approximated behavior of the OTOCs is well described by simple alg…
Many paradoxes of quantum mechanics come from the fact that a quantum system can possess different features at the same time, such as in wave-particle duality or quantum superposition. In recent delayed-choice experiments, a quantum mechanical system can be observed to manifest one feature such as the wave or particle nature, depending on the final measurement setup, which is chosen after the system itself has already entered the measuring device; hence its behaviour is not predetermined. Here, we adapt this paradigmatic scheme to multi-dimensional quantum walks. In our experiment, the way in …
In discrete time, coined quantum walks, the coin degrees of freedom offer the potential for a wider range of controls over the evolution of the walk than are available in the continuous time quantum walk. This paper explores some of the possibilities on regular graphs, and also reports periodic behaviour on small cyclic graphs.
Szegedy's quantum walk is a quantization of a classical random walk or Markov chain, where the walk occurs on the edges of the bipartite double cover of the original graph. To search, one can simply quantize a Markov chain with absorbing vertices. Recently, Santos proposed two alternative search algorithms that instead utilize the sign-flip oracle in Grover's algorithm rather than absorbing vertices. In this paper, we show that these two algorithms are exactly equivalent to two algorithms involving coined quantum walks, which are walks on the vertices of the original graph with an internal deg…
We introduce and analyze a one-dimensional quantum walk with two time-independent rotations on the coin. We study the influence on the property of quantum walk due to the second rotation on the coin. Based on the asymptotic solution in the long time limit, a ballistic behaviour of this walk is observed. This quantum walk retains the quadratic growth of the variance if the combined operator of the coin rotations is unitary. That confirms no localization exhibits in this walk. This result can be extended to the walk with multiple time-independent rotations on the coin.
We generalize the quantum random walk protocol for a particle in a one-dimensional chain, by using several types of biased quantum coins, arranged in aperiodic sequences, in a manner that leads to a rich variety of possible wave function evolutions. Quasiperiodic sequences, following the Fibonacci prescription, are of particular interest, leading to a sub-ballistic wavefunction spreading. In contrast, random sequences leads to diffusive spreading, similar to the classical random walk behaviour. We also describe how to experimentally implement these aperiodic sequences.
Motivated by the immense success of random walk and Markov chain methods in the design of classical algorithms, we consider_quantum_ walks on graphs. We analyse in detail the behaviour of unbiased quantum walk on the line, with the example of a typical walk, the ``Hadamard walk''. We show that after t time steps, the probability distribution on the line induced by the Hadamard walk is almost uniformly distributed over the interval [-t/sqrt(2),t/sqrt(2)]. This implies that the same walk defined on the circle mixes in_linear_ time. This is in direct contrast with the quadratic mixing time for th…
Quantized time in quantum walks under weak rank-K measurements
Institut für Physik, Universität Augsburg（奥格斯堡大学物理研究所）；Physics Department, New York City College of TechnologyThe City University of New York（纽约市立大学城市技术学院物理系）
The discrete time quantum walk which is a quantum counterpart of random walk plays important roles in the theory of quantum information theory. In the present paper, we focus on discrete time quantum walks viewed as quantization of random walks on the path. We obtain a weak limit theorem for the time averaged distribution of our quantum walks.
In this survey paper we give an intuitive treatment of the discrete time quantization of classical Markov chains. Grover search and the quantum walk based search algorithms of Ambainis, Szegedy and Magniez et al. will be stated as quantum analogues of classical search procedures. We present a rather detailed description of a somewhat simplified version of the MNRS algorithm. Finally, in the query complexity model, we show how quantum walks can be applied to the following search problems: Element Distinctness, Matrix Product Verification, Restricted Range Associativity, Triangle, and Group Comm…
A discrete time quantum walk is considered in which the step lengths are chosen to be either $1$ or $2$ with the additional feature that the walker is persistent with a probability $p$. This implies that with probability $p$, the walker repeats the step length taken in the previous step and is otherwise antipersistent. We estimate the probability $P(x,t)$ that the walker is at $x$ at time $t$ and the first two moments. Asymptotically, $\langle x^2 \rangle = t^ν$ for all $p$. For the extreme limits $p=0$ and $1$, the walk is known to show ballistic behaviour, i.e., $ν= 2$. As $p$ is varied from…
We provide an explanation of recent experimental results of Xue et al., where full revivals in a time-dependent quantum walk model with a periodically changing coin are found. Using methods originally developed for "electric" walks with a space-dependent, rather than a time-dependent coin, we provide a full explanation of the observations of Xue et al. We extend the analysis from periodic time-dependence to quasi-periodic behaviour with periods incommensurate to the step size. Spectral analysis, one of the principal tools for the study of electric walks, fails for time-dependent systems, but w…
We study continuous time quantum random walk on a comb with infinite teeth and show that the return probability to the starting point decays with time $t$ as $t^{-1}$. We analyse the diffusion along the spine and into the teeth and show that the walk can escape into the teeth with a finite probability and goes to infinity along the spine with a finite probability. The walk along the spine and into the teeth behaves qualitatively as a quantum random walk on a line. This behaviour is quite different from that of classical random walk on the comb.
The role of classical noise in quantum walks (QW) on integers is investigated in the form of discrete dichotomic random variable affecting its reshuffling matrix parametrized as a SU2)/U(1) coset element. Analysis in terms of quantum statistical moments and generating functions, derived by the completely positive trace preserving (CPTP) map governing evolution, reveals a pronounced eventual transition in walk's diffusion mode, from a quantum ballistic regime with rate O(t) to a classical diffusive regime with rate O(\surdt), when condition (strength of noise parameter)^{2}\times(number of step…
