Algorithms for quantum computation: discrete logarithms and factoring
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
This note shows that Shor's algorithm for factoring in polynomial time on a quantum computer can be made to work with zero error probability.