Related papers: Optimal spatial searches with long-range tunneling
Grover's quantum search algorithm provides a quadratic speedup over the classical one. The computational complexity is based on the number of queries to the oracle. However, depth is a more modern metric for noisy intermediate-scale quantum…
We demonstrate an implementation of the hitting time of a discrete time quantum random walk on cubelike graphs using IBM's Qiskit platform. Our implementation is based on efficient circuits for the Grover and Shift operators. We verify the…
Grover search is a renowned quantum search algorithm that leverages quantum superposition to find a marked item with quadratic speedup. However, when implemented on Noisy Intermediate-scale Quantum (NISQ) hardware, the required repeated…
$ $In its usual form, Grover's quantum search algorithm uses $O(\sqrt{N})$ queries and $O(\sqrt{N} \log N)$ other elementary gates to find a solution in an $N$-bit database. Grover in 2002 showed how to reduce the number of other gates to…
We address the dynamics of continuous-time quantum walk (CTQW) on planar 2D lattice graphs, i.e. those forming a regular tessellation of the Euclidean plane (triangular, square, and honeycomb lattice graphs). We first consider the free…
In a recent work by Novo et al. (Sci. Rep. 5, 13304, 2015), the invariant subspace method was applied to the study of continuous-time quantum walk (CTQW). The method helps to reduce a graph into a simpler version that allows more…
Quantum computation, in particular Grover's algorithm, has aroused a great deal of interest since it allows for a quadratic speedup to be obtained in search procedures. Classical search procedures for an $N$ element database require at most…
Quantum random walk finds application in efficient quantum algorithms as well as in quantum network theory. Here we study the mixing time of a discrete quantum walk over a square lattice in presence percolation and decoherence. We consider…
Grover's unstructured search algorithm is one of the best examples to date for the superiority of quantum algorithms over classical ones. Its applicability, however, has been questioned by many due to its oracular nature. We propose a…
Recently several quantum search algorithms based on quantum walks were proposed. Those algorithms differ from Grover's algorithm in many aspects. The goal is to find a marked vertex in a graph faster than classical algorithms. Since the…
A discrete time quantum walk is known to be the single-particle sector of a quantum cellular automaton. Searching in this mathematical framework has interested the community since a long time. However, most results consider spatial search…
L. K. Grover's search algorithm in quantum computing gives an optimal, quadratic speedup in the search for a single object in a large unsorted database. In this paper, we generalize Grover's algorithm in a Hilbert-space framework for both…
Quantum algorithms and circuits can, in principle, outperform the best non-quantum (classical) techniques for some hard computational problems. However, this does not necessarily lead to useful applications. To gauge the practical…
Sufficiently strong inter-site interactions in extended-Hubbard and XXZ spin models result in dynamically-bound clusters at neighboring sites. We show that the dynamics of these clusters in two-dimensional lattices is remarkably different…
A quantum computer encodes information in quantum states and runs quantum algorithms to surpass the classical counterparts by exploiting quantum superposition and quantum correlation. Grover's quantum search algorithm is a typical quantum…
The Scattering Quantum Random Walk scheme has found success as a basis for search algorithms on highly symmetric graph structures. In this paper we examine its effectiveness at locating a specially marked vertex on square grid graphs,…
We report on an experiment on Grover's quantum search algorithm showing that {\em classical waves} can search a $N$-item database as efficiently as quantum mechanics can. The transverse beam profile of a short laser pulse is processed…
A randomly walking quantum particle searches in Grover's $\Theta(\sqrt{N})$ iterations for a marked vertex on the complete graph of $N$ vertices by repeatedly querying an oracle that flips the amplitude at the marked vertex, scattering by a…
Spatial search by discrete-time quantum walk can find a marked node on any ergodic, reversible Markov chain $P$ quadratically faster than its classical counterpart, i.e.\ in a time that is in the square root of the hitting time of $P$.…
We present a quantum algorithm for solving perfect mazes by casting the pathfinding task as a structured search problem. Building on Grover's amplitude amplification, the algorithm encodes all candidate paths in superposition and evaluates…