2012
DOI: 10.1016/j.egypro.2012.01.263
|View full text |Cite
|
Sign up to set email alerts
|

Progress of Grover Quantum Search Algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(3 citation statements)
references
References 6 publications
0
3
0
Order By: Relevance
“…Lov Grover in 1996 [1] invented the Grover Search algorithm to perform the fastest possible quantum search for an unsorted database which takes O(√n) time and O(logN) storage space. This mean that, for a list of 108 elements, the number of iterations required to search a desired item is order of 10000 and the obtained result will be accurate with a probability close to 1.…”
Section: Grover's Quantum Search Algorithmmentioning
confidence: 99%
“…Lov Grover in 1996 [1] invented the Grover Search algorithm to perform the fastest possible quantum search for an unsorted database which takes O(√n) time and O(logN) storage space. This mean that, for a list of 108 elements, the number of iterations required to search a desired item is order of 10000 and the obtained result will be accurate with a probability close to 1.…”
Section: Grover's Quantum Search Algorithmmentioning
confidence: 99%
“…It is important to note that, due to the nature of quantum states, in a universal quantum computer there is a polynomial time and resource mapping from the classical gate model of these other approaches to a quantum computer. We illustrate this in Figure 8 for Shor's [44] and Grover's [45] algorithms.…”
Section: ) Universal Quantum Computingmentioning
confidence: 99%
“…On a classical machine, to perform the same function, O(n) operations are required. This advantage is exploited by Grover [45] to reduce the time spent searching an unsorted database from O(n) to O(n (1/2) . However, how BQP problems related to NP-Complete ones or whether there is a well defined or unique relationship remains an open question.…”
Section: B Complexitymentioning
confidence: 99%