相关论文: Optimization of Partial Search

Grover's algorithm has achieved great success. But quantum search algorithms still are not complete algorithms because of Grover's Oracle. We concerned on this problem and present a new quantum search algorithm in adiabatic model without…

The search task is one of the most difficult when it comes to execution speed, and reducing the latter is important both when working with large data and with small samples, if they need to be processed frequently and in a limited time.…

We provide a tight analysis of Grover's recent algorithm for quantum database searching. We give a simple closed-form formula for the probability of success after any given number of iterations of the algorithm. This allows us to determine…

This paper presents an enhancement to Grover's search algorithm for instances where the number of items (or the size of the search problem) $N$ is not a power of 2. By employing an efficient algorithm for the preparation of uniform quantum…

Unstructured search remains as one of the significant challenges in computer science, as classical search algorithms become increasingly impractical for large-scale systems due to their linear time complexity. Quantum algorithms, notably…

The rapid progress of computer science has been accompanied by a corresponding evolution of computation, from classical computation to quantum computation. As quantum computing is on its way to becoming an established discipline of…

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…

The search problem is to find a state satisfying certain properties out of a given set. Grover's algorithm drives a quantum computer from a prepared initial state to the target state and solves the problem quadratically faster than a…

We investigate the implementation of an oracle for the Subset Sum problem for quantum search using Grover's algorithm. Our work concerns reducing the number of qubits, gates, and multi-controlled gates required by the oracle. We describe…

The paper considers the problem of finding a given substring in a text. It is known that the complexity of a classical search query in an unordered database is linear in the length of the text and a given substring. At the same time,…

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…

A simple circuit implementation of the oracle for Grover's quantum search of a real unstructured classical database is proposed. The oracle contains a kind of quantumly accessible classical memory, which stores the database.

Numerous conceptually important quantum algorithms rely on a black-box device known as an oracle, which is typically difficult to construct without knowing the answer to the problem that the algorithm is intended to solve. A notable example…

The study of quantum computation has been motivated by the hope of finding efficient quantum algorithms for solving classically hard problems. In this context, quantum algorithms by local adiabatic evolution have been shown to solve an…

Multi-objective search means searching for any one of several objectives in an unstructured database. Grover's algorithm has quadratic acceleration in multi-objection search than classical ones. Iterated operator in Grover's algorithm is a…

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…

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…

Grover's quantum search and its generalization, quantum amplitude amplification, provide quadratic advantage over classical algorithms for a diverse set of tasks, but are tricky to use without knowing beforehand what fraction $\lambda$ of…

The Grover search algorithm is one of the two key algorithms in the field of quantum computing, and hence it is of significant interest to describe it in the most efficient mathematical formalism. We show firstly, that Clifford's formalism…

In a recent paper (quant-ph/0506105), A S Gupta, M. Gupta and A. Pathak proposed a modified Grover algorithm that would exponentially accelerate the unsorted database search problem if the number of marked items is known. If this were true,…