Arxiv – Pretending to factor large numbers on a quantum computer – Shor’s algorithm for factoring in polynomial time on a quantum computer gives an enormous advantage over all known classical ...
Shor’s quantum factoring algorithm exponentially outperforms known classical methods. Previous experimental implementations have used simplifications dependent on knowing the factors in advance.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback