3,320 research outputs found
Simple Algorithm for Partial Quantum Search
Quite often in database search, we only need to extract portion of the
information about the satisfying item. Recently Radhakrishnan & Grover [RG]
considered this problem in the following form: the database of items was
divided into equally sized blocks. The algorithm has just to find the block
containing the item of interest. The queries are exactly the same as in the
standard database search problem. [RG] invented a quantum algorithm for this
problem of partial search that took about fewer iterations
than the quantum search algorithm. They also proved that the best any quantum
algorithm could do would be to save iterations. The main
limitation of the algorithm was that it involved complicated analysis as a
result of which it has been inaccessible to most of the community. This paper
gives a simple analysis of the algorithm. This analysis is based on three
elementary observations about quantum search, does not require a single
equation and takes less than 2 pages.Comment: 3 pages, 3 figure
Quantum computers can search arbitrarily large databases by a single query
This paper shows that a quantum mechanical algorithm that can query
information relating to multiple items of the database, can search a database
in a single query (a query is defined as any question to the database to which
the database has to return a (YES/NO) answer). A classical algorithm will be
limited to the information theoretic bound of at least O(log N) queries (which
it would achieve by using a binary search).Comment: Several enhancements to the original pape
Hamiltonian and measuring time for analog quantum search
We derive in this study a Hamiltonian to solve with certainty the analog
quantum search problem analogue to the Grover algorithm. The general form of
the initial state is considered. Since the evaluation of the measuring time for
finding the marked state by probability of unity is crucially important in the
problem, especially when the Bohr frequency is high, we then give the exact
formula as a function of all given parameters for the measuring time.Comment: 5 page
Measurement of an integral of a classical field with a single quantum particle
A method for measuring an integral of a classical field via local interaction
of a single quantum particle in a superposition of 2^N states is presented. The
method is as efficient as a quantum method with N qubits passing through the
field one at a time and it is exponentially better than any known classical
method that uses N bits passing through the field one at a time. A related
method for searching a string with a quantum particle is proposed.Comment: 3 page
Energy and Efficiency of Adiabatic Quantum Search Algorithms
We present the results of a detailed analysis of a general, unstructured
adiabatic quantum search of a data base of items. In particular we examine
the effects on the computation time of adding energy to the system. We find
that by increasing the lowest eigenvalue of the time dependent Hamiltonian {\it
temporarily} to a maximum of , it is possible to do the
calculation in constant time. This leads us to derive the general theorem which
provides the adiabatic analogue of the bound of conventional quantum
searches. The result suggests that the action associated with the oracle term
in the time dependent Hamiltonian is a direct measure of the resources required
by the adiabatic quantum search.Comment: 6 pages, Revtex, 1 figure. Theorem modified, references and comments
added, sections introduced, typos corrected. Version to appear in J. Phys.
Realization of generalized quantum searching using nuclear magnetic resonance
According to the theoretical results, the quantum searching algorithm can be
generalized by replacing the Walsh-Hadamard(W-H) transform by almost any
quantum mechanical operation. We have implemented the generalized algorithm
using nuclear magnetic resonance techniques with a solution of chloroform
molecules. Experimental results show the good agreement between theory and
experiment.Comment: 11 pages,3 figure. Accepted by Phys. Rev. A. Scheduled Issue: 01 Mar
200
THIS ISSUE IS DEDICATED TO THE LATE PROFESSOR EDWIN C. GODDARD
Edwin C. Goddard, a professor emeritus of the University of Michigan Law School, died in Ann Arbor, after a brief illness, on Friday, August 14, 1942. Those of us who were associated with him during his many years of service to the Law School feel that we have lost a wise adviser, a capable and faithful associate, and a loyal friend
Nested quantum search and NP-complete problems
A quantum algorithm is known that solves an unstructured search problem in a
number of iterations of order , where is the dimension of the
search space, whereas any classical algorithm necessarily scales as . It
is shown here that an improved quantum search algorithm can be devised that
exploits the structure of a tree search problem by nesting this standard search
algorithm. The number of iterations required to find the solution of an average
instance of a constraint satisfaction problem scales as , with
a constant depending on the nesting depth and the problem
considered. When applying a single nesting level to a problem with constraints
of size 2 such as the graph coloring problem, this constant is
estimated to be around 0.62 for average instances of maximum difficulty. This
corresponds to a square-root speedup over a classical nested search algorithm,
of which our presented algorithm is the quantum counterpart.Comment: 18 pages RevTeX, 3 Postscript figure
Analysis of the behaviour of erythrocytes in an optical trapping system
We present a theoretical analysis of the behaviour of erythrocytes in an optical trapping system. We modeled erythrocyte behaviour in an optical trap by an algorithm which divided the cell surface into a large number of elements and recursively summed the force and torque on each element. We present a relationship between the torque and angle of orientation of the cell, showing that stable equilibrium orientations are at angles of 0 o , 180 o and 360 o and unstable equilibrium orientations are at 90 o and 270 o relative to the axis of beam propagation. This is consistent with our experimental observations and with results described in the literature. We also model behaviour of the erythrocyte during micromanipulation by calculating the net force on it. Such theoretical analysis is practical as it allows for the optimization of the optical parameters of a trapping system prior to performing a specific optical micromanipulation application, such as cell sorting or construction of a cell pattern for lab-on-a-chip applications
Analysis of Generalized Grover's Quantum Search Algorithms Using Recursion Equations
The recursion equation analysis of Grover's quantum search algorithm
presented by Biham et al. [PRA 60, 2742 (1999)] is generalized. It is applied
to the large class of Grover's type algorithms in which the Hadamard transform
is replaced by any other unitary transformation and the phase inversion is
replaced by a rotation by an arbitrary angle. The time evolution of the
amplitudes of the marked and unmarked states, for any initial complex amplitude
distribution is expressed using first order linear difference equations. These
equations are solved exactly. The solution provides the number of iterations T
after which the probability of finding a marked state upon measurement is the
highest, as well as the value of this probability, P_max. Both T and P_max are
found to depend on the averages and variances of the initial amplitude
distributions of the marked and unmarked states, but not on higher moments.Comment: 8 pages, no figures. To appear in Phys. Rev.
- …