In May 2026, the US Department of Commerce announced it would invest $2.013 billion in nine quantum computing companies — including IBM, GlobalFoundries, D-Wave, and Rigetti — taking equity stakes in exchange. IBM alone received $1 billion to build America's first dedicated quantum chip foundry, called Anderon.
The justification? Quantum computing, the government said, has "significant implications for national defense, advanced materials and biopharmaceutical discovery, financial modeling, and energy systems."
That's a lot of implications for a technology most people can't fully explain. So let's fix that.
First: What's Wrong With Regular Computers?
Nothing, for most things. Classical computers — the ones running everything from your phone to the server hosting this page — are extraordinarily good at following instructions. They store information as bits: switches that are either off (0) or on (1). Chain enough of those together and you can simulate physics, render movies, run financial models, power the internet.
The problem shows up at the edges. Some problems are so complex that even the fastest supercomputer on Earth would take longer than the age of the universe to solve them. Not because our computers are slow — because the problems themselves grow exponentially with scale.
Simulating a drug molecule at the quantum level. Breaking certain encryption schemes. Optimizing global supply chains. These are tasks where classical computers hit a wall not of speed, but of fundamental architecture.
Quantum computers are built to attack exactly that wall.
So What Is a Qubit?
A classical bit is a coin lying flat: heads or tails. A qubit is that same coin while it's spinning in the air — it's both at once, in a precise mathematical combination. This is called superposition, and it's one of the genuinely strange features of quantum mechanics.
It's not a trick or an approximation. The qubit genuinely has no definite value until you measure it. Before measurement, it exists in a superposition of 0 and 1 simultaneously, described by a wave function — a mathematical object that encodes all the possibilities and their probabilities at once.
A 3-qubit system can represent 8 states (2³) simultaneously. A 50-qubit system: 2⁵⁰ ≈ 1,000,000,000,000,000 states at once. A classical computer needs to check each one individually.
This is why quantum computers are interesting for certain problems: they can, in principle, explore an astronomically large solution space in parallel — not by brute force, but by exploiting the wave-like nature of quantum information.
Want to see superposition in action? Try the interactive superposition simulator →
The Secret Ingredient: Entanglement
Superposition alone isn't enough. The real power of quantum computing comes from entanglement — a phenomenon Einstein called "spooky action at a distance" because it bothered him so much.
When two qubits become entangled, their states are linked. Measure one, and you instantly know something about the other — no matter how far apart they are. More practically: entangled qubits don't just hold two independent superpositions. They hold a correlated superposition across both, which lets quantum algorithms encode and manipulate relationships between variables in ways classical bits simply can't.
It's this combination — superposition plus entanglement plus a third trick called interference — that makes quantum algorithms work. The algorithm is designed so that wrong answers cancel each other out (destructive interference) while the right answer is amplified (constructive interference). You don't check every possibility; you set up a quantum wave that naturally collapses toward the solution.
Dive deeper: Quantum Entanglement — Interactive Demo →
So Why Isn't This Replacing Your Laptop?
Because qubits are extraordinarily fragile.
The quantum states that make qubits useful — superposition, entanglement — are destroyed by any interaction with the environment. A stray photon. A vibration. A tiny fluctuation in temperature. The technical term for this destruction is decoherence, and it's the central engineering challenge of the entire field.
This is why quantum computers currently need to be cooled to temperatures colder than outer space — around 15 millikelvin, or about 273 degrees below zero Celsius. It's why they're housed in isolation chambers the size of chandeliers. And it's why the Department of Commerce is funding IBM to build specialized quantum chip foundries: manufacturing qubits that maintain coherence long enough to be useful requires infrastructure that barely exists yet.
The physics of fragility: Quantum Decoherence — Why Quantum States Collapse →
What Is "Quantum Advantage" — And Are We There?
Quantum advantage is the moment a quantum computer solves a real, useful problem faster than any classical computer could. Not a contrived benchmark — an actual problem someone cares about.
IBM CEO Arvind Krishna made headlines in May 2026 when he told an audience at IBM Think: "We believe quantum advantage will be reached this year. That's not 20 years away." IBM estimates quantum computing will generate up to $850 billion in economic value by 2040. McKinsey projects up to $1.3 trillion in value for just four industries — automotive, chemicals, financial services, and life sciences — by 2035.
The skeptics are reasonable too. Quantum computers today still have high error rates, limited qubit counts, and short coherence times. The nine companies receiving federal funds are all working on different technical approaches — superconducting qubits (IBM), trapped ions (Quantinuum), neutral atoms (Infleqtion, Atom Computing), photonic systems (PsiQuantum) — because nobody knows yet which architecture will win.
The $2 billion bet is essentially the government saying: we don't know which horse wins, so we're backing the whole stable.
Why Does This Matter for Security?
One reason governments are nervous: a sufficiently powerful quantum computer could break most of the encryption that currently protects the internet. The RSA encryption underpinning banking, email, and government communications relies on the fact that factoring large numbers is computationally hard. For classical computers, it is. For a fault-tolerant quantum computer running Shor's algorithm, it isn't.
This isn't an imminent threat — we're nowhere near the qubit counts needed — but it's why NIST has already standardized post-quantum cryptography algorithms, and why "harvest now, decrypt later" attacks (where adversaries collect encrypted data today to decrypt it once quantum computers exist) are a real national security concern.
The defense angle explains why the Trump administration framed this as a national security investment, not just a science funding initiative.
The Physics Underneath All of This
Everything above — qubits, superposition, entanglement, decoherence — traces back to quantum mechanics, the branch of physics that describes how reality works at the smallest scales. And quantum mechanics is genuinely, provably, experimentally weird in ways that have no classical analogue.
Particles don't have definite properties until they're measured. Two particles can share a single quantum state across arbitrary distances. Observation changes outcomes. The universe, at its base level, runs on probability amplitudes rather than certainties.
Quantum computing isn't magic — it's engineering built directly on top of these phenomena. Understanding the physics isn't just academic context. It's the only way to understand what these machines actually do, why they're hard to build, and what they'll eventually be capable of.