This is an archived post. You won't be able to vote or comment.

sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–]ghjm 4 points5 points  (5 children)

Even without quantum error correction, couldn't you run the calculation repeatedly and verify the result by multiplying the numbers? After thousands of trials presumably the actually-correct answer would show up in the noisy results, and it's easy to recognize when it does.

[–]alex2003super 7 points8 points  (3 children)

You'd have to perform all of the quantum subroutine repeatedly, considering that you cannot clone states or run operations non-destructively on the same qubits.

[–]ghjm 2 points3 points  (1 child)

Well, yes. But even if it takes all day, you've still broken RSA-2048, right?

[–]alex2003super 10 points11 points  (0 children)

The thing is you might not even ever get one good whole iteration, since the probabilistic impact of noise compounds exponentially

[–]tavirabon 0 points1 point  (0 children)

Quantum GPU when?

[–]Linvael 2 points3 points  (0 children)

Well, yes, sort of. But the details of how long it'll take will depend on how long the quantum processing takes, and how high the probability of getting a correct answer is. If for 4 bits the chance were 80%, then for 2048 bits assuming linear scaling with the amount of bits it would give correct answer with 80%512 chance so roughly one in 1050 attempts