The Quantum Internet Vision

The classical internet moves bits: copies of information that can be amplified, cached, and broadcast freely. A quantum internet moves qubits and, more fundamentally, entanglement between distant nodes. That single difference reshapes everything, because the laws that make quantum information powerful — superposition, the no-cloning theorem, and entanglement — also make it fragile and impossible to copy.

Why not just send qubits over fibre?

A qubit can be encoded in a single photon and sent down an optical fibre. The trouble is loss: the probability that a photon survives a fibre of length $L$ decays exponentially,

p_{\text{survive}} = 10^{-\alpha L / 10},

where $\alpha \approx 0.2\ \text{dB/km}$ for telecom fibre. Over $1000\ \text{km}$ that is a survival probability of $10^{-20}$ — at gigahertz rates that is only about one photon arriving every few thousand years. A classical signal would simply be re-amplified by repeaters along the way, but the no-cloning theorem forbids copying an unknown quantum state, so amplification is off the table. This single obstacle is what makes long-distance quantum communication a genuine engineering frontier.

Entanglement as the universal resource

The decisive insight of this module is that you rarely need to send an arbitrary qubit directly. Instead, you first establish a shared Bell pair

|\Phi^+\rangle = \frac{|00\rangle + |11\rangle}{\sqrt{2}}

between the two nodes. Once that entanglement exists, you can:

teleport an arbitrary qubit using the Bell pair plus two classical bits (no qubit travels);
extend entanglement across many hops by entanglement swapping;
purify noisy pairs into fewer, higher-fidelity ones;
run distributed gates, blind computation, and device-independent cryptography.

Entanglement is therefore the currency of a quantum network. The hard part is distributing and preserving it — which is exactly what the rest of this module builds, one primitive at a time.

A staged roadmap

Wehner, Elkouss and Hanson describe the quantum internet as a ladder of increasing capability, each rung unlocking new applications[^wehner-stages]:

| Stage | Capability | Example application | |-------|------------|---------------------| | 1 | Trusted-repeater key exchange | Conventional QKD networks | | 2 | Prepare-and-measure end nodes | Position verification | | 3 | Entanglement distribution | Device-independent QKD | | 4 | Quantum memory at nodes | Blind quantum computing | | 5 | Fault-tolerant few-qubit nodes | Distributed quantum computing | | 6 | Quantum computing networks | Networked fault-tolerant clusters |

Each higher stage strictly contains the powers of the ones below it. The defining transition is Stage 3: the moment nodes can reliably share entanglement, the network stops being a glorified classical channel and starts being genuinely quantum.

What "distributed quantum computing" buys you

Building one monolithic processor with millions of physical qubits is extraordinarily hard. An alternative is to wire together many modest quantum modules with entangling links, so they behave like one larger machine. If two modules share Bell pairs, a logical two-qubit gate between them can be executed by consuming entanglement and exchanging classical bits — a technique you will implement later in this module. This modular vision mirrors how classical supercomputers are built from networked nodes, and it is one of the most credible paths to scale.

The road ahead in this module

Over the next lessons you will build the primitives of a quantum network from the ground up: distributing Bell pairs, swapping entanglement to bridge distance, repeaters, teleported gates, purification, link-layer protocols, blind computation, multiparty (GHZ) entanglement, and finally a two-node protocol checkpoint. Everything will run on the same state-vector simulator you already know, so you can watch each protocol succeed amplitude by amplitude.