Search results for "quantum walk"
showing 10 items of 70 documents
Readout of quantum information spreading using a disordered quantum walk
2021
We design a quantum probing protocol using quantum walks to investigate the quantum information spreading pattern. We employ quantum Fisher information as a figure of merit to quantify extractable information about an unknown parameter encoded within the quantum walk evolution. Although the approach is universal, we focus on the coherent static and dynamic disorder to investigate anomalous and classical transport as well as Anderson localization. We provide a feasible experimental strategy to implement, in principle, the quantum probing protocol based on the quantum Fisher information using a Mach–Zehnder-like interferometric setup. Our results show that a quantum walk can be considered as …
Irreconcilable Difference Between Quantum Walks and Adiabatic Quantum Computing
2016
Continuous-time quantum walks and adiabatic quantum evolution are two general techniques for quantum computing, both of which are described by Hamiltonians that govern their evolutions by Schr\"odinger's equation. In the former, the Hamiltonian is fixed, while in the latter, the Hamiltonian varies with time. As a result, their formulations of Grover's algorithm evolve differently through Hilbert space. We show that this difference is fundamental; they cannot be made to evolve along each other's path without introducing structure more powerful than the standard oracle for unstructured search. For an adiabatic quantum evolution to evolve like the quantum walk search algorithm, it must interpo…
Engineering the Success of Quantum Walk Search Using Weighted Graphs
2016
Continuous-time quantum walks are natural tools for spatial search, where one searches for a marked vertex in a graph. Sometimes, the structure of the graph causes the walker to get trapped, such that the probability of finding the marked vertex is limited. We give an example with two linked cliques, proving that the captive probability can be liberated by increasing the weights of the links. This allows the search to succeed with probability 1 without increasing the energy scaling of the algorithm. Further increasing the weights, however, slows the runtime, so the optimal search requires weights that are neither too weak nor too strong.
Faster Quantum Walk Search on a Weighted Graph
2015
A randomly walking quantum particle evolving by Schr\"odinger's equation searches for a unique marked vertex on the "simplex of complete graphs" in time $\Theta(N^{3/4})$. In this paper, we give a weighted version of this graph that preserves vertex-transitivity, and we show that the time to search on it can be reduced to nearly $\Theta(\sqrt{N})$. To prove this, we introduce two novel extensions to degenerate perturbation theory: an adjustment that distinguishes the weights of the edges, and a method to determine how precisely the jumping rate of the quantum walk must be chosen.
Quantum walk on the line through potential barriers
2015
Quantum walks are well-known for their ballistic dispersion, traveling $\Theta(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 $\Theta(t)$ dispersion is retained, with only the coefficient changing, which additionally gives a way to detect and quantify the hopping errors in experiments.
Spatial Search by Continuous-Time Quantum Walk with Multiple Marked Vertices
2015
In the typical spatial search problems solved by continuous-time quantum walk, changing the location of the marked vertices does not alter the search problem. In this paper, we consider search when this is no longer true. In particular, we analytically solve search on the "simplex of $K_M$ complete graphs" with all configurations of two marked vertices, two configurations of $M+1$ marked vertices, and two configurations of $2(M+1)$ marked vertices, showing that the location of the marked vertices can dramatically influence the required jumping rate of the quantum walk, such that using the wrong configuration's value can cause the search to fail. This sensitivity to the jumping rate is an is…
Electromagnetic lattice gauge invariance in two-dimensional discrete-time quantum walks
2018
International audience; Gauge invariance is one of the more important concepts in physics. We discuss this concept in connection with the unitary evolution of discrete-time quantum walks in one and two spatial dimensions, when they include the interaction with synthetic, external electromagnetic fields. One introduces this interaction as additional phases that play the role of gauge fields. Here, we present a way to incorporate those phases, which differs from previous works. Our proposal allows the discrete derivatives, that appear under a gauge transformation, to treat time and space on the same footing, in a way which is similar to standard lattice gauge theories. By considering two step…
Unveiling two-dimensional discrete quantum walks dynamics via dispersion relations
2011
The discrete, or coined, quantum walk (QW) [1] is a process originally introduced as the quantum counterpart of the classical random walk (RW). In both cases there is a walker and a coin: at every time step the coin is tossed and the walker moves depending on the toss output. Unlike the RW, in the QW the walker and coin are quantum in nature what allows the coherent superpositions right/left and head/tail happen. This feature endows the QW with outstanding properties, such as making the standard deviation of the position of an initially localized walker grow linearly with time t, unlike the RW in which this growth goes as t1/2. This has strong consequences in algorithmics and is one of the …
Multidimensional quantum walks: Diabolical points, optical wave-like propagation, and multipartite entanglement
2013
Quantum walks (QWs) are important for quantum information science, but are becoming also interesting for other fields of research as this simple quantum diffusion model finds analogues in diverse physical systems, optical ones in particular. The experimental capabilities regarding QWs have remarkably increased along recent years and several aspects of QWs are now open to experimental research, multidimensional QWs in particular [1].
Spatial Search by Quantum Walk is Optimal for Almost all Graphs.
2015
The problem of finding a marked node in a graph can be solved by the spatial search algorithm based on continuous-time quantum walks (CTQW). However, this algorithm is known to run in optimal time only for a handful of graphs. In this work, we prove that for Erd\"os-Renyi random graphs, i.e.\ graphs of $n$ vertices where each edge exists with probability $p$, search by CTQW is \textit{almost surely} optimal as long as $p\geq \log^{3/2}(n)/n$. Consequently, we show that quantum spatial search is in fact optimal for \emph{almost all} graphs, meaning that the fraction of graphs of $n$ vertices for which this optimality holds tends to one in the asymptotic limit. We obtain this result by provin…