Controlled quantum search

K. de Lacy, L. Noakes, J. Twamley, J. B. Wang

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)


Quantum searching for one of N marked items in an unsorted database of n items is solved in O(n/N) steps using Grover’s algorithm. Using nonlinear quantum dynamics with a Gross–Pitaevskii-type quadratic nonlinearity, Childs and Young (Phys Rev A 93:022314, 2016, discovered an unstructured quantum search algorithm with a complexity O(min{1/glog(gn),n}), which can be used to find a marked item after o(log (n)) repetitions, where g is the nonlinearity strength. In this work we develop an quantum search on a complete graph using a time-dependent nonlinearity which obtains one of the N marked items with certainty. The protocol has runtime O(n/(gN(n-N))), where g is related to the time-dependent nonlinearity. We also extend the analysis to a quantum search on general symmetric graphs and can greatly simplify the resulting equations when the graph diameter is less than 4.

Original languageEnglish
Article number266
JournalQuantum Information Processing
Issue number10
Publication statusPublished - 1 Oct 2018


Dive into the research topics of 'Controlled quantum search'. Together they form a unique fingerprint.

Cite this