Quantum Internet Frontier

A quantum internet is a network offering explicitly defined quantum communication services between nodes. A useful service might deliver entangled states, support authenticated secret-key generation, or connect quantum processors. These capabilities have different hardware and trust requirements; a long-distance link alone does not establish all of them.

Helpful background. Quantum repeaters develops repeater protocols; quantum network architectures explains their organization. Here we use loss limits and waiting-time models to ask what a network can reliably deliver.

Loss sets a resource-normalized baseline

For a pure-loss optical channel with transmissivity $0\le\eta<1$ and vacuum environment, the asymptotic secret-key capacity per channel use, with unlimited two-way classical communication, no imposed input-energy bound, no pre-shared entanglement, and no intermediate repeaters, is

K(\eta)=-\log_2(1-\eta).

At high loss, $K(\eta)\approx\eta/\ln2$ . Pirandola and collaborators established this fundamental repeaterless benchmark. It is a rate per use, not a rate per second, and does not include a practical source or detector model.

For an illustrative fiber attenuation of $0.2$ dB/km over $100$ km,

\eta=10^{-0.2(100)/10}=0.01, \qquad K\approx0.0145\ \text{bits/use}.

A clock of $10^8$ uses per second then gives an ideal upper bound around $1.45$ Mbit/s under the assumed channel model. Real inefficiency can reduce the rate greatly. Additional modes increase the number of uses; they do not violate a bound normalized to each mode.

A repeater comparison must therefore account for all modes, intermediate resources, endpoint assumptions, and security definition. Beating a weak direct-transmission implementation is useful engineering evidence but not automatically a demonstration of exceeding the repeaterless capacity.

Shorter links trade loss for intermediate resources

Splitting a distance into shorter segments improves each segment’s transmission probability. Entanglement swapping, purification, or encoded transmission then consumes memory, local operations, classical messages, and possibly many simultaneous modes.

In a simple two-segment model, each segment attempts entanglement in parallel with independent success probability $p$ per window. Perfect memories hold the first success. If $G_1,G_2$ are independent geometric waiting times,

\begin{aligned} \mathbb E[\max(G_1,G_2)] &=\mathbb E[G_1]+\mathbb E[G_2] -\mathbb E[\min(G_1,G_2)]\\ &=\frac2p-\frac{1}{2p-p^2}. \end{aligned}

The minimum is geometric with success probability $1-(1-p)^2=2p-p^2$ , because a window ends that wait when at least one link succeeds. For small $p$ , the maximum has mean approximately $3/(2p)$ windows. A swap succeeding with fixed probability $s$ , independent of the preparation history, multiplies mean time by $1/s$ if failure destroys both pairs and the complete attempt restarts. This excludes swap duration and signaling delays. Imperfect memories, unequal links, purification, and nested scheduling change the estimate.

Without storage, suppose both links must instead succeed in the same window. Their joint probability is $p^2$ , so the mean wait becomes $1/p^2$ . At $p=0.1$ , perfect storage reduces the mean from 100 windows to about 14.7 before swapping. This is why memory can change the loss scaling, rather than merely add a small convenience. It helps only while stored states remain good enough; quantum memories explains the resulting noise constraints.

Trust and authentication remain part of the service

A trusted-relay key network and an end-to-end entanglement network are different resources. In the former, intermediate nodes may know the key; in the latter, a suitable protocol can remove that particular trust requirement. Device-independent security adds further measurement and statistical requirements.

Quantum communication does not eliminate classical authentication. Without authenticated messages, an adversary can impersonate endpoints during a key-distribution protocol. Nor does heralded entanglement imply that all network traffic, routing metadata, or endpoint devices are secure. Quantum key distribution explains the security definitions.

A useful entanglement service specifies target endpoints, state or encoded subspace, fidelity or an operational error measure, heralding behavior, delivery rate, age at consumption, and failure reporting. A best-effort Bell-pair service can be valuable without satisfying the deadlines of distributed fault-tolerant computation.

Networking adds competition and state aging

When multiple applications share memories and switches, maximizing raw pair production need not maximize completed tasks. One application may need pairs simultaneously; another can consume them immediately. Long routes occupy memories while waiting for classical signals, so a scheduler must choose which requests to admit and when to discard stale pairs.

Wehner, Elkouss, and Hanson organize quantum-network development by capabilities rather than geographic reach alone. That distinction remains useful: repeatable entanglement delivery and reliable programmable operations demonstrate more than an isolated herald, while demanding different components.

The loss bounds and resource models above are established within their assumptions. Which network architecture delivers a given service most effectively remains an active engineering question. The quantum-internet research guide discusses capability milestones, selected demonstrations and open problems.

Exercises

For $p=0.1$ , compute the mean two-link waiting time in the perfect-memory model, then include swap success probability $s=0.5$ .

Solution

The link preparation time is $20-1/0.19\approx14.7368$ windows. Restarting after failed swaps gives approximately $29.4737$ windows per successful end-to-end pair. This neglects swap duration and classical communication latency. Under the no-storage, same-window rule the corresponding mean is $1/(p^2s)=200$ windows. Both figures assume that an accepted swap produces a pair of sufficient quality; the herald alone does not establish fidelity.

A network reports doubling bits per second by using twice as many independent optical modes. Has it demonstrated a larger key capacity per mode?