Groverov algoritam
Groverov algoritam je kvantni algoritam za pretragu nesortirane baze podataka, koji nudi kvadratno ubrzanje u odnosu na klasičnu linearnu pretragu. Predložen od strane Lova Grovera 1996. godine, on koristi kvantnu superpoziciju i pojačanje amplitude da bi pronašao ciljanu stavku među N stavki u O(√N) upita, u poređenju sa klasičnim O(N) zahtevom.
Pročitajte celu metodu
Prijavite se besplatnim nalogom da biste pročitali ovaj odeljak.
Method map
The neighbourhood of related methods — select a node to explore.
Izvori
- 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 ↗
Kako citirati ovu stranicu
ScholarGate. (2026, June 3). Grover's Algorithm for Quantum Search. ScholarGate. https://scholargate.app/sr/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.
- Kvantni Monte KarloKvantno računarstvo↔ compare
- Kvantna procena fazeKvantno računarstvo↔ compare
- Šorov алгоритамKvantno računarstvo↔ compare
Citirana u
Uočili ste grešku na ovoj stranici? Prijavite je ili predložite ispravku →