←back to thread

335 points ingve | 1 comments | | HN request time: 0.209s | source
Show context
owlbite ◴[] No.45083253[source]
So how many gates are we talking to factor some "cryptographically useful" number? Is there some pathway that makes quantum computers useful this century?
replies(9): >>45083492 #>>45083705 #>>45084166 #>>45084245 #>>45084350 #>>45084520 #>>45085615 #>>45085735 #>>45088593 #
Strilanc ◴[] No.45085735[source]
> So how many gates are we talking to factor some "cryptographically useful" number?

Table 5 of [1] estimates 7 billion Toffoli gates to factor 2048 bit RSA integers.

> Is there some pathway that makes quantum computers useful this century?

The pathway to doing billions of gates is quantum error correction. [1] estimates distance 25 surface codes would be sufficient for those 7 billion gates (given the physical assumptions it lists). This amplifies the qubit count from 1400 logical qubits to a million physical noisy qubits.

Samuel Jacques had a pretty good talk at PQCrypto this year, and he speculates about timelines in it [2].

(I'm the author of this blog post and of [1].)

[1]: https://arxiv.org/pdf/2505.15917

[2]: https://www.youtube.com/watch?v=nJxENYdsB6c

replies(5): >>45086449 #>>45087996 #>>45088391 #>>45089529 #>>45101520 #
cubefox ◴[] No.45088391[source]
How do you go from 7 billion Toffoli gates (which consist of 42 billion "two-qubit entangling gates", per the blog post) to merely 1400 logical qubits?
replies(2): >>45089205 #>>45090314 #
Strilanc ◴[] No.45090314[source]
A gate isn't a qubit, it's an operation applied to qubits. You can do more than one operation per qubit.
replies(1): >>45092910 #
adgjlsfhk1 ◴[] No.45092910[source]
it probably should be called a qop (like a flop) rather than a gate which sounds like a measure of space.
replies(1): >>45097135 #
1. cwillu ◴[] No.45097135[source]
It comes from circuit depth