2,991 research outputs found
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
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
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
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.
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
Implementation of quantum search algorithm using classical Fourier optics
We report on an experiment on Grover's quantum search algorithm showing that
{\em classical waves} can search a -item database as efficiently as quantum
mechanics can. The transverse beam profile of a short laser pulse is processed
iteratively as the pulse bounces back and forth between two mirrors. We
directly observe the sought item being found in iterations, in
the form of a growing intensity peak on this profile. Although the lack of
quantum entanglement limits the {\em size} of our database, our results show
that entanglement is neither necessary for the algorithm itself, nor for its
efficiency.Comment: 4 pages, 3 figures; minor revisions plus extra referenc
Single-Step Quantum Search Using Problem Structure
The structure of satisfiability problems is used to improve search algorithms
for quantum computers and reduce their required coherence times by using only a
single coherent evaluation of problem properties. The structure of random k-SAT
allows determining the asymptotic average behavior of these algorithms, showing
they improve on quantum algorithms, such as amplitude amplification, that
ignore detailed problem structure but remain exponential for hard problem
instances. Compared to good classical methods, the algorithm performs better,
on average, for weakly and highly constrained problems but worse for hard
cases. The analytic techniques introduced here also apply to other quantum
algorithms, supplementing the limited evaluation possible with classical
simulations and showing how quantum computing can use ensemble properties of NP
search problems.Comment: 39 pages, 12 figures. Revision describes further improvement with
multiple steps (section 7). See also
http://www.parc.xerox.com/dynamics/www/quantum.htm
All null supersymmetric backgrounds of N=2, D=4 gauged supergravity coupled to abelian vector multiplets
The lightlike supersymmetric solutions of N=2, D=4 gauged supergravity
coupled to an arbitrary number of abelian vector multiplets are classified
using spinorial geometry techniques. The solutions fall into two classes,
depending on whether the Killing spinor is constant or not. In both cases, we
give explicit examples of supersymmetric backgrounds. Among these BPS
solutions, which preserve one quarter of the supersymmetry, there are
gravitational waves propagating on domain walls or on bubbles of nothing that
asymptote to AdS_4. Furthermore, we obtain the additional constraints obeyed by
half-supersymmetric vacua. These are divided into four categories, that include
bubbles of nothing which are asymptotically AdS_4, pp-waves on domain walls,
AdS_3 x R, and spacetimes conformal to AdS_3 times an interval.Comment: 55 pages, uses JHEP3.cls. v2: Minor errors corrected, small changes
in introductio
Quantum Algorithm for Molecular Properties and Geometry Optimization
It is known that quantum computers, if available, would allow an exponential
decrease in the computational cost of quantum simulations. We extend this
result to show that the computation of molecular properties (energy
derivatives) could also be sped up using quantum computers. We provide a
quantum algorithm for the numerical evaluation of molecular properties, whose
time cost is a constant multiple of the time needed to compute the molecular
energy, regardless of the size of the system. Molecular properties computed
with the proposed approach could also be used for the optimization of molecular
geometries or other properties. For that purpose, we discuss the benefits of
quantum techniques for Newton's method and Householder methods. Finally, global
minima for the proposed optimizations can be found using the quantum basin
hopper algorithm, which offers an additional quadratic reduction in cost over
classical multi-start techniques.Comment: 6 page
Quantum Portfolios
Quantum computation holds promise for the solution of many intractable
problems. However, since many quantum algorithms are stochastic in nature they
can only find the solution of hard problems probabilistically. Thus the
efficiency of the algorithms has to be characterized both by the expected time
to completion {\it and} the associated variance. In order to minimize both the
running time and its uncertainty, we show that portfolios of quantum algorithms
analogous to those of finance can outperform single algorithms when applied to
the NP-complete problems such as 3-SAT.Comment: revision includes additional data and corrects minor typo
- …