Quantum Networks and Communication Research
Quantum networks distribute quantum states or entanglement between separated systems. Research becomes focused when the intended service is specified: a secret key, an entangled memory pair, a remote gate or a distributed probe. These services require different trust assumptions, fidelity, timing and storage; distance alone is an inadequate measure of progress.
Required background. Quantum network architectures supplies the communication and resource language.
Choose the missing service capability
Section titled “Choose the missing service capability”| Bottleneck | Research route | Useful first deliverable |
|---|---|---|
| Loss and stochastic arrival | Entanglement distribution, repeaters | Accepted-pair rate at a fixed fidelity and memory budget |
| Storage and interfaces | Memories, transduction | Measured channel or protocol-level loss/noise budget |
| Long-distance coverage | Satellite links | Weather- and orbit-aware delivered service |
| Remote computation | Modular computing | Gate schedule including link waits and decoherence |
| Networked measurement | Distributed sensing | Entanglement delivery matched to interrogation timing |
| Dependable and secure operation | Protocols and verification, device independence | Explicit correctness or security contract |
The quantum internet roadmap explains how these capabilities fit together without assuming one universal deployment sequence.
Evidence and open integration
Section titled “Evidence and open integration”Established: remote entanglement and small network operations have been demonstrated in specific systems. Knaut and colleagues’ 2024 memory-node experiment and Main and colleagues’ 2025 distributed-computing experiment illustrate different services. Active: extending those services to heterogeneous, multi-user networks with reliable availability and resource accounting. Conjectural: that every application benefits from a general-purpose quantum internet. Memory-node experiment, distributed computation.
A trusted relay network, an untrusted measurement station and an entanglement-swapping repeater have different capabilities. Calling all of them a quantum network should never erase that distinction.
A first project across hardware and protocols
Section titled “A first project across hardware and protocols”Simulate two elementary links feeding one swapping node. Specify heralding probability, trial duration, memory channel, swap success and application fidelity threshold. Compare immediate swapping with an age cutoff for stored pairs. Deliver accepted rate, fidelity distribution and waiting-time tails, including failed attempts. A laptop discrete-event simulation is enough.
The baseline is the analytically solvable perfect-memory limit. Failure tests use asymmetric links, correlated outages and finite classical signaling time. The project becomes research when a scheduling policy is evaluated against a measured device model or a rigorously bounded application objective. An improvement in raw pair rate that reduces useful accepted pairs is a failed hypothesis.
Entry points and scope
Section titled “Entry points and scope”Azuma and colleagues’ review provides architecture choices and rate benchmarks. Literature checked on 11 October 2026; the selected overview and examples span 2023–2025 rather than a complete contemporary network inventory.
References
Section titled “References”- K. Azuma et al., “Quantum repeaters: From quantum networks to the quantum internet,” Reviews of Modern Physics 95, 045006 (2023). Article.
- C. M. Knaut et al., “Entanglement of nanophotonic quantum memory nodes in a telecom network,” Nature 629, 573–578 (2024). Article.
- D. Main et al., “Distributed quantum computing across an optical network link,” Nature 638, 383–388 (2025). Article.