Nonlinear Quantum Search

by Wong, Thomas Giechaung, Ph.D., UNIVERSITY OF CALIFORNIA, SAN DIEGO, 2014, 117 pages; 3630473


Although quantum mechanics is linear, there are nevertheless quantum systems with multiple interacting particles in which the effective evolution of a single particle is governed by a nonlinear equation. This includes Bose-Einstein condensates, which are governed by the Gross-Pitaevskii equation, which is a cubic nonlinear Schrödinger equation with a term proportional to |ψ| 2ψ. Evolution by this equation solves the unstructured search problem in constant time, but at the novel expense of increasing the time-measurement precision. Jointly optimizing these resources results in an overall scaling of N¼, which is a significant, but not unreasonable, improvement over the N½ scaling of Grover's algorithm. Since the Gross-Pitaevskii equation effectively approximates the multi-particle Schrödinger equation, for which Grover's algorithm is optimal, our result leads to a quantum information-theoretic bound on the number of particles needed for this approximation to hold, asymptotically. The Gross-Pitaevskii equation is not the only nonlinearity of the form f(|ψ|2)ψ that arises in effective equations for the evolution of real quantum physical systems, however: The cubic-quintic nonlinear Schrödinger equation describes light propagation in nonlinear Kerr media with defocusing corrections, and the logarithmic nonlinear Schrödinger equation describes Bose liquids under certain conditions. Analysis of computation with such systems yields some surprising results; for example, when time-measurement precision is included in the resource accounting, searching a "database" when there is a single correct answer may be easier than searching when there are multiple correct answers. These results lead to quantum information-theoretic bounds on the physical resources required for these effective nonlinear theories to hold, asymptotically. Furthermore, strongly regular graphs, which have no global symmetry, are sufficiently complete for quantum search on them to asymptotically behave like unstructured search. Certain sufficiently complete graphs retain the improved runtime and resource scalings for some nonlinearities, so our scheme for nonlinear, analog quantum computation retains its benefits even when some structure is introduced.

AdviserDavid A. Meyer
Source TypeDissertation
SubjectsQuantum physics
Publication Number3630473

About ProQuest Dissertations & Theses
With nearly 4 million records, the ProQuest Dissertations & Theses (PQDT) Global database is the most comprehensive collection of dissertations and theses in the world. It is the database of record for graduate research.

PQDT Global combines content from a range of the world's premier universities - from the Ivy League to the Russell Group. Of the nearly 4 million graduate works included in the database, ProQuest offers more than 2.5 million in full text formats. Of those, over 1.7 million are available in PDF format. More than 90,000 dissertations and theses are added to the database each year.

If you have questions, please feel free to visit the ProQuest Web site - - or contact ProQuest Support.