6 ms·
if the solution is faster than random it could still be a real solution on a quantum computer.
by logicallee 6mo ago
if the solution is faster than random it could still be a real solution on a quantum computer.
- amoshebb 6mo ago“recovers every reported private key at statistically indistinguishable rates from the IBM hardware runs.”
- __float 6mo agoDid that mean success rate from multiple runs or speed for a single run?
- NewsaHackO 6mo agoOK, so what I don't get is that from the GitHub page, it seems like that statement is purposely misleading. For the 17-bit key, the quantum computer correctly recovered the key in it's single run, while urandom used 2/5 runs. At 5 runs, I don't think one could say the quantum calculation is definitely better with any confidence, but the reverse should also be true; he hasn't actually proven that urandom performed at an equivalent rate to the quantum calculation. The only thing I can think of is if he is saying that the original group should have done more runs on the quantum computer to prove it. But from the framing he is using, seems like he is disingenuously declaring that the quantum computer is equivalent to a random number generator.
- swiftcoder 6mo ago> seems like he is disingenuously declaring that the quantum computer is equivalent to a random number generator He's not such a declaration - he is saying that the program is constructed in such a way that the quantum computer is irrelevant to the solution
- PunchyHamster 6mo agowell, it's slower than random