←back to thread

335 points ingve | 1 comments | | HN request time: 0s | 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 #
nabla9 ◴[] No.45084520[source]
For RSA 4096 10^7 qubits with 10^-4 error rate (order of magnitude).

You can do useful and valuable quantum chemistry calculations already with few 100s of qubits with that low error rates, while post-quantum algorithms are becoming more common everyday removing incentives to build crypto cracking quantum computers.

I think the quantum computing will advance fastest in directions that are not easy to use in cryptography.

replies(2): >>45086146 #>>45088729 #
HappyPanacea ◴[] No.45086146[source]
Which valuable quantum chemistry calculations you can do with few 100s of qubits with that low error rates?
replies(1): >>45087376 #
1. nabla9 ◴[] No.45087376{3}[source]
The general idea is that with N fault-tolerant qubits, you can find the ground-state energy of an electronic system with N spin orbitals. 100 spin orbitals is the practical upper limit of current computers, so when you get into several hundred qubits, you can start seeing gains.

In some special problems hybrid methods start giving gains in 100 qubits or below.

Gate count estimates for performing quantum chemistry on small quantum computers https://arxiv.org/pdf/1312.1695

A Perspective on Quantum Computing Applications in Quantum Chemistry using 25--100 Logical Qubits https://arxiv.org/pdf/2506.19337