手法を比較
選択した手法を並べて確認できます。異なる行はハイライト表示されます。
| Shor's Algorithm× | 量子位相推定× | |
|---|---|---|
| 分野 | 量子コンピューティング | 量子コンピューティング |
| 系統 | Machine learning | Machine learning |
| 提唱年≠ | 1994 | 1995 |
| 提唱者≠ | Peter Shor | Alexei Kitaev |
| 種類≠ | Quantum algorithm | Subroutine algorithm |
| 原典≠ | 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 ↗ |
| 別名 | Shor factorization, quantum factorization | QPE, phase kickback |
| 関連 | 3 | 3 |
| 概要≠ | 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. |
| ScholarGateデータセット ↗ |
|
|