4,399 research outputs found
Quantum computers can search rapidly by using almost any transformation
A quantum computer has a clear advantage over a classical computer for
exhaustive search. The quantum mechanical algorithm for exhaustive search was
originally derived by using subtle properties of a particular quantum
mechanical operation called the Walsh-Hadamard (W-H) transform. This paper
shows that this algorithm can be implemented by replacing the W-H transform by
almost any quantum mechanical operation. This leads to several new applications
where it improves the number of steps by a square-root. It also broadens the
scope for implementation since it demonstrates quantum mechanical algorithms
that can readily adapt to available technology.Comment: This paper is an adapted version of quant-ph/9711043. It has been
modified to make it more readable for physicists. 9 pages, postscrip
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
Quantum search algorithms on a regular lattice
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 of the level dynamics near an avoided crossing of a one-parameter family
of quantum random walks. We give approximations for both the level-splitting at
the avoided crossing and the effectively two-dimensional subspace of the full
Hilbert space spanning the level crossing. This makes it possible to give the
leading order behaviour for the search time and the localisation probability in
the limit of large lattice size including the leading order coefficients. For
d=2 and d=3, these coefficients are calculated explicitly. Closed form
expressions are given for higher dimensions
Grover's quantum searching algorithm is optimal
I improve the tight bound on quantum searching by Boyer et al.
(quant-ph/9605034) to a matching bound, thus showing that for any probability
of success Grovers quantum searching algorithm is optimal. E.g. for near
certain success we have to query the oracle pi/4 sqrt{N} times, where N is the
size of the search space. I also show that unfortunately quantum searching
cannot be parallelized better than by assigning different parts of the search
space to independent quantum computers. Earlier results left open the
possibility of a more efficient parallelization.Comment: 13 pages, LaTeX, essentially published versio
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
Grover's Quantum Search Algorithm for an Arbitrary Initial Mixed State
The Grover quantum search algorithm is generalized to deal with an arbitrary
mixed initial state. The probability to measure a marked state as a function of
time is calculated, and found to depend strongly on the specific initial state.
The form of the function, though, remains as it is in the case of initial pure
state. We study the role of the von Neumann entropy of the initial state, and
show that the entropy cannot be a measure for the usefulness of the algorithm.
We give few examples and show that for some extremely mixed initial states
carrying high entropy, the generalized Grover algorithm is considerably faster
than any classical algorithm.Comment: 4 pages. See http://www.cs.technion.ac.il/~danken/MSc-thesis.pdf for
extended discussio
Noise in Grover's Quantum Search Algorithm
Grover's quantum algorithm improves any classical search algorithm. We show
how random Gaussian noise at each step of the algorithm can be modelled easily
because of the exact recursion formulas available for computing the quantum
amplitude in Grover's algorithm. We study the algorithm's intrinsic robustness
when no quantum correction codes are used, and evaluate how much noise the
algorithm can bear with, in terms of the size of the phone book and a desired
probability of finding the correct result. The algorithm loses efficiency when
noise is added, but does not slow down. We also study the maximal noise under
which the iterated quantum algorithm is just as slow as the classical
algorithm. In all cases, the width of the allowed noise scales with the size of
the phone book as N^-2/3.Comment: 17 pages, 2 eps figures. Revised version. To be published in PRA,
December 199
A General SU(2) Formulation for Quantum Searching with Certainty
A general quantum search algorithm with arbitrary unitary transformations and
an arbitrary initial state is considered in this work. To serach a marked state
with certainty, we have derived, using an SU(2) representation: (1) the
matching condition relating the phase rotations in the algorithm, (2) a concise
formula for evaluating the required number of iterations for the search, and
(3) the final state after the search, with a phase angle in its amplitude of
unity modulus. Moreover, the optimal choices and modifications of the phase
angles in the Grover kernel is also studied.Comment: 8 pages, 2 figure
Hilbert Space Average Method and adiabatic quantum search
We discuss some aspects related to the so-called Hilbert space Average
Method, as an alternative to describe the dynamics of open quantum systems.
First we present a derivation of the method which does not make use of the
algebra satisfied by the operators involved in the dynamics, and extend the
method to systems subject to a Hamiltonian that changes with time. Next we
examine the performance of the adiabatic quantum search algorithm with a
particular model for the environment. We relate our results to the criteria
discussed in the literature for the validity of the above-mentioned method for
similar environments.Comment: 6 pages, 1 figur
Multiparameter Quantum Metrology of Incoherent Point Sources: Towards Realistic Superresolution
We establish the multiparameter quantum Cram\'er-Rao bound for simultaneously
estimating the centroid, the separation, and the relative intensities of two
incoherent optical point sources using alinear imaging system. For equally
bright sources, the Cram\'er-Rao bound is independent of the source separation,
which confirms that the Rayleigh resolution limit is just an artifact of the
conventional direct imaging and can be overcome with an adequate strategy. For
the general case of unequally bright sources, the amount of information one can
gain about the separation falls to zero, but we show that there is always a
quadratic improvement in an optimal detection in comparison with the intensity
measurements. This advantage can be of utmost important in realistic scenarios,
such as observational astronomy.Comment: 5 pages, 3 figures. Comments welcome
- …