Re:New silicon structure opens the gate to quantum computers
by Beltiras on Wednesday December 13, 2017 @04:29AM
(#15913118)
Error correction is immaterial for the factoring case. You multiply the factors and if you do not get the original number you know you have to run it again.
[ Parent
| on HN ]
Re:New silicon structure opens the gate to quantum computers
by jcoffland on Wednesday December 13, 2017 @01:02PM
(#15916009)
In Schor's algorithm, the quantum computer finds the period p of B mod N were N is the number you are trying to factor and B is a random number less than N. The quantum computer may find p with imperfect accuracy. Running the algorithm repeatedly can improve the accuracy of p. You can also try other numbers close to p. Both are examples of error correcting a quantum algorithm.