New answers tagged grovers-algorithm
1
vote
Accepted
Why is the fastest quantum time complexity of unstructured search O(sqrt(n))?
Wikipedia cites the 1997 paper "Grover's quantum searching algorithm is optimal" by Zalka, for the proof of optimality. That paper says it's improving on the 1996 paper "Tight bounds on ...
Top 50 recent answers are included
Related Tags
grovers-algorithm × 433quantum-algorithms × 147
qiskit × 80
oracles × 55
amplitude-amplification × 50
programming × 44
quantum-gate × 31
circuit-construction × 24
quantum-state × 20
complexity-theory × 18
quantum-circuit × 16
nielsen-and-chuang × 16
ibm-q-experience × 14
cryptography × 14
textbook-and-exercises × 13
resource-request × 12
quantum-phase-estimation × 11
superposition × 11
q# × 9
speedup × 9
entanglement × 7
classical-computing × 7
linear-algebra × 6
simulation × 6
hadamard × 6