2018
DOI: 10.1007/s11128-018-2031-6
|View full text |Cite
|
Sign up to set email alerts
|

Controlled quantum search

Abstract: 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 discovered an unstructured quantum search algorithm with a complexity O(min{1/g log(gn), √ n}), which can be used to find a marked item after o(log(n)) repetitions, where g is the nonlinearity strength [1]. In this work we develop a structured search on a complete graph using a … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
3
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 15 publications
0
3
0
Order By: Relevance
“…The foundation of QML targets to solve research foundation problems in mathematical analysis to generalize quantum to improve classical learning tasks with potential optimization to speed of execution. Some of the task's researchers are leveraging includes quantum techniques in Quantum Simulation [28], applied around nanotech, bio-medical imaging, physical chemistry, and with quantum systems tasks, such as search [29], which further provides polynomial speed, as compared to classical algorithms for other varied scenarios.…”
Section: Application Of Quantum Machine Learningmentioning
confidence: 99%
“…The foundation of QML targets to solve research foundation problems in mathematical analysis to generalize quantum to improve classical learning tasks with potential optimization to speed of execution. Some of the task's researchers are leveraging includes quantum techniques in Quantum Simulation [28], applied around nanotech, bio-medical imaging, physical chemistry, and with quantum systems tasks, such as search [29], which further provides polynomial speed, as compared to classical algorithms for other varied scenarios.…”
Section: Application Of Quantum Machine Learningmentioning
confidence: 99%
“…Since then, Childs and Young proposed their nonlinear protocol using the same Gross-Pitaevskii dynamics with a runtime scaling as O(min{1/g log(gN ), √ N }), achieving exponentially faster rates than previous results [8]. In [25], de Lacy also uses the Gross-Pitaevskii nonlinearity, performing an unstructured search on a complete graph in time O(N/(g m(N − m))), where m is the number of marked terms. Others have applied the concept of nonlinear quantum dynamics to quantum walks [26][27][28][29].…”
Section: Nonlinear Quantum Computingmentioning
confidence: 99%
“…Nonlinear time evolution can be presented in standard quantum mechanics as an effective model, e.g., the Gross-Pitaevskii equation [3] which approximately describes the collective behavior of atoms in a Bose-Einstein condensate. Were it not approximate, the Gross-Pitaevskii equation would be applicable to solve the unstructured search problem with an exponential improvement over protocols based on standard quantum theory [2,4].…”
mentioning
confidence: 99%