
The Road to Fault Tolerance
Today: noisy, intermediate-scale machines
Today’s gate-based quantum computers have from tens to more than a thousand physical qubits. They are noisy: errors accumulate during a computation, which limits the size of the circuits they can run reliably. This stage is often called noisy intermediate-scale quantum (NISQ) computing. Quantum error correction has moved from theory to early experimental demonstrations.
Next: early fault tolerance
The next stage is early fault-tolerant machines, in which error-corrected logical qubits, each encoded in many physical qubits, run circuits deeper than noisy hardware allows. Simulation of molecules and materials is often named as a candidate for the first useful applications.
Long term: large-scale fault tolerance
Large-scale fault-tolerant quantum computers will need many thousands to millions of physical qubits, depending on the task, the error rates and the error correction scheme. For example, published estimates for factoring a 2048-bit RSA number fell from about 20 million physical qubits running for about 8 hours (Gidney and Ekerå, 2019) to under one million running for under a week (Gidney, 2025), both assuming a 0.1% gate error rate. Fewer qubits come at the cost of a longer run time. Building them requires progress at every layer: qubit quality, control and readout, wiring, cooling, and software.
Why the superconducting approach matters
Superconducting qubits are one of the leading platforms for scalable quantum computers: their fabrication builds on mature lithography, and their gates are fast. Scaling them requires better coherence and gate fidelity, and it also raises a system engineering problem: wiring, heat load, and control at scale. Phi₀ works on this system problem, from circuit design to system deployment.
Further reading
- J. Preskill, Quantum Computing in the NISQ era and beyond, Quantum 2, 79 (2018)
- C. Gidney and M. Ekerå, How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits, Quantum 5, 433 (2021)
- C. Gidney, How to factor 2048 bit RSA integers with less than a million noisy qubits, arXiv:2505.15917 (2025)