Foundations of Quantum Computing

Quantum computing is often described as “magic,” but it rests on a small set of physical principles. If you understand five ideas — qubit, superposition, entanglement, quantum gates, and decoherence — you’ve grasped most of what makes a quantum computer different from the laptop on your desk. This article walks through each idea in turn, for an informed but non-specialist audience.

What is a Qubit?

A classical bit is the fundamental unit of digital information. It is always either a 0 or a 1, like a light switch that is either off or on. A qubit (quantum bit) is the quantum equivalent, but with a key difference: until you measure it, a qubit can exist in a blend of both 0 and 1 simultaneously. This blend is called superposition.

A common way to visualize a qubit is using the Bloch sphere: imagine a globe, where the north pole represents the 0 state and the south pole represents the 1. A classical bit can only be at one of the two poles. A qubit can point anywhere on the surface of the sphere, encoding a continuous mixture of 0 and 1, along with a “phase” angle that has no classical equivalent.

It’s tempting to say that a qubit is “both 0 and 1 at the same time,” and that’s a useful initial approximation, but the truthful version is more subtle: a qubit holds a set of probabilities, and only when measured does it collapse into a definite 0 or 1 value. (See Frontiers’ overview of quantum computing foundations.)

Superposition and Exponential Scaling

The reason superposition matters lies in what happens when you combine multiple qubits. Each additional qubit doubles the number of states the system can represent simultaneously:

• 3 qubits can represent 2³ = 8 states at once
• 10 qubits can represent 2¹⁰ = 1,024 states
• 50 qubits can represent approximately a quadrillion (10^15) states
• 100 qubits can represent 2¹⁰⁰ states — more than the number of atoms in the observable universe

A classical computer would have to consider these combinations one by one. A quantum computer, in a sense, can hold all of them at once and process them collectively. This is the root of “quantum speedup,” but with a crucial caveat we’ll return to below: you can’t simply read out all those states. The art of quantum algorithm design is to navigate this massive superposition towards a single, useful answer. (See Quantum Computing in 2026: The State of the Race.)

Entanglement

Entanglement is the second pillar, and perhaps the strangest. When two or more qubits become entangled, their fates are linked: measuring one instantly tells you something about the others, no matter how far apart they are.

The key point is that entangled qubits cannot be described independently. You can’t say “qubit A is in this state and qubit B is in that state.” The system must be described as a whole. These correlations are stronger than anything classical physics allows, and a classical computer cannot efficiently reproduce them. Entanglement is what allows quantum algorithms like Shor’s (for factoring) and Grover’s (for searching) to exploit relationships between all superposed possibilities at once. (See What Is Quantum Computing? The Complete Guide 2026.)

Quantum Gates and Circuits

Just as classical computers manipulate bits using logic gates (AND, OR, NOT), quantum computers manipulate qubits using quantum gates. The difference is that quantum gates are reversible and operate on superpositions. A few common gates:

Gate	What it does
Hadamard (H)	Takes a definite 0 or 1 and puts it into an even superposition
Pauli-X, Y, Z	Flips the bit value or its phase
CNOT	A two-qubit gate that creates entanglement between qubits
Phase and T gates	Provide additional operations needed for universal computation

Connecting gates together creates a quantum circuit — the quantum equivalent of a program. Because operations are reversible and act on superpositions, a single circuit effectively transforms many possibilities in parallel.

Measurement and Interference

Here’s the catch that separates hype from reality. A quantum computer holding 2¹⁰⁰ states sounds like it can do 2¹⁰⁰ things at once — but when you measure, you only get one answer, chosen randomly according to the underlying probabilities. The superposition collapses.

So quantum algorithms aren’t actually “trying every possibility and reading them all out.” Instead, they use quantum interference. Like ripples on a pond, the probability amplitudes for different computational paths can add together (constructive interference) or cancel each other out (destructive interference). A well-designed algorithm arranges things so that paths leading to the correct answer reinforce each other, while incorrect answers cancel out. Only then do you measure, and the correct answer emerges with high probability. (See Frontiers’ foundational article.)

This is the most important conceptual correction for newcomers: quantum advantage comes from orchestrating interference, not from brute-force parallelism.

Decoherence: The Central Obstacle

If quantum computers are so powerful, why don’t we have useful machines everywhere? The answer is decoherence. Quantum states are incredibly fragile. Any stray interaction with the environment — heat, vibration, electromagnetic noise — jostles the qubit and destroys its delicate superposition and entanglement, pulling it back towards ordinary classical behavior.

The relevant metric here is coherence time: how long a qubit retains its “quantum-ness” before noise spoils it. Coherence times vary greatly depending on the hardware:

Hardware Type	Typical Coherence Time
Superconducting qubit	100–500 microseconds
Trapped ion	seconds to minutes (specialized encodings reach ~10 hours)
Neutral atom	~10 microseconds to 100 milliseconds
Photonic qubit	microseconds to milliseconds

As of 2026, researchers have demonstrated coherence exceeding ten hours using trapped ytterbium ions with a “decoherence-free subspace” encoding — a remarkable result, though such extreme numbers apply only to specialized clock qubits, not general-purpose computation. (See Beyond-Ten-Hour Coherence in a Decoherence-Free Trapped-Ion Clock Qubit.)

Combating decoherence is the dominant engineering challenge in the field, and it dictates almost everything else: hardware design choices, the need for error correction, and the gap between today’s noisy machines and the fault-tolerant computers of the future.

Putting It All Together

A quantum computer encodes information in qubits, puts them into superposition, links them via entanglement, transforms them with reversible gates, and harnesses interference such that measurement yields a useful answer — all while racing against decoherence. None of these ideas are intuitive, but together they form a coherent picture of why quantum machines, in principle, can solve some problems intractable for classical computers, and why building them is so hard.

References

• Frontiers: Quantum computing: foundations, algorithms, and emerging applications
• Medium: Quantum Computing in 2026: The State of the Race
• QuantumZeitgeist: What Is Quantum Computing? The Complete Guide 2026
• arXiv: Beyond-Ten-Hour Coherence in a Decoherence-Free Trapped-Ion Clock Qubit
• QuantumZeitgeist: Decoherence Explained — Complete 2026 Guide