Re:Who needs qubits? Factoring algorithm run on a probabilis...
by DennisP on Thursday September 19, 2019 @07:20AM
(#21015179)
They used 8 p-bits and could factor numbers up to 950, which took about 15 seconds. They say "it's possible that a larger number of p-bits will mean a significantly larger sampling time." That seems likely to be a drastic understatement.
[ Parent
| on HN ]