相关论文: Note on Needle in a Haystack
Databases are an essential component of modern computing infrastructures and allow efficient manipulation of inherently structured data. The structure depends on the type and relationships of the individual data elements and on the access…
Despite the rich literature on quantum algorithms, there is a surprisingly small amount of coverage of their concrete logical design and implementation. Most resource estimation is done at the level of complexity analysis, but actual…
Quantum search algorithm (also known as Grover's algorithm) lays the foundation for many other quantum algorithms. Although it is very simple, its implementation is limited on noisy intermediate-scale quantum (NISQ) processors. Grover's…
We introduce a novel deterministic quantum search algorithm that provides a practical alternative to conventional probabilistic search approaches. Our scheme eliminates the inherent uncertainty of quantum search without relying on arbitrary…
Ubiquitous in quantum computing is the step to encode data into a quantum state. This process is called quantum state preparation, and its complexity for non-structured data is exponential on the number of qubits. Several works address this…
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…
Quantum state tomography (QST) is the process of reconstructing the state of a quantum system (mathematically described as a density matrix) through a series of different measurements, which can be solved by learning a parameterized…
We present a new adiabatic quantum algorithm for searching over structured databases. The new algorithm is optimized using a simplified complexity analysis.
Given an item and a list of values of size $N$. It is required to decide if such item exists in the list. Classical computer can search for the item in O(N). The best known quantum algorithm can do the job in $O(\sqrt{N})$. In this paper, a…
Logic entailment is essential to reasoning, but entailment checking has the worst-case complexity of an exponential of the variable size. With recent development, quantum computing when mature may allow an effective approach for various…
This paper describes a quantum algorithm for proof search in sequent calculus of a subset of Linear Logic using the Grover Search Algorithm. We briefly overview the Grover Search Algorithm and Linear Logic, show the detailed steps of the…
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…
Basic concepts of quantum theory of information, principles of quantum calculations and the possibility of creation on this basis unique on calculation power and functioning principle device, named quantum computer, are briefly reviewed.…
Hypothesis elimination is a special case of Bayesian updating, where each piece of new data rules out a set of prior hypotheses. We describe how to use Grover's algorithm to perform hypothesis elimination for a class of probability…
We recast Grover's generalised search algorithm in a geometric language even when the states are not approximately orthogonal. We provide a possible search algorithm based on an arbitrary unitary transformation which can speed up the steps…
We present a scheme to store unitary operators with self-inverse generators in quantum states and a general circuit to retrieve them with definite success probability. The continuous variable of the operator is stored in a single-qubit…
We present a scheme to prepare a quantum state in a ion trap with probability approaching to one by means of ion trap quantum computing and Grover's quantum search algorithm acting on trapped ions.
The landmark Grover algorithm for amplitude amplification serves as an essential subroutine in various type of quantum algorithms, with guaranteed quantum speedup in query complexity. However, there have been no proposal to realize the…
In standard Grover's algorithm for quantum searching, the probability of finding the marked item is not exactly 1. In this Letter we present a modified version of Grover's algorithm that searches a marked state with full successful rate.…
Many important computer science problems can be reduced to clause satisfaction problem. We are given $n$ Boolean variables $x_{k}$ and $m$ clauses $c_{j}$ where each clause is a function of values of some of the variables. We want to find…