Algoriti ya Grover
Algoriti ya Grover ni algoriti ya quantum kwa kutafuta hifadhidata isiyo na mpangilio, ikitoa kasi ya mraba juu ya utafutaji wa kawaida wa mstari. Ipendekezwa na Lov Grover mnamo 1996, inatumia usawazishaji wa quantum na uhimili wa amplitude kupata kipengee kinacholengwa kati ya vipengee N kwa maswali O(√N), ikilinganishwa na mahitaji ya kawaida ya O(N).
Soma mbinu kamili
Ingia kwa akaunti ya bure ili kusoma sehemu hii.
Method map
The neighbourhood of related methods — select a node to explore.
Vyanzo
- Grover, L. K. (1996). A fast quantum mechanical algorithm for database search. Proceedings of the 28th Annual ACM Symposium on Theory of Computing (STOC), 212–219. DOI: 10.1145/237814.237866 ↗
- Grover, L. K. (1997). Quantum mechanics helps in searching for a needle in a haystack. Physical Review Letters, 79, 325–328. DOI: 10.1103/PhysRevLett.79.325 ↗
- Brassard, G., Hoyer, P., Tapp, A. (2002). Quantum amplitude amplification and estimation. arXiv preprint quant-ph/0005055. link ↗
Jinsi ya kunukuu ukurasa huu
ScholarGate. (2026, June 3). Grover's Algorithm for Quantum Search. ScholarGate. https://scholargate.app/sw/quantum-computing/grovers-algorithm
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- Quantum Monte CarloUkokotoaji wa Kwantamu↔ compare
- Ukadiriaji wa Awamu ya KiasiUkokotoaji wa Kwantamu↔ compare
- Algorithmu ya ShorUkokotoaji wa Kwantamu↔ compare
Imerejelewa na
Umeona tatizo kwenye ukurasa huu? Ripoti au pendekeza marekebisho →