Confronta i metodi
Esamina i metodi selezionati fianco a fianco; le righe che differiscono sono evidenziate.
| Algoritmo di Shor× | Stima di Fase Quantistica× | |
|---|---|---|
| Campo | Calcolo quantistico | Calcolo quantistico |
| Famiglia | Machine learning | Machine learning |
| Anno di origine≠ | 1994 | 1995 |
| Ideatore≠ | Peter Shor | Alexei Kitaev |
| Tipo≠ | Quantum algorithm | Subroutine algorithm |
| Fonte seminale≠ | 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 ↗ |
| Alias | Shor factorization, quantum factorization | QPE, phase kickback |
| Correlati | 3 | 3 |
| Sintesi≠ | 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. |
| ScholarGateInsieme di dati ↗ |
|
|