Compară metode
Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.
| Algoritmul lui Shor× | Estimarea Fazelor Cuantice× | |
|---|---|---|
| Domeniu | Calcul cuantic | Calcul cuantic |
| Familie | Machine learning | Machine learning |
| Anul apariției≠ | 1994 | 1995 |
| Autorul original≠ | Peter Shor | Alexei Kitaev |
| Tip≠ | Quantum algorithm | Subroutine algorithm |
| Sursa seminală≠ | 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 ↗ | Kitaev, A. Y. (1995). Quantum measurements and the Abelian stabilizer problem. arXiv preprint quant-ph/9511026. link ↗ |
| Denumiri alternative | Shor factorization, quantum factorization | QPE, phase kickback |
| Înrudite | 3 | 3 |
| Rezumat≠ | 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. | 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. |
| ScholarGateSet de date ↗ |
|
|