We address the properties of continuous-time quantum walks with Hamiltonians of the form $\mathcal{H}= L + λL^2$, being $L$ the Laplacian matrix of the underlying graph and being the perturbation $λL^2$ motivated by its potential use to introduce next-nearest-neighbor hopping. We consider cycle, complete, and star graphs because paradigmatic models with low/high connectivity and/or symmetry. First, we investigate the dynamics of an initially localized walker. Then, we devote attention to estimating the perturbation parameter $λ$ using only a snapshot of the walker dynamics. Our analysis shows that a walker on a cycle graph is spreading ballistically independently of the perturbation, whereas on complete and star graphs one observes perturbation-dependent revivals and strong localization phenomena. Concerning the estimation of the perturbation, we determine the walker preparations and the simple graphs that maximize the Quantum Fisher Information. We also assess the performance of position measurement, which turns out to be optimal, or nearly optimal, in several situations of interest. Besides fundamental interest, our study may find applications in designing enhanced algorithms on graphs.
Quantum computers are susceptible to noises from the outside world. We investigate the effect of perturbation on the hitting time of a quantum walk and the stationary distribution prepared by a quantum walk based algorithm. The perturbation comes from quantizing a transition matrix Q with perturbation E (errors). We bound the perturbed quantum walk hitting time from above by applying Szegedy's work and the perturbation bounds with Weyl's perturbation theorem on classical matrix. Based on an efficient quantum sample preparation approach invented in {\em speed-up via quantum sampling} and the pe…
The hitting time is the required minimum time for a Markov chain-based walk (classical or quantum) to reach a target state in the state space. We investigate the effect of the perturbation on the hitting time of a quantum walk. We obtain an upper bound for the perturbed quantum walk hitting time by applying Szegedy's work and the perturbation bounds with Weyl's perturbation theorem on classical matrix. Based on the definition of quantum hitting time given in MNRS algorithm, we further compute the delayed perturbed hitting time (DPHT) and delayed perturbed quantum hitting time (DPQHT). We show …
A quantum walk algorithm can detect the presence of a marked vertex on a graph quadratically faster than the corresponding random walk algorithm (Szegedy, FOCS 2004). However, quantum algorithms that actually find a marked element quadratically faster than a classical random walk were only known for the special case when the marked set consists of just a single vertex, or in the case of some specific graphs. We present a new quantum algorithm for finding a marked vertex in any graph, with any set of marked vertices, that is (up to a log factor) quadratically faster than the corresponding class…
We identify a key difference between quantum search by discrete- and continuous-time quantum walks: a discrete-time walk typically performs one walk step per oracle query, whereas a continuous-time walk can effectively perform multiple walk steps per query while only counting query time. As a result, we show that continuous-time quantum walks can outperform their discrete-time counterparts, even though both achieve quadratic speedups over their corresponding classical random walks. To provide greater equity, we allow the discrete-time quantum walk to also take multiple walk steps per oracle qu…
A number of recent studies have investigated the introduction of decoherence in quantum walks and the resulting transition to classical random walks. Interestingly, it has been shown that algorithmic properties of quantum walks with decoherence such as the spreading rate are sometimes better than their purely quantum counterparts. Not only quantum walks with decoherence provide a generalization of quantum walks that naturally encompasses both the quantum and classical case, but they also give rise to new and different probability distribution. The application of quantum walks with decoherence …
Continuous-time quantum walks provide a natural framework to tackle the fundamental problem of finding a node among a set of marked nodes in a graph, known as spatial search. Whether spatial search by continuous-time quantum walk provides a quadratic advantage over classical random walks has been an outstanding problem. Thus far, this advantage is obtained only for specific graphs or when a single node of the underlying graph is marked. In this article, we provide a new continuous-time quantum walk search algorithm that completely resolves this: our algorithm can find a marked node in any grap…
We analyze the process of simultaneous photon pair generation and quantum walks realized by spontaneous parametric down conversion of a pump beam in a quadratic nonlinear waveguide array. We demonstrate that this flexible platform allows for creating quantum states with different spatial correlations. In particular, we predict that the output photon correlations can be switched from photon bunching to antibunching controlled entirely classically by varying the temperature of the array or the spatial profile of the pump beam.
Quantum walks are standard tools for searching graphs for marked vertices, and they often yield quadratic speedups over a classical random walk's hitting time. In some exceptional cases, however, the system only evolves by sign flips, staying in a uniform probability distribution for all time. We prove that the one-dimensional periodic lattice or cycle with any arrangement of marked vertices is such an exceptional configuration. Using this discovery, we construct a search problem where the quantum walk's random sampling yields an arbitrary speedup in query complexity over the classical random …
We show how multi-walker quantum walks can be implemented in a quantum quincunx created via cavity quantum electrodynamics. The implementation of a quantum walk with a multi-walker opens up the interesting possibility to introduce entanglement and more advanced walks. With different coin tosses and initial states the multi-walker quantum walk shows different probability distributions which deviate strongly from the classical random walks with quadratic enhanced spreadings and localization effects. By introducing decoherence, the transition from quantum walks to the classical versions is observ…
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.
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…
Quantum walks are well-known for their ballistic dispersion, traveling $Θ(t)$ away in $t$ steps, which is quadratically faster than a classical random walk's diffusive spreading. In physical implementations of the walk, however, the particle may need to tunnel through a potential barrier to hop, and a naive calculation suggests this could eliminate the ballistic transport. We show by explicit calculation, however, that such a loss does not occur. Rather, the $Θ(t)$ dispersion is retained, with only the coefficient changing, which additionally gives a way to detect and quantify the hopping erro…
The lackadaisical quantum walk is a quantum analogue of the lazy random walk obtained by adding a self-loop to each vertex in the graph. We analytically prove that lackadaisical quantum walks can find a unique marked vertex on any regular locally arc-transitive graph with constant success probability quadratically faster than the hitting time. This result proves several speculations and numerical findings in previous work, including the conjectures that the lackadaisical quantum walk finds a unique marked vertex with constant success probability on the torus, cycle, Johnson graphs, and other c…
Quantum versions of random walks on the line and cycle show a quadratic improvement in their spreading rate and mixing times respectively. The addition of decoherence to the quantum walk produces a more uniform distribution on the line, and even faster mixing on the cycle by removing the need for time-averaging to obtain a uniform distribution. We calculate numerically the entanglement between the coin and the position of the quantum walker and show that the optimal decoherence rates are such that all the entanglement is just removed by the time the final measurement is made.
We report the position-inhomogeneous quantum walk (IQW) can be utilized to produce the maximal high dimensional entanglement while maintaining the quadratic speedup spread of the wave-function. Our calculations show that the maximal coin-walker entanglement can be generated in any odd steps or asymptotically in even steps, and the nearly maximal entanglement can be obtained in even steps after $2$. We implement the IQW by a stable resource-saving time-bin optical network, in which a polarization Sagnac loop is employed to realize the precisely tunable phase shift. Our approach opens up an effi…
Discrete time (coined) quantum walks are produced by the repeated application of a constant unitary transformation to a quantum system. By recasting these walks into the setting of periodic perturbations to an otherwise freely evolving system we introduce the concept of a stroboscopic quantum walk. Through numerical simulation, we establish the link between families of stroboscopic walks and quantum resonances. These are observed in the nonlinear systems of quantum chaos theory such as the delta-kicked rotator or the delta-kicked accelerator.
We study the motion of two non-interacting quantum particles performing a random walk on a line and analyze the probability that the two particles are detected at a particular position after a certain number of steps (meeting problem). The results are compared to the corresponding classical problem and differences are pointed out. Analytic formulas for the meeting probability and its asymptotic behavior are derived. The decay of the meeting probability for distinguishable particles is faster then in the classical case, but not quadratically faster. Entangled initial states and the bosonic or f…
We set the ground for a theory of quantum walks on graphs- the generalization of random walks on finite graphs to the quantum world. Such quantum walks do not converge to any stationary distribution, as they are unitary and reversible. However, by suitably relaxing the definition, we can obtain a measure of how fast the quantum walk spreads or how confined the quantum walk stays in a small neighborhood. We give definitions of mixing time, filling time, dispersion time. We show that in all these measures, the quantum walk on the cycle is almost quadratically faster then its classical correspond…
We look at two possible routes to classical behavior for the discrete quantum random walk on the line: decoherence in the quantum ``coin'' which drives the walk, or the use of higher-dimensional coins to dilute the effects of interference. We use the position variance as an indicator of classical behavior, and find analytical expressions for this in the long-time limit; we see that the multicoin walk retains the ``quantum'' quadratic growth of the variance except in the limit of a new coin for every step, while the walk with decoherence exhibits ``classical'' linear growth of the variance even…
We show how a quantum walk can be used to find a marked edge or a marked complete subgraph of a complete graph. We employ a version of a quantum walk, the scattering walk, which lends itself to experimental implementation. The edges are marked by adding elements to them that impart a specific phase shift to the particle as it enters or leaves the edge. If the complete graph has N vertices and the subgraph has K vertices, the particle becomes localized on the subgraph in O(N/K) steps. This leads to a quantum search that is quadratically faster than a corresponding classical search. We show how …
The one dimensional quantum walk of anyonic systems is presented. The anyonic walker performs braiding operations with stationary anyons of the same type ordered canonically on the line of the walk. Abelian as well as non-Abelian anyons are studied and it is shown that they have very different properties. Abelian anyonic walks demonstrate the expected quadratic quantum speedup. Non-Abelian anyonic walks are much more subtle. The exponential increase of the system's Hilbert space and the particular statistical evolution of non-Abelian anyons give a variety of new behaviors. The position distrib…
We have derived an analytical expression for variance of homogeneous-position decoherent quantum walk (HPDQW) with general form of noise on its position, and have shown that, while the quadratic ($t^2$) term of variance never changes by position decoherency, the linear term ($t$) does and always increases the variance. We study the walker with ability to tunnel out to $d$ nearest neighbors as an example and compare our result with former studies. We also show that, although our expression have been derived for asymptotic case, the rapid decay of time-dependent terms cause the expressions to 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…
A scheme for implementing the discrete-time quantum walk on the Bloch sphere is proposed, which is closely related to the SU(2) group. A spin cluster serves as the walker, whereas its location on the Bloch sphere is described by the spin coherent state. An additional spin that interacts with the spin cluster plays the role of a coin, whose state determines the rotation of the spin cluster. The Wigner function is calculated to visualize the movement of the walker on the Bloch sphere, with which the probability distribution and the standard deviation are also achieved. The quadratic enhancement …
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 optic…
Quantum walks on graphs have shown prioritized benefits and applications in wide areas. In some scenarios, however, it may be more natural and accurate to mandate high-order relationships for hypergraphs, due to the density of information stored inherently. Therefore, we can explore the potential of quantum walks on hypergraphs. In this paper, by presenting the one-to-one correspondence between regular uniform hypergraphs and bipartite graphs, we construct a model for quantum walks on bipartite graphs of regular uniform hypergraphs with Szegedy's quantum walks, which gives rise to a quadratic …
In this article we investigate the effects of shifting position decoherence, arisen from the tunneling effect in the experimental realization of the quantum walk, on the one-dimensional discreet time quantum walk. We show that in the regime of this type of noise the quantum behavior of the walker does not fade, in contrary to the coin decoherence for which the walker undergos the quantum-to-classical transition even for weak noise. Particularly, we show that the quadratic dependency of the variance on the time and also the coin-position entanglement, i.e. two important quantum aspects of the c…
Accelerating quantum Gibbs sampling without quantum walks
Virginia Tech（弗吉尼亚理工大学）；Simons Institute for the Theory of Computing, University of California, Berkeley（加州大学伯克利分校西蒙斯理论计算研究所）；Department of Mathematics, University of California, Berkeley（加州大学伯克利分校数学系）；Department of Computing and Mathematical Sciences, California Institute of Technology（加州理工学院计算与数学科学系）；Lawrence Berkeley National Laboratory（劳伦斯伯克利国家实验室）
Quantum walks are promising for information processing tasks because on regular graphs they spread quadratically faster than random walks. Static disorder, however, can turn the tables: unlike random walks, quantum walks can suffer Anderson localization, whereby the spread of the walker stays within a finite region even in the infinite time limit. It is therefore important to understand when we can expect a quantum walk to be Anderson localized and when we can expect it to spread to infinity even in the presence of disorder. In this work we analyze the response of a generic one-dimensional qua…
We give a quantum algorithm for finding a marked element on the grid when there are multiple marked elements. Our algorithm uses quadratically fewer steps than a random walk on the grid, ignoring logarithmic factors. This is the first known quantum walk that finds a marked element in a number of steps less than the square-root of the extended hitting time. We also give a new tighter upper bound on the extended hitting time of a marked subset, expressed in terms of the hitting times of its members.
A second-order many-body perturbation correction to the relativistic Dirac-Hartree-Fock energy is evaluated stochastically by integrating 13-dimensional products of four-component spinors and Coulomb potentials. The integration in the real space of electron coordinates is carried out by the Monte Carlo (MC) method with the Metropolis sampling, whereas the MC integration in the imaginary-time domain is performed by the inverse-CDF (cumulative distribution function) method. The computational cost to reach a given relative statistical error for spatially compact but heavy molecules is observed to…
We present an approach using quantum walks (QWs) to redistribute ultracold atoms in an optical lattice. Different density profiles of atoms can be obtained by exploiting the controllable properties of QWs, such as the variance and the probability distribution in position space using quantum coin parameters and engineered noise. The QW evolves the density profile of atoms in a superposition of position space resulting in a quadratic speedup of the process of quantum phase transition. We also discuss implementation in presently available setups of ultracold atoms in optical lattices.
We consider gravitational perturbation around maximally symmetric background of a theory of gravity involving quadratic curvature correction. This leads to a decoupled model of the standard transverse, traceless graviton mode and an additional scalar degree of freedom. Evolution of the latter is governed by a Lagrangian, which depends on higher derivative terms, inherited from the quadratic curvature correction in the action. It turns out that stability of the gravitational theory allows the scalar sector to choose between possible lowest energy states (or, ground states), that can sustain per…
