In short

A tiny quantum network is three nodes — Alice, a middle station (call it Mid), and Bob — connected by short photonic links and equipped with quantum memories. Alice has a qubit |\psi\rangle she wants to deliver to Bob. Neither Alice–Bob nor any single long-distance link is available; only two shorter links, Alice–Mid and Mid–Bob. The protocol combines two primitives you have already met: first, Mid uses a Bell measurement to perform entanglement swapping (ch.52) on its two pre-distributed Bell pairs, leaving Alice and Bob sharing a fresh Bell pair despite never having interacted directly; second, Alice uses that newly-distilled Alice–Bob Bell pair to teleport (ch.50) her qubit to Bob. Total resources consumed: two Bell pairs and four classical bits (two from the swap, two from the teleport); total quantum channel length traversed by any single qubit: one short hop (either Alice–Mid or Mid–Bob, never both). The running time is dominated by classical-channel latency — at roughly the speed of light — plus the time quantum memories must hold state while waiting for the next step. This three-node protocol is the building block of a quantum repeater; chain many of them and you have the beginning of a quantum internet. The chapter derives the protocol, counts the resources, discusses the hardware ingredients (photon-pair sources, quantum memories), and places India's 2022 ISRO Bengaluru–Mt. Abu satellite QKD experiment on the roadmap.

You have seen three quantum primitives in isolation. Quantum teleportation (ch.50) moves a qubit state from Alice to Bob if they share a Bell pair. Entanglement swapping (ch.52) stitches two Bell pairs at a middle node into a single longer Bell pair. Superdense coding (ch.51) sends two classical bits down a single qubit channel when a Bell pair is pre-shared. Each primitive, on its own, has a clean protocol description and a clean proof of correctness.

What the world needs is for these primitives to compose. A useful quantum communication system is not one that moves one qubit over 10 metres in a lab; it is one that moves qubits over continental distances, across many nodes, through unreliable links and noisy hardware. Nobody has built that. But every proposal for how to build it starts with the same minimal configuration: three nodes, two links, a memory in the middle. This is the tiny quantum network — the smallest network bigger than a point-to-point line — and it is the piece you stitch end to end to make a quantum internet.

This chapter derives the full three-node protocol, step by step. You will see exactly how teleportation and swapping compose, how the resources are counted, what the hardware at each node needs to do, and why even this "tiny" configuration has not yet been run end-to-end in production.

The setup — three nodes, two links

Draw the picture before the formulas.

The three-node quantum networkThree boxes in a row labelled Alice, Mid, and Bob. Alice holds two qubits labelled S (her source qubit in state psi) and A1 (her half of the first Bell pair). Mid holds two qubits labelled A2 and B1 (the other halves of the two Bell pairs). Bob holds one qubit labelled B2 (his half of the second Bell pair). Two shaded bands show the entanglement: one between A1 and A2, another between B1 and B2. A dashed line below indicates the classical channels from Alice and Mid to Bob.AliceS|ψ⟩A₁MidA₂B₁quantum memoryBobB₂receives |ψ⟩|Φ⁺⟩ pair 1|Φ⁺⟩ pair 2classical channels (4 cbits total)
The three-node tiny network. Alice holds her source qubit $S$ (in unknown state $|\psi\rangle$) and one half of pair 1. Mid holds the other half of pair 1 and one half of pair 2. Bob holds the other half of pair 2. Classical channels connect Alice→Bob and Mid→Bob.

There are three physical nodes, and five qubits in play across them.

The two Bell pairs are prepared in advance by local photon-pair sources — one source sits between Alice and Mid (distributing A_1 to Alice and A_2 to Mid), another sits between Mid and Bob (distributing B_1 to Mid and B_2 to Bob). Each pair is in the state |\Phi^+\rangle = \tfrac{1}{\sqrt{2}}(|00\rangle + |11\rangle). Each link has whatever photon-survival probability the hardware allows, and we assume success: once the pairs are shared and stored in the three nodes' quantum memories, the network is ready to run the protocol.

Classical channels — normal electromagnetic communication, speed-of-light constrained — connect every pair of nodes. We'll use them to send a total of four classical bits during the protocol (two from Mid to Bob for the swap, two from Alice to Bob for the teleport).

No direct quantum channel connects Alice to Bob. This is the whole point of the network: Alice's qubit |\psi\rangle will reach Bob without any physical quantum carrier ever traversing the Alice–Bob distance.

The protocol — four steps

Here is the full procedure. Walk through the diagram below while reading each step.

  1. Entanglement swap at Mid. Mid performs a Bell measurement on its two qubits A_2 and B_1. The measurement yields two classical bits (m_1, m_2), and projects the outer pair (A_1, B_2) — Alice's and Bob's qubits — onto a specific Bell state determined by (m_1, m_2). This is exactly entanglement swapping (ch.52): two short Bell pairs become one long Bell pair.
  2. Pauli correction from swap. Mid sends (m_1, m_2) to Bob over the classical channel. Bob applies the Pauli correction X^{m_2} Z^{m_1} to B_2. After this, Alice and Bob share a deterministic |\Phi^+\rangle_{A_1 B_2} Bell pair.
  3. Teleport at Alice. Alice performs a Bell measurement on her two qubits S and A_1, yielding two more classical bits (t_1, t_2). This is the first half of the teleportation protocol (ch.50).
  4. Pauli correction from teleport. Alice sends (t_1, t_2) to Bob. Bob applies X^{t_2} Z^{t_1} to B_2. After this, Bob's qubit is exactly |\psi\rangle — the state Alice started with on her source qubit S.
Four-step protocol diagramA four-step vertical flow diagram. Step 1 shows Mid performing a Bell measurement on A2 and B1, emitting two classical bits m1 and m2, and leaving Alice's A1 and Bob's B2 in a Bell state. Step 2 shows Bob receiving m1 and m2 and applying Pauli corrections, establishing a deterministic Phi-plus pair between Alice and Bob. Step 3 shows Alice performing a Bell measurement on S and A1, emitting bits t1 and t2. Step 4 shows Bob receiving t1 and t2 and applying another Pauli correction, leaving his qubit in state psi.Step 1Mid does Bell measurement on (A₂, B₁)outputs classical bits (m₁, m₂); (A₁, B₂) now in a Bell stateentanglement swapStep 2Mid sends (m₁, m₂) to Bob; Bob applies Xᵐ² Zᵐ¹ to B₂(A₁, B₂) now deterministic |Φ⁺⟩ — Alice and Bob share a fresh Bell pair2 cbits Mid→BobStep 3Alice does Bell measurement on (S, A₁)outputs classical bits (t₁, t₂); B₂ now holds a Pauli-distorted |ψ⟩teleportation part 1Step 4Alice sends (t₁, t₂) to Bob; Bob applies Xᵗ² Zᵗ¹ to B₂B₂ = |ψ⟩. Done.2 cbits Alice→Bob
The four-step protocol. Steps 1-2 perform an entanglement swap: Mid's local Bell measurement plus Bob's correction bits leaves Alice and Bob sharing a Bell pair. Steps 3-4 perform teleportation: Alice's local Bell measurement plus Bob's correction bits transfers $|\psi\rangle$ onto $B_2$.

At no step does any qubit travel from Alice to Bob directly. The only things that cross the full Alice-to-Bob distance are classical bits — four of them, at sub-light speed. The quantum carriers (the photons that established the Bell pairs) each traversed only one link, and they did so before the protocol began.

Why it works — the state trace

Track the state of all five qubits through each step. Use qubit ordering (S, A_1, A_2, B_1, B_2).

Initial state. Alice's source S is in |\psi\rangle = \alpha|0\rangle + \beta|1\rangle. The two Bell pairs are |\Phi^+\rangle_{A_1 A_2} = \tfrac{1}{\sqrt 2}(|00\rangle + |11\rangle) and |\Phi^+\rangle_{B_1 B_2} = \tfrac{1}{\sqrt 2}(|00\rangle + |11\rangle). The joint state:

|\Omega_0\rangle = (\alpha|0\rangle + \beta|1\rangle)_S \otimes \tfrac{1}{\sqrt 2}(|00\rangle + |11\rangle)_{A_1 A_2} \otimes \tfrac{1}{\sqrt 2}(|00\rangle + |11\rangle)_{B_1 B_2}.

Expand:

|\Omega_0\rangle = \tfrac{1}{2}\bigl[\alpha|0\rangle_S\bigl(|00\rangle + |11\rangle\bigr)_{A_1 A_2}\bigl(|00\rangle + |11\rangle\bigr)_{B_1 B_2} + \beta|1\rangle_S\bigl(|00\rangle + |11\rangle\bigr)_{A_1 A_2}\bigl(|00\rangle + |11\rangle\bigr)_{B_1 B_2}\bigr].

Why we leave it in this factored form for now: the first non-trivial operation is the Bell measurement on (A_2, B_1), and the most transparent way to predict its effect is to express the middle-pair subsystem in the Bell basis — just like in ch.52 on entanglement swapping. We'll expand step by step.

Step 1 — Mid's Bell measurement on (A_2, B_1). From the entanglement-swapping chapter, you know the identity:

|\Phi^+\rangle_{A_1 A_2} \otimes |\Phi^+\rangle_{B_1 B_2} = \tfrac{1}{2}\sum_{\text{Bell } k} |\text{Bell } k\rangle_{A_2 B_1} \otimes |\text{Bell } k\rangle_{A_1 B_2},

where the sum runs over the four Bell states |\Phi^+\rangle, |\Phi^-\rangle, |\Psi^+\rangle, |\Psi^-\rangle. Applied to our state, and tensoring with Alice's source:

|\Omega_0\rangle = \tfrac{1}{2}|\psi\rangle_S \otimes \Bigl[|\Phi^+\rangle_{A_2 B_1}|\Phi^+\rangle_{A_1 B_2} + |\Phi^-\rangle_{A_2 B_1}|\Phi^-\rangle_{A_1 B_2} + |\Psi^+\rangle_{A_2 B_1}|\Psi^+\rangle_{A_1 B_2} + |\Psi^-\rangle_{A_2 B_1}|\Psi^-\rangle_{A_1 B_2}\Bigr].

Mid measures (A_2, B_1) in the Bell basis, selecting one of the four Bell states with probability \tfrac{1}{4}. Say Mid reads (m_1, m_2) = (0, 0), which the standard Bell-measurement circuit maps to |\Phi^+\rangle_{A_2 B_1}. (The same analysis extends to the other three outcomes via Pauli corrections.)

After Mid's measurement and conditioning on (0, 0):

|\Omega_1\rangle = |\psi\rangle_S \otimes |\Phi^+\rangle_{A_1 B_2}.

Why A_1 and B_2 are now entangled despite never having met: the two middle qubits were each entangled with an outside qubit. Measuring the middle pair in the Bell basis collapses the outer two into a correlated Bell state — this is exactly entanglement swapping. The four branches of the Bell measurement map one-to-one onto the four Bell states of the outer pair, and the two classical bits (m_1, m_2) label which outer Bell state popped out.

Step 2 — Bob applies the swap correction. Bob receives (m_1, m_2) = (0, 0). The swap table (ch.52, Example 2) says: for (0, 0), apply I (do nothing). The Alice–Bob pair is already in |\Phi^+\rangle; no correction needed. For the other three outcomes, Bob applies Z, X, or XZ respectively.

After step 2, regardless of what Mid's outcome was, Alice and Bob deterministically share |\Phi^+\rangle_{A_1 B_2}. The state is

|\Omega_2\rangle = |\psi\rangle_S \otimes |\Phi^+\rangle_{A_1 B_2}.

Mid's two qubits A_2 and B_1 are now in the specific computational-basis state labelled by (m_1, m_2) — they are used up and can be discarded (or reused later after re-initialisation).

Step 3 — Alice's Bell measurement on (S, A_1). This is the first half of teleportation (ch.50). Alice applies CNOT with S as control and A_1 as target, then Hadamard on S, then measures both S and A_1 in the computational basis. The result is two classical bits (t_1, t_2) and Bob's qubit B_2 is in a Pauli-distorted version of |\psi\rangle:

(t_1, t_2) Bob's B_2 state
(0, 0) |\psi\rangle
(0, 1) X|\psi\rangle
(1, 0) Z|\psi\rangle
(1, 1) XZ|\psi\rangle (up to global phase)

Each outcome has probability 1/4.

Step 4 — Bob applies the teleport correction. Alice sends (t_1, t_2) to Bob. Bob applies X^{t_2} Z^{t_1} to B_2. The correction inverts the Pauli distortion:

Final state. In all cases, Bob's qubit B_2 is in |\psi\rangle. Alice's qubits S and A_1 are in the computational-basis state |t_1 t_2\rangle — used up. Mid's qubits are already used up from step 1.

Why the protocol is deterministic despite containing two random measurements: each measurement's four possible outcomes are each paired with a specific Pauli correction that exactly inverts the measurement-dependent distortion. The randomness is absorbed by the correction, and the final result is always |\psi\rangle. The same accounting principle drove both the teleportation and swapping chapters.

The protocol is complete. Bob holds |\psi\rangle, which Alice started with. No qubit ever moved from Alice to Bob directly; all that moved between them was four classical bits (two from Mid, two from Alice).

Resource accounting

Count what the protocol used.

Resource accounting for the tiny networkA resource-flow diagram. Left column lists the inputs: two Bell pairs, one source qubit psi, three quantum memories (one at each node). Middle column shows the operations: one Bell measurement at Mid, one Bell measurement at Alice, two Pauli corrections at Bob. Right column shows the output: one qubit psi at Bob. A caption at the bottom notes that four classical bits were used.Consumed2 Bell pairs (2 ebits)1 source qubit |ψ⟩3 quantum memories(holding qubits briefly)plus 4 classical bits(2 Mid→Bob, 2 Alice→Bob)OperationsBell meas. @ Mid(entanglement swap)Bell meas. @ Alice(teleportation part 1)2 Pauli corrections@ BobDelivered|ψ⟩on Bob's qubit B₂quantum channellength traversed byany single qubit: 1 hop
Resource accounting for the tiny network. Two Bell pairs plus four classical bits plus three quantum memories — and Alice's $|\psi\rangle$ ends up on Bob's qubit without any qubit traversing the full Alice–Bob distance.

This is the fundamental trade. You paid for entanglement in advance (distributing two Bell pairs over short hops); during the protocol, you paid only in classical bits and local gate operations. The clever accounting is what the phrase "quantum internet" really describes: an infrastructure that pre-distributes entanglement over a network of short links, so that applications later consume that entanglement to achieve long-distance quantum communication without long-distance quantum transmission.

The hardware ingredients

What does each node need?

None of these is simple. All are active research topics. The fact that individual components exist in separate labs around the world does not mean they have been assembled into a working three-node network yet — though several groups (Delft QuTech, Innsbruck, Argonne) have demonstrated subsets of this protocol on small scales.

Worked examples

Example 1 — Full state trace for Mid outcome $(0, 0)$ and Alice outcome $(1, 0)$

Follow one specific sample run end-to-end. |\psi\rangle = \alpha|0\rangle + \beta|1\rangle. Assume Mid reads (m_1, m_2) = (0, 0) and Alice reads (t_1, t_2) = (1, 0).

Step 0 — initial state.

|\Omega_0\rangle = (\alpha|0\rangle + \beta|1\rangle)_S \otimes |\Phi^+\rangle_{A_1 A_2} \otimes |\Phi^+\rangle_{B_1 B_2}.

Step 1 — Mid Bell-measures (A_2, B_1), outcome (0, 0) projecting to |\Phi^+\rangle. Apply the entanglement-swapping identity from ch.52:

|\Omega_1\rangle = |\psi\rangle_S \otimes |\Phi^+\rangle_{A_1 B_2}.

(Plus Mid's qubits in |00\rangle_{A_2 B_1}, which we now discard.)

Why this works: the Bell-basis expansion of |\Phi^+\rangle_{A_1 A_2} \otimes |\Phi^+\rangle_{B_1 B_2} gives four equal-amplitude terms of the form |\text{Bell}_k\rangle_{A_2 B_1} \otimes |\text{Bell}_k\rangle_{A_1 B_2}. Mid's measurement picks one term — the |\Phi^+\rangle term for outcome (0, 0) — and the other qubits are left in the correlated |\Phi^+\rangle_{A_1 B_2}.

Step 2 — Bob applies swap correction for (0, 0): identity. Bob does nothing. The state remains |\psi\rangle_S \otimes |\Phi^+\rangle_{A_1 B_2}.

Step 3 — Alice Bell-measures (S, A_1), outcome (1, 0). From the teleportation chapter (Example 1, the row for outcome (1, 0)):

|\Omega_3\rangle_{B_2} = Z|\psi\rangle = \alpha|0\rangle - \beta|1\rangle.

Alice's qubits S and A_1 are now in the specific state |10\rangle_{S A_1}.

Why B_2 ends up in Z|\psi\rangle for outcome (1, 0): the Bell-basis regrouping from the teleportation chapter shows that the |10\rangle_{S A_1} branch is paired with (\alpha|0\rangle - \beta|1\rangle)_B = Z|\psi\rangle. This is structural to the teleport protocol; the swap is already done.

Step 4 — Bob applies teleport correction for (1, 0): apply Z.

B_2 = Z \cdot Z|\psi\rangle = Z^2|\psi\rangle = |\psi\rangle = \alpha|0\rangle + \beta|1\rangle.

Result. Bob's qubit B_2 is exactly |\psi\rangle, the state Alice started with on S. The specific sequence of measurements — Mid reading (0, 0) and Alice reading (1, 0) — worked out to a deterministic recovery thanks to the two correction steps. The two measurements each had probability \tfrac{1}{4} of giving this exact outcome, so this branch is reached with probability \tfrac{1}{16} out of the 16 possible (m_1, m_2, t_1, t_2) branches.

End-to-end state evolution for (0,0), (1,0)A four-column horizontal diagram. Column 1 labelled initial shows psi on S, Phi-plus between A1 and A2, Phi-plus between B1 and B2. Arrow labelled Mid outcome 0,0 leads to column 2, which shows psi on S and Phi-plus on A1-B2. Arrow labelled Bob identity correction leads to column 3, identical. Arrow labelled Alice outcome 1,0 leads to column 4, showing Z psi on B2. Arrow labelled Bob Z correction leads to column 5, showing psi on B2.Initial|ψ⟩_S|Φ⁺⟩_{A₁A₂}|Φ⁺⟩_{B₁B₂}5 qubits,3 nodesswap (0,0)After Mid|ψ⟩_S|Φ⁺⟩_{A₁B₂}Alice-Bobnow entangledteleport (1,0)After Alice|10⟩_{SA₁}Z|ψ⟩ on B₂Pauli-distortedBob: apply ZFinal|ψ⟩on B₂
End-to-end trace for the $(m_1, m_2) = (0, 0)$, $(t_1, t_2) = (1, 0)$ branch. Each arrow is one measurement + correction pair. The final state on $B_2$ is $|\psi\rangle$ after Bob's $Z$ correction undoes the teleport distortion.

Example 2 — Resource count for a 2-hop vs 3-hop chain

Compare the resources consumed by the tiny 3-node network you just derived to a longer chain with four nodes (Alice–Mid1–Mid2–Bob) that adds one more intermediate station.

Setup. Each link generates a Bell pair. Each intermediate node performs one Bell measurement (to swap) and sends 2 classical bits. Alice performs one Bell measurement (to teleport) and sends 2 classical bits. Bob applies Pauli corrections from every classical message he receives.

3-node count (derived above). 2 Bell pairs, 4 classical bits, 2 Bell measurements, 1 source qubit delivered.

4-node count (Alice–Mid1–Mid2–Bob). To teleport |\psi\rangle from Alice to Bob:

  • 3 Bell pairs: Alice–Mid1, Mid1–Mid2, Mid2–Bob.
  • Mid1 does a Bell measurement on its two qubits (one entangled with Alice, one with Mid2). 2 cbits Mid1→Bob. After this swap, Alice and Mid2 are entangled.
  • Mid2 does a Bell measurement on its two qubits (one newly-entangled with Alice, one entangled with Bob). 2 cbits Mid2→Bob. After this swap, Alice and Bob are entangled.
  • Alice does a Bell measurement on her source qubit and her half of the Alice-Bob pair. 2 cbits Alice→Bob.
  • Bob applies three Pauli corrections.

Total: 3 Bell pairs, 6 classical bits, 3 Bell measurements, 1 source qubit delivered.

Generalising to N-node chain. For a chain of N nodes (Alice + N-2 intermediate + Bob), the scaling is:

Resource N = 3 N = 4 General N
Bell pairs 2 3 N - 1
Classical bits 4 6 2(N-1)
Bell measurements 2 3 N - 1
Qubits delivered 1 1 1

Why each added hop adds 1 Bell pair, 2 cbits, and 1 Bell measurement: each new intermediate node has two qubits (one per adjacent Bell pair) and must do exactly one Bell measurement to swap. That measurement produces 2 classical bits, which Bob needs to apply the corresponding Pauli correction. The original Alice–teleport step stays fixed; only the chain of swaps grows.

Result — linear scaling. Resources scale linearly with the number of hops. This is the best scaling you could hope for: entanglement swapping plus teleportation gives you an efficient way to move quantum state over arbitrary distances, given Bell pairs on each hop.

The catch — probabilistic success. Each Bell pair must actually be successfully generated and stored, and each Bell measurement must succeed. If each hop has success probability p, the overall protocol success probability without memories is p^{N-1} — exponential decay with N. Quantum memories rescue this: a successful Bell pair is stored while the next hop is being attempted, so you only pay a logarithmic memory-depth cost instead of exponential. This is the real algorithmic reason quantum repeaters need memories, not just links.

Linear resource scaling with network sizeA horizontal bar chart comparing three network sizes. For N equals 3, bars show 2 Bell pairs and 4 classical bits. For N equals 4, bars show 3 Bell pairs and 6 classical bits. For N equals 5, bars show 4 Bell pairs and 8 classical bits. Each N still delivers 1 qubit. A caption reads linear scaling thanks to memories and swaps.Resource scaling in an N-node chainN=3N=4N=5N=62 pairs4 cbits3 pairs6 cbits4 pairs8 cbits5 pairs10 cbitsresources
Linear growth in resources with chain length. Each additional hop costs one Bell pair, two classical bits, and one Bell measurement. The total resources grow as $O(N)$ for an $N$-node chain, and the full chain still delivers exactly one qubit.

Common confusions

Going deeper

You now understand the minimal quantum network: three nodes, two Bell pairs, four classical bits, and a composed protocol of entanglement swapping plus teleportation that delivers an unknown quantum state across multiple hops without any qubit traversing the full distance. The going-deeper sections cover quantum repeaters and the DLCZ protocol, the specific architecture that turns this primitive into a long-distance system; entanglement purification which improves noisy Bell pairs by consuming several noisy pairs to produce one high-fidelity pair; photon loss and its mitigation, the single biggest engineering challenge; the Wehner-Elkouss-Hanson quantum-internet roadmap and the six stages it lays out; India's Bengaluru–Mt. Abu satellite QKD experiment from 2022 and where it fits; and active groups at TIFR, RRI, and IIT-Madras.

Quantum repeaters — DLCZ and beyond

The DLCZ protocol (Duan, Lukin, Cirac, Zoller, 2001) [2] is the canonical quantum repeater architecture. It uses atomic-ensemble quantum memories — clouds of millions of atoms that collectively hold a single collective excitation — and photonic links. Key ideas:

Second-generation repeater proposals (2010s) add error correction at the link layer, using encoded logical qubits rather than bare physical ones. Third-generation proposals (all-photonic or memory-less) use error-correcting codes to replace memories entirely, at the cost of more complex photonic circuits.

Entanglement purification

Real Bell pairs are not perfect. Imperfect state preparation, photon loss, and gate errors produce a noisy mixed state — close to but not exactly |\Phi^+\rangle. If you tried to run teleportation or swapping on noisy pairs, the errors compound and the protocol's fidelity drops.

Entanglement purification (Bennett-DiVincenzo-Smolin-Wootters, 1996) is a protocol that takes several noisy Bell pairs and produces fewer but higher-fidelity pairs, by applying CNOT gates between pairs and measuring one of them. The measurement outcome "heralds" either a purification success (keep the pair, now higher fidelity) or failure (discard). Over many rounds, the average fidelity of the kept pairs approaches 1.

This is the key protocol that makes repeater chains fault-tolerant. Without purification, noise would compound across hops; with it, the fidelity can be kept above the required threshold at each link.

Photon loss and mitigation

Fibre loss is roughly 0.2 dB/km at the 1550 nm telecom wavelength. After 100 km, about 1% of photons survive; after 500 km, about 10^{-10}. Classical amplification cannot help: amplifying a single photon in an unknown quantum state violates no-cloning. Quantum repeaters are the only way around this.

Free-space optical links (horizontal or satellite-to-ground) have different loss profiles — atmospheric absorption at ground level, geometric beam divergence at long distances, detector efficiency. Satellite-based QKD demonstrations (China's Micius, ESA's TESAT) use free-space links to reach thousands of kilometres by going above the atmosphere.

The Wehner-Elkouss-Hanson quantum-internet roadmap

Stephanie Wehner, David Elkouss, and Ronald Hanson proposed a six-stage roadmap for quantum internet capability in 2018 [1]. The stages are:

  1. Trusted-node networks (today, BB84-style QKD).
  2. Prepare-and-measure networks (point-to-point quantum communication without memory).
  3. Entanglement generation with memory (the tiny network of this chapter).
  4. Quantum computing networks (small-scale distributed quantum computation).
  5. Few-qubit fault-tolerant networks.
  6. Full quantum internet (arbitrary distributed quantum computation, error-corrected, high-rate).

Current technology is at stage 2 (with some stage-3 lab demonstrations at Delft and Innsbruck). India's 2022 ISRO QKD demo is a stage-1 implementation (trusted-node). Stage 3 — what you learned this chapter — is an active frontier; stage 6 is a 30-40 year aspiration.

India's satellite QKD — Bengaluru and Mt. Abu

In March 2022, ISRO (with the Raman Research Institute and the Physical Research Laboratory) demonstrated free-space quantum key distribution between Bengaluru's RRI campus and Mt. Abu's IIA telescope — a ground distance of about 300 km through open atmosphere [5]. Each key bit was encoded in the polarisation of single photons from a table-top BB84 transmitter.

This is a stage-1 network: two nodes, no entanglement, no quantum memory, trusted intermediate nodes. But the infrastructure it demonstrated — single-photon sources, single-photon detectors, timing synchronisation across hundreds of kilometres, free-space transmission — is the same infrastructure that would be needed for a stage-3 network with entanglement generation.

India's National Quantum Mission (₹6003 crore over 8 years, launched 2023) explicitly funds the progression from stage 1 to stage 3, with named goals including (i) metropolitan-scale fibre-based QKD networks in Bengaluru, Mumbai, Delhi, and Hyderabad, (ii) satellite-based entanglement distribution via a dedicated quantum communication satellite, and (iii) ground-to-ground entanglement swapping demonstrations. If the mission's targets are met, India will have a tiny-to-medium quantum network by roughly 2030.

Active Indian research groups

These groups are linked through the National Quantum Mission's coordination centre and through collaborations with the international quantum-internet community (Quantum Internet Alliance in Europe, Q-NEXT in the US, China's Micius programme).

Where this leads next

References

  1. Stephanie Wehner, David Elkouss, Ronald Hanson, Quantum internet: A vision for the road ahead (2018) — arXiv:1803.00608. The six-stage roadmap for quantum-internet development and the canonical reference on what a quantum network actually is.
  2. Duan, Lukin, Cirac, Zoller, Long-distance quantum communication with atomic ensembles and linear optics (2001) — arXiv:quant-ph/0105105. The DLCZ quantum-repeater protocol.
  3. Wikipedia, Quantum internet — concise overview of architectures, stages, and experimental status.
  4. John Preskill, Lecture Notes on Quantum Computation, Ch. 4 — theory.caltech.edu/~preskill/ph229. Pedagogical treatment of teleportation, swapping, and the composition into networks.
  5. ISRO, India's Satellite Based Quantum Communications (2022 demo, RRI/PRL/IIA) — ISRO press release. The Bengaluru–Mt. Abu free-space QKD experiment. See also RRI's programme pages.
  6. Pirandola, Laurenza, Ottaviani, Banchi, Fundamental limits of repeaterless quantum communications (2017) — arXiv:1510.08863. The PLOB bound on repeaterless quantum-channel capacity, which quantifies exactly why repeaters are needed past 300 km.