相关论文: Quantum search with resonances

Grover's quantum search algorithm, involving a large number of qubits, is highly sensitive to errors in the physical implementation of the unitary operators. This poses an intrinsic limitation to the size of the database that can be…

We solve the unstructured search problem in constant time by computing with a physically motivated nonlinearity of the Gross-Pitaevskii type. This speedup comes, however, at the novel expense of increasing the time-measurement precision.…

In a fundamental paper [Phys. Rev. Lett. 78, 325 (1997)] Grover showed how a quantum computer can find a single marked object in a database of size N by using only O(N^{1/2}) queries of the oracle that identifies the object. His result was…

Since Grover's seminal work which provides a way to speed up combinatorial search, quantum search has been studied in great detail. We propose a new method for designing quantum search algorithms for finding a marked element in the state…

Can Grover's algorithm speed up search of a physical region - for example a 2-D grid of size sqrt(n) by sqrt(n)? The problem is that sqrt(n) time seems to be needed for each query, just to move amplitude across the grid. Here we show that…

We propose a quantum algorithm for solving combinatorial search problems that uses only a sequence of measurements. The algorithm is similar in spirit to quantum computation by adiabatic evolution, in that the goal is to remain in the…

The quantum search algorithm consists of an alternating sequence of selective inversions and diffusion type operations, as a result of which it can find a target state in an unsorted database of size N in only sqrt(N) queries. This paper…

Matched filtering is a common method for detecting gravitational waves. However, the computational costs of searching large template banks limit the efficiency of classical algorithms when searching for massive black hole binary (MBHB)…

In the multitarget Grover algorithm, we are given an unstructured N-element list of objects S_i containing a T-element subset tau and function f, called an oracle, such that f(S_i)=1 if S_i is in tau, otherwise f(S_i) = 0. By using quantum…

Grover's algorithm accelerates unstructured database search quadratically compared to classical algorithms. In the NISQ era, distributed quantum computing can decrease circuit depth and reduce noise. In this paper, an algorithm for…

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…

The execution of Grover's quantum search algorithm needs rather limited resources without much fine tuning. Consequently, the algorithm can be implemented in a variety of physical set-ups, which involve wave dynamics but may not need other…

Consider the unstructured search of an unknown number l of items in a large unsorted database of size N. The multi-object quantum search algorithm consists of two parts. The first part of the algorithm is to generalize Grover's…

The use of superposition of states in quantum computation, known as quantum parallelism, has significant advantage in terms of speed over the classical computation. It can be understood from the early invented quantum algorithms such as…

The research community has been actively working on the realization of quantum computer. But the large scale commercial quantum computers are not a reality yet quantum computing field has become richer by day with the advent of algorithms…

The Grover search algorithm performs an unstructured search of a marked item in a database quadratically faster than classical algorithms and is shown to be optimal. Here, we show that if the search space is divided into two blocks with the…

Building quantum devices using fixed operators is a must to simplify the hardware construction. Quantum search engine is not an exception. In this paper, a fixed phase quantum search algorithm that searches for M matches in an unstructured…

A quantum algorithm is a set of instructions for a quantum computer, however, unlike algorithms in classical computer science their results cannot be guaranteed. A quantum system can undergo two types of operation, measurement and quantum…

The theory of decoherent histories is an attempt to derive classical physics from positing only quantum laws at the fundamental level without notions of a classical apparatus or collapse of the wave-function. Searching for a marked target…

We analyze the performance of classical and quantum search algorithms from a thermodynamic perspective, focusing on resources such as time, energy, and memory size. We consider two examples that are relevant to post-quantum cryptography:…