Related papers: Quantum search in many-body interacting system wit…
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…
Quantum walk has been successfully used to search for targets on graphs with vertices identified as the elements of a database. This spacial search on a two-dimensional periodic grid takes $\mathcal{O}\left(\sqrt{N\log N}\right)$ oracle…
Recently the continuous time algorithm based on the generalized quantum search Hamiltonian was presented. In this letter, we consider the running time of the generalized quantum search Hamiltonian. We provide the surprising result that the…
Fast computational algorithms are in constant demand, and their development has been driven by advances such as quantum speedup and classical acceleration. This paper intends to study search algorithms based on quantum walks in quantum…
Lackadaisical quantum walk(LQW) has been an efficient technique in searching a target state from a database which is distributed on a two-dimensional lattice. We numerically study the quantum search algorithm based on the lackadaisical…
Quantum algorithms for searching one or more marked items on a d-dimensional lattice provide an extension of Grover's search algorithm including a spatial component. We demonstrate that these lattice search algorithms can be viewed in terms…
Current quantum simulators suffer from multiple limitations such as short coherence time, noisy operations, faulty readout and restricted qubit connectivity in some platforms. Variational quantum algorithms are the most promising approach…
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…
Quantum walk has emerged as an essential tool for searching marked vertices on various graphs. Recent advances in the discrete-time quantum walk search algorithm have enabled it to effectively handle multiple marked vertices, expanding its…
In this paper we will present a quantum algorithm which works very efficiently in case of multiple matches within the search space and in the case of few matches, the algorithm performs classically. This allows us to propose a hybrid…
Executing quantum circuits on currently available quantum computers requires compiling them to a representation that conforms to all restrictions imposed by the targeted architecture. Due to the limited connectivity of the devices' physical…
We present a continuous-time quantum search algorithm on a graphene lattice. This provides the sought-after implementation of an efficient continuous-time quantum search on a two-dimensional lattice. The search uses the linearity of the…
The atom-optics kicked rotor can be used to prepare specific momentum distributions on a discrete basis set. We implement a continuous-time quantum walk and a quantum search protocol in this momentum basis. In particular we propose ways to…
A quantum algorithm for general combinatorial search that uses the underlying structure of the search space to increase the probability of finding a solution is presented. This algorithm shows how coherent quantum systems can be matched to…
Quantum search is a quantum mechanical technique for searching N possibilities in only sqrt(N) steps. This paper gives a fresh perspective on the algorithm in terms of a resonance phenomenon which is implemented through classical coupled…
We study scattering quantum walks on highly symmetric graphs and use the walks to solve search problems on these graphs. The particle making the walk resides on the edges of the graph, and at each time step scatters at the vertices. All of…
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…
Although a universal quantum computer is still far from reach, the tremendous advances in controllable quantum devices, in particular with solid-state systems, make it possible to physically implement "quantum simulators". Quantum…
Closed quantum systems follow a unitary time evolution that can be simulated on quantum computers. By incorporating non-unitary effects via, e.g., measurements on ancilla qubits, these algorithms can be extended to open-system dynamics,…
Long-lived quantum speedup serves as a fundamental component for quantum algorithms. The quantum walk is identified as an ideal scheme to realize the long-lived quantum speedup. However, one finds that the duration of quantum speedup is…