Linganisha mbinu
Pitia mbinu ulizochagua bega kwa bega; safu zinazotofautiana zinaangaziwa.
| Algoriti ya Grover× | Ukadiriaji wa Awamu ya Kiasi× | Algorithmu ya Shor× | |
|---|---|---|---|
| Nyanja | Ukokotoaji wa Kwantamu | Ukokotoaji wa Kwantamu | Ukokotoaji wa Kwantamu |
| Familia | Machine learning | Machine learning | Machine learning |
| Mwaka wa asili≠ | 1996 | 1995 | 1994 |
| Mwanzilishi≠ | Lov Grover | Alexei Kitaev | Peter Shor |
| Aina≠ | Quantum algorithm | Subroutine algorithm | Quantum algorithm |
| Chanzo asilia≠ | 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 ↗ | Kitaev, A. Y. (1995). Quantum measurements and the Abelian stabilizer problem. arXiv preprint quant-ph/9511026. link ↗ | Shor, P. W. (1994). Algorithms for quantum computation: discrete logarithms and factoring. Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 124–134. DOI ↗ |
| Majina mbadala | quantum search, amplitude amplification | QPE, phase kickback | Shor factorization, quantum factorization |
| Zinazohusiana | 3 | 3 | 3 |
| Muhtasari≠ | Grover's Algorithm is a quantum algorithm for searching an unsorted database, offering a quadratic speedup over classical linear search. Proposed by Lov Grover in 1996, it exploits quantum superposition and amplitude amplification to find a target item among N items in O(√N) queries, compared to the classical O(N) requirement. | Quantum Phase Estimation (QPE) is a fundamental quantum subroutine that estimates the eigenvalues of a unitary operator. Developed by Alexei Kitaev in 1995, QPE combines controlled unitary evolution with the quantum Fourier transform to extract eigenvalues from quantum states with exponential precision scaling. | Shor's Algorithm is a polynomial-time quantum algorithm for factoring large integers and computing discrete logarithms, problems believed to be intractable on classical computers. Discovered by Peter Shor in 1994, it demonstrated the potential of quantum computers to break widely used cryptographic systems like RSA, marking a landmark in quantum computing theory. |
| ScholarGateSeti ya data ↗ |
|
|
|