Walk through any quantum announcement and the first number is a physical qubit count. More qubits reads as more progress, so the obvious question is “which machine is the most powerful?” The question underneath is whether a quantum computer is dependable enough to do useful work.
This piece walks the major architectures and keeps returning to what sets the commercial timeline: how cheaply noisy physical qubits become dependable logical qubits, the real test of commercial readiness.
Quantum annealing vs gate-based quantum computing: how do they differ and which use cases fit each?
Quantum annealing turns an optimisation problem into an energy landscape and hunts for the lowest point. Gate-model machines run universal circuits and are the only route to fault-tolerant computing. Annealing suits scheduling, logistics and portfolio optimisation; the gate model targets chemistry, materials and cryptography.
D-Wave has shipped annealing across six generations, up to its Advantage2 system, and travel, transport and finance teams use it for scheduling and routing.
IBM’s Heron and Google’s Willow represent the gate model, where fault tolerance gets built. D-Wave’s own leadership is blunt: annealing handles optimisation, gate-model systems may never do those tasks well, and annealing can’t touch chemistry or novel-materials discovery.
What is the difference between a physical qubit and a logical qubit, and what is NISQ?
A physical qubit is the raw, noisy hardware unit: a superconducting circuit, an ion or an atom. A logical qubit is one reliable unit encoded across many physical qubits using quantum error correction. NISQ describes today’s uncorrected machines of roughly a thousand qubits. Vendors quote physical qubits; milestones are measured in logical qubits.
Qubits can’t be copied, so you spread one qubit’s worth of information across many physical qubits and correct errors as they appear. A fixed-connectivity superconducting machine needs hundreds to thousands of physical qubits per logical qubit, while reconfigurable neutral atoms bring that down to the order of a hundred.
What matters is how many dependable logical qubits those physical qubits convert into, which depends on error rates. Escaping NISQ requires error correction. Adding qubits without lowering error rates produces a bigger noisy machine, and delays the point at which you can run cryptography-breaking algorithms. That overhead is what separates the three gate-model modalities.
Superconducting qubits vs neutral atoms vs ion traps: which modality is most promising?
Superconducting qubits (IBM, Google) are fastest and most mature, but lower fidelity and fixed connectivity. Trapped ions (IonQ, Quantinuum) lead on fidelity and all-to-all connectivity, but are slower to scale. Neutral atoms (QuEra, Atom Computing) lead on scalability and reconfigurable connectivity, but have a younger ecosystem. When you compare them, weight fidelity and cost per logical qubit.
IBM fields 156-qubit Heron processors and targets a fault-tolerant machine by 2029. Trapped ions post the lowest error rates and all-to-all connectivity but run slower, while neutral atoms have scaled to arrays near ten thousand qubits with any-to-any connectivity.
Adjacent bets: Microsoft’s Majorana 1 chases topological qubits, Quantum Brilliance works on room-temperature diamond qubits, and IBM’s HRL acquisition adds silicon-spin qubits.
The weighting decides it: near-term fidelity favours trapped ions, fabrication maturity favours superconducting, long-term scaling favours neutral atoms. No modality wins all three at once.
What are neutral atom quantum computers and why could they reset the hardware leaderboard?
Neutral atom qubits are individual atoms, typically rubidium, held in optical tweezers, moved with acousto-optic deflectors and entangled through Rydberg states. Three recent signals suggest they could overtake the superconducting leaders: a logical-qubit record, Google’s dual-modality pivot and a nine-figure investment.
Single-qubit gates use hyperfine ground states with coherence times in seconds; two-qubit gates briefly drive atoms into a high-energy Rydberg state. The scaling edge is reconfigurability. As QuEra’s commercial officer puts it, “Neutral atoms can be moved around. That allows us to build error-correction methods that are just not possible with static qubits”.
QuEra set a January 2026 record with 96 logical qubits from 448 physical atoms. Google Quantum AI is now adding neutral atoms alongside its superconducting program, and Oratomic raised a $300M Series A. Atom Computing and Pasqal round out the field. The trade-off you accept is speed: atomic computations run slower. That scaling advantage only pays off if error correction turns those atoms into dependable logical qubits cheaply.
How does quantum error correction work and why does it determine when quantum becomes commercially useful?
Quantum error correction encodes one logical qubit across many physical qubits, detecting and correcting errors without disturbing the stored information. Error rates gate usefulness. Surface codes are the baseline, QLDPC codes raise encoding rates, and dual-rail correction makes it cheaper.
The surface code needs roughly 1,000 physical qubits per logical qubit at distance 23, while QLDPC codes cut that by about an order of magnitude. D-Wave’s dual-rail architecture embeds error detection in the qubits themselves, catching about 90% of errors as they happen and hitting 99.9% two-qubit fidelity. That’s why D-Wave agreed to acquire Quantum Circuits for $550M, reported to make error correction around ten times cheaper.
Lambda measures how fast errors fall as you add correction. D-Wave’s roadmap says the industry has demonstrated around 2, so errors roughly halve per increment, while D-Wave targets 10, a tenfold drop each time. The teraquop regime, roughly one error per trillion operations, is where deep algorithms become runnable. D-Wave’s roadmap runs to 100 logical qubits by 2032, per D-Wave’s 2026 commercial roadmap.
Which modality has the best qubit fidelity today, and how should you evaluate fault-tolerance claims?
Trapped-ion systems still post the best two-qubit fidelity, Google’s Willow has demonstrated below-threshold error correction, and neutral atoms lead on logical-qubit encoding efficiency. When you compare vendors, use lambda and QLOPS.
Quantinuum could scale its traps and junctions while holding all-to-all fidelity above 99.9% on Helios, as Scott Aaronson puts it. On Willow, Google showed the logical error rate roughly halving at each code-distance step, below-threshold but not the finish line.
Lambda is, in practice, a proxy for cost per logical qubit: faster suppression means fewer physical qubits per dependable logical qubit. QLOPS, logical operations per second, folds code rate, decoder accuracy, throughput and latency into a single measure of dependable operations. When you read a roadmap, ask for the encoding rate, measured logical error rate, and decoder throughput and latency.
Keep Microsoft’s Majorana 1 on the watchlist; as physicist Henry Legg puts it, “nothing in the presented data proves the existence of a topological qubit”. Use those criteria to decide whether to act now or wait.
Conclusion
The commercial timeline is set by error-correction economics. The unit that matters is the dependable logical qubit, measured on fidelity, encoding efficiency and cost per logical operation.
The question to ask is which roadmap makes dependable logical qubits cheapest. Neutral atoms show the leaderboard isn’t settled, but every architecture faces that same test. For the full picture, see the cluster overview and the piece on hybrid classical-quantum deployment.
Frequently Asked Questions
Are quantum computers faster than classical computers at everything?
No. Quantum computers are specialised accelerators, not general-purpose replacements for classical machines. They show an advantage only on particular problem classes such as simulating molecules, factoring large numbers and certain optimisation tasks. For most everyday workloads, a classical computer remains faster, cheaper and more reliable, so the practical question is which problems justify a quantum machine.
Does a higher physical qubit count automatically mean a better machine?
No. Raw qubit counts are the marketing headline, but they say nothing about how dependable the machine is. A smaller processor with higher fidelity and better connectivity can outperform a larger, noisier one. What matters commercially is how many reliable logical qubits the physical qubits can be converted into, which depends on error rates and encoding efficiency rather than the headline number.
How many logical qubits do we actually need before quantum computing becomes commercially useful?
There is no single number, because it depends on the algorithm. Fault-tolerant chemistry, materials and cryptography applications are typically estimated to need hundreds to a few thousand logical qubits once overheads are counted. Today’s leading machines demonstrate fewer than 100, so the commercial timeline is set less by adding physical qubits than by making each logical qubit cheaper to produce.
Why do vendors still advertise physical qubit counts if logical qubits are what matter?
Physical qubit counts are simple, headline-friendly and easy to increase, which makes them an effective marketing signal even though they do not measure commercial readiness. Logical qubit counts are harder to quote because they depend on fidelity, encoding rate and error correction. Buyers should treat physical counts as a starting point and ask for logical-qubit economics before comparing roadmaps.
What is a topological qubit, and why is Microsoft’s Majorana 1 significant?
A topological qubit encodes information in exotic quasiparticles whose properties are designed to make the qubit inherently resistant to certain errors. Microsoft’s Majorana 1 is built around this idea. If it works at scale, topological protection could reduce the overhead of quantum error correction, but the approach is younger and less proven than superconducting, trapped-ion and neutral-atom platforms, so it remains a long-shot bet to monitor.
Can you run useful quantum programs today without error correction?
Only in a limited way. Today’s noisy intermediate-scale quantum, or NISQ, machines can run small demonstrations and hybrid classical-quantum experiments, but errors accumulate quickly as circuits grow. They are useful for learning, benchmarking and early algorithm work, not yet for the dependable, large-scale commercial workloads that fault-tolerant logical qubits are expected to enable.
What exactly does qubit fidelity measure?
Qubit fidelity measures how reliably a quantum operation performs, expressed as the probability that a gate or readout produces the correct result. Leading trapped-ion systems now report two-qubit gate fidelities above 99.9 per cent. High fidelity matters because every error must be detected and corrected, so small differences in fidelity compound into large differences in the cost of building a logical qubit.
What does it mean when a processor operates below the error-correction threshold?
It means the machine’s physical error rates are low enough that adding more qubits to an error-correcting code makes the logical qubit more reliable, not less. Google’s Willow demonstrated this below-threshold behaviour. It is an important starting line for scalable error correction, but not the finish line, because the logical error rate must still fall far enough to support useful algorithms.
What is the lambda metric and how should I read it?
Lambda measures how quickly the logical error rate falls as you strengthen error correction, for example by increasing code distance. A lambda above one means error correction is working; a higher lambda means each step of added protection delivers a larger improvement and therefore cheaper logical qubits. It is a way to compare how efficiently different machines suppress errors, independent of physical qubit counts.
What is QLOPS and why does it matter more than physical qubit count?
QLOPS stands for logical operations per second, the number of dependable, error-corrected operations a machine can complete. It combines gate speed, fidelity and error-correction overhead into one usefulness measure. Physical qubit counts ignore all three, which is why QLOPS is a stronger guide to commercial readiness when you compare vendor roadmaps.
When will quantum computers be able to break today’s encryption?
Breaking today’s encryption requires a cryptographically relevant quantum computer, a fault-tolerant machine large and reliable enough to run Shor’s algorithm efficiently. Estimates generally point to the late 2030s or 2040s, but they depend heavily on error-correction progress. The safe move is to begin post-quantum migration on current timelines rather than waiting for a breakthrough announcement.
Should my business act on quantum now or wait for fault tolerance?
For most organisations the right move is to prepare, not to buy. Build internal literacy, identify problems that could benefit from quantum approaches and run small hybrid classical-quantum pilots through cloud access. Fault-tolerant machines are still years away, but the organisations that map use cases and skills now will be positioned to adopt them when logical-qubit economics improve.
