Comparar métodos
Examine os métodos selecionados lado a lado; as linhas que diferem ficam destacadas.
| Estimativa de Fase Quântica× | Algoritmo de Shor× | |
|---|---|---|
| Área | Computação quântica | Computação quântica |
| Família | Machine learning | Machine learning |
| Ano de origem≠ | 1995 | 1994 |
| Autor original≠ | Alexei Kitaev | Peter Shor |
| Tipo≠ | Subroutine algorithm | Quantum algorithm |
| Fonte seminal≠ | 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 ↗ |
| Outros nomes | QPE, phase kickback | Shor factorization, quantum factorization |
| Relacionados | 3 | 3 |
| Resumo≠ | 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. |
| ScholarGateConjunto de dados ↗ |
|
|