Chapter 14
Quantum Networks and Contemporary Applications
Diploma in Quantum Computing
Quantum Information Theory
•
Diploma
Quantum Networks and Contemporary Applications
Introduction and context
A quantum computer is not the only important quantum information system. Many useful tasks require quantum processors, sensors, memories and communication devices to work together across distance. A quantum network is an infrastructure that distributes quantum states, entanglement or quantum-generated correlations among separated nodes. Its purposes include secure communication, distributed quantum computing, high-precision sensing and access to remote quantum processors.
Quantum networking extends classical networking but does not simply replace it. Classical channels remain necessary for coordination, authentication, error correction, routing information and measurement results. The distinctive resource is quantum information, whose fragile nature creates new engineering constraints: unknown quantum states cannot generally be copied, measurements disturb states, and losses cannot be corrected by ordinary signal amplification.
This chapter evaluates the principal network architectures, quantum repeaters and memories, network applications, hardware constraints, benchmarking and interoperability. It also considers relationships with artificial intelligence (AI), digital transformation and responsible governance.
Learning objectives
By the end of this chapter, a student should be able to:
Explain why quantum networks require different technologies from classical networks.
Compare trusted-node, entanglement-swapping and fault-tolerant network architectures.
Describe the functions and limitations of quantum repeaters and memories.
Evaluate applications in communication, sensing, distributed computing and quantum-data management.
Interpret basic performance measures such as fidelity, loss, rate and latency.
Assess hardware, interoperability, benchmarking, security and governance issues.
1. Quantum networking as a systems discipline
A quantum network contains several interacting planes:
Quantum plane: physical carriers such as photons, ions, atoms, spins or superconducting microwave states.
Classical control plane: synchronization, routing, calibration, error messages and authenticated coordination.
Entanglement-management plane: generation, storage, swapping, purification and allocation of entangled links.
Application plane: protocols such as key distribution, sensing or distributed computation.
An elementary goal is to establish an entangled pair between nodes A and B. If the shared state is close to a Bell state, the nodes can use it for teleportation, quantum key distribution or coordinated measurements. A common Bell state is
|Φ⁺⟩ = (|00⟩ + |11⟩)/√2
where |0⟩ and |1⟩ are computational-basis states. The expression assumes ideal two-level systems and a normalized state. Real channels produce mixed states because of loss, noise and imperfect operations.
The quality of a delivered state is often expressed by fidelity. For a target pure state |ψ⟩ and delivered density operator ρ, the simple fidelity is
F = ⟨ψ|ρ|ψ⟩
Here F is dimensionless and lies between 0 and 1. This form applies when the target is pure; more general mixed-state fidelity has a different definition. Fidelity alone is insufficient: a link can have high fidelity but an extremely low delivery rate.
A useful engineering description therefore includes:
Metric
Meaning
Typical concern
Fidelity
Closeness to the intended quantum state
Noise and imperfect operations
Loss
Probability that a transmitted quantum signal is not detected
Fibre attenuation, coupling and detector inefficiency
Entanglement-generation rate
Successful entangled pairs per second
Repetition rate and memory waiting time
Latency
Time from request to usable resource
Propagation, heralding and processing
Availability
Fraction of time a service meets its specification
Calibration, weather and maintenance
Security level
Resistance to specified attacks and side channels
Device assumptions and authentication
2. Why distance is difficult
In optical fibre, transmission loss is approximately exponential with distance. If α is attenuation in decibels per kilometre and L is distance in kilometres, the ideal channel transmission is
ηchannel = 10^(−αL/10)
The quantity η_channel is dimensionless. This relationship assumes constant attenuation, a single-pass channel and no additional coupling or detector losses. The total probability of a successful detection is often approximated by
ηtotal = ηsource × ηchannel × ηdetector
where η_source represents source and coupling efficiency, and η_detector is detector efficiency. This product is an engineering approximation when the loss mechanisms are independent.
For example, with α = 0.2 dB/km and L = 100 km, fibre transmission is
ηchannel = 10^(−0.2×100/10) = 10^(−2) = 0.01
Thus only 1% of photons survive in this idealized calculation, before connector, source and detector losses. Increasing transmitter power does not solve the problem in the same way as it does for classical communication, because arbitrary amplification of an unknown quantum state is prohibited by the no-cloning principle and amplification introduces noise.
Free-space links face atmospheric absorption, turbulence, pointing error, background light and weather. Satellite links can reduce terrestrial path loss over very long distances but introduce launch cost, tracking requirements, limited contact windows and space qualification challenges.
3. Architectures for quantum networks
3.1 Point-to-point networks
A direct link connects two endpoints with a quantum channel and a classical authenticated channel. It is comparatively simple and is suitable for short metropolitan distances, laboratory systems and early quantum key distribution deployments. Its performance is limited by channel loss and the quality of the endpoint devices.
3.2 Trusted-node networks
A trusted-node network divides a long route into shorter links. Intermediate nodes receive, process and retransmit information, often using classical key-relay procedures. It can be deployed with current technology, but each intermediate node must be trusted not to disclose keys or manipulate traffic. This is a governance and operational weakness, not merely a technical detail.
3.3 Entanglement-swapping networks
A repeater-based network creates entanglement over adjacent links and joins links through entanglement swapping. Suppose node B shares entanglement with A and C. A Bell-state measurement at B can project A and C into an entangled state, even though they never interacted directly. The measurement result is sent classically so that the endpoints can apply the appropriate correction or interpret their results.
Figure: A repeater chain joins short entangled links to create a longer link; classical signaling coordinates the process.
3.4 Quantum-internet architecture
A future quantum internet is likely to be heterogeneous. Local links may use matter qubits, metropolitan links may use photonic fibre, and intercontinental links may use satellite or hybrid routes. A network stack must define naming, resource reservation, timing, error reporting, security and application interfaces. Unlike classical packets, an entangled pair is a consumable resource: measuring it or using it in a protocol can destroy it.
4. Quantum repeaters
A quantum repeater is a node or protocol that extends entanglement beyond the direct transmission limit. Its principal functions are:
Generate entanglement on elementary links.
Store successful links while other links are attempted.
Perform entanglement swapping.
Purify or error-correct entanglement when required.
Report success and manage timing.
4.1 Repeater generations
A first-generation repeater uses heralded entanglement generation, quantum memories and entanglement purification. It can tolerate some physical errors but may have low rates because many attempts and long storage times are required.
A second-generation repeater uses quantum error correction during transmission or at repeater nodes, reducing the need for purification but requiring more physical qubits and high-quality gates.
A third-generation design aims for fault-tolerant, error-corrected networking. Logical qubits and encoded photonic or matter systems could make performance less dependent on raw physical noise, but the resource overhead and engineering complexity are substantial.
These categories describe design philosophies rather than universally fixed standards. A proposed system should be evaluated by rate, fidelity, resource overhead, energy use, latency and fault-tolerance assumptions.
4.2 Repeater success probability
For a simple chain of n independent elementary links, if each link succeeds with probability p in one synchronized attempt, the probability that all links succeed in that attempt is
Pall = pn
This is a deliberately simplified model: memories, asynchronous attempts, multiplexing and swapping are ignored. It illustrates why direct simultaneous success becomes impractical as n grows and why memories and scheduling are necessary.
If a memory has coherence time T_m and the protocol requires waiting time T_w, useful operation requires that decoherence during storage remain acceptably small. The exact relationship depends on the noise model. Under a simple exponential dephasing model, coherence may scale as
C(Tw) = C0 e^(−Tw/Tm)
where C_0 is initial coherence and T_m is the 1/e coherence time. This model is not a universal law; it is a convenient approximation for a particular noise process.
5. Quantum memories and hardware platforms
A quantum memory stores a quantum state or entanglement for later use. Desirable properties include long coherence time, high write and read efficiency, multimode capacity, compatibility with a communication wavelength, low noise and fast synchronization.
Important hardware approaches include:
Atomic and solid-state memories: photons are mapped to collective atomic or spin excitations. They can offer long storage but may require specialized lasers, cryogenics or frequency conversion.
Trapped ions and neutral atoms: offer excellent state control and long coherence, but photon collection and networking between separate traps are challenging.
Superconducting circuits: support fast gates and mature control electronics, usually at microwave frequencies and cryogenic temperatures. Optical interconnects require microwave-to-optical conversion.
Semiconductor spins and colour centres: may combine compactness with long-lived spin states, but fabrication variability and photon indistinguishability remain issues.
Photonic systems: have low propagation loss and room-temperature transmission, but deterministic two-qubit operations and long-lived storage are difficult.
A practical architecture commonly separates a stationary qubit, which stores information, from a flying qubit, often a photon, which carries information between nodes. Interface conversion between wavelengths or physical platforms can introduce loss and noise.
6. Applications
6.1 Quantum communication and cryptography
Quantum key distribution (QKD) allows two parties to establish a shared secret key under a security model based on quantum mechanics. In prepare-and-measure protocols, disturbance in incompatible measurement bases can reveal eavesdropping. Entanglement-based protocols use shared entanglement and testing of correlations.
QKD does not automatically provide secure communication. Authentication of the classical channel is still required, endpoints may be compromised, and implementation side channels can invalidate ideal security proofs. Security claims must therefore specify the threat model, device assumptions, finite-key analysis and operating conditions.
Quantum repeaters could eventually support long-distance entanglement-based services, but current deployed systems often use direct links or trusted nodes.
6.2 Distributed quantum computing
Several quantum processors can cooperate through teleportation of quantum states or gates. A remote gate may consume shared entanglement and require classical feed-forward. Distributed computing can increase total qubit capacity and allow specialized processors to collaborate, but communication latency and error accumulation may outweigh the benefit for small workloads.
A useful design question is whether an algorithm is communication-heavy or communication-light. Algorithms with frequent nonlocal gates are highly sensitive to network latency, fidelity and entanglement-generation rate. Compilation should therefore minimize nonlocal operations, place strongly interacting logical qubits near one another and schedule entanglement generation in advance.
6.3 Quantum sensing and metrology
Networked sensors can use entanglement or shared phase references to estimate a physical parameter. For independent probes, a common idealized uncertainty scaling is
∆θ ∝ 1/√N
where ∆θ is estimation uncertainty and N is the number of independent measurements. Entangled probes can, under suitable noise and measurement conditions, approach a stronger scaling such as 1/N in ideal models. The improvement is not guaranteed: loss, dephasing and imperfect detection can remove the advantage.
Applications include clock synchronization, gravitational or magnetic-field measurements, astronomical interferometry and navigation. In field deployments, robustness and calibration may be more valuable than the theoretical optimum.
6.4 Quantum data and cloud services
Quantum data includes states, circuits, measurement records, calibration information, error syndromes, provenance and security metadata. A quantum cloud service must expose classical APIs while protecting user programs and data. Useful capabilities include job submission, authentication, resource scheduling, noise characterization and reproducible experiment records.
Quantum data is not interchangeable with classical data. Measurement is generally irreversible, tomography can require many samples, and copying an unknown state is impossible. Consequently, systems should store preparation procedures, circuit descriptions and classical measurement data rather than assuming that arbitrary quantum states can be archived like files.
7. AI and digital transformation
AI can support quantum networks in several practical ways:
predicting channel quality and selecting routes;
detecting drift in detectors, lasers and cryogenic systems;
optimizing entanglement-generation schedules;
learning device noise models from calibration data;
identifying anomalous traffic or side-channel behavior;
compiling distributed circuits to reduce communication overhead.
These uses should not be confused with claims that AI removes quantum hardware limitations. Machine-learning models can overfit changing laboratory conditions, conceal causal failures and create difficult-to-audit decisions. A sound deployment retains physical constraints, uncertainty estimates, human oversight and independent validation.
Digital transformation requires organizational integration: network monitoring, asset management, cybersecurity, skills development, procurement standards and regulatory compliance. A quantum pilot should have a measurable business or scientific objective rather than treating quantum networking as an end in itself.
8. Benchmarking and interoperability
A credible benchmark must state the device, protocol, distance, wavelength, time window, confidence interval and treatment of failures. Important tests include:
entanglement fidelity and Bell-state measurement quality;
heralded entanglement rate, with units of pairs per second;
quantum-bit error rate where applicable;
memory lifetime and write/read efficiency;
synchronization accuracy and end-to-end latency;
detector dark-count rate and photon indistinguishability;
uptime, power and cooling requirements;
security performance under a stated threat model.
A rough end-to-end service rate can be expressed as
Rservice = Rattempt × Psuccess
where R_attempt is the number of independent attempts per second and P_success is the probability that an attempt meets the complete protocol conditions. This estimate assumes independent, identically distributed attempts and must be modified for queueing, memory saturation and correlated failures.
Interoperability requires more than compatible connectors. It includes common meanings for node identity, timing, wavelength, entanglement quality, error reporting, application programming interfaces and security credentials. Standards should distinguish physical-layer interoperability from protocol-layer interoperability. Open testbeds and conformance testing are valuable because vendor claims may otherwise use incomparable metrics.
9. Applied case: illustrative metropolitan entanglement service
Background
Consider a fictional city planning a 60 km entanglement service connecting a hospital, a university and a data centre. The proposed service is intended for secure key exchange and experimental distributed sensing.
Problem
The city must choose between a trusted-node fibre network and a small repeater demonstration. The budget cannot support a full fault-tolerant system, and the users require predictable availability rather than a purely experimental link.
Analysis
The engineering team measures fibre attenuation, connector loss, detector efficiency, synchronization stability and background counts. It separates two service classes: a near-term key-distribution service and a research service for entanglement swapping. It also identifies governance requirements: authenticated classical channels, access control, incident response and protection of hospital data.
Approach
The city deploys a limited trusted-node architecture for the operational service, with tamper monitoring, independent audits and key-management policies. A parallel laboratory testbed uses two elementary links, quantum memories and entanglement swapping. The testbed reports fidelity, successful-pair rate, memory storage time and confidence intervals rather than claiming general-purpose quantum-internet capability.
A classical orchestration layer reserves time slots, records calibration status and rejects data when quality thresholds are not met. The research testbed is connected to the operational network only through controlled interfaces.
Outcome
The operational service provides a measurable, supportable capability, while the testbed generates evidence about memory lifetime, swapping performance and interoperability. The city avoids placing critical security assumptions on an immature repeater and obtains a staged pathway toward future upgrades.
Learning points
Architecture should follow service requirements and threat models.
Trusted nodes may be acceptable for a bounded deployment but must be governed explicitly.
Demonstrations require reproducible metrics, not only successful photographs or isolated laboratory results.
Separating production and research environments limits operational risk.
10. Challenges, ethics and governance
The main technical challenges are photon loss, imperfect sources, detector noise, memory decoherence, frequency conversion, synchronization and scarce high-quality components. Network management is difficult because entanglement is probabilistic and often expires while waiting for other links.
Security challenges include compromised endpoints, denial of service, detector side channels, insecure classical authentication and misleading security claims. Post-quantum classical cryptography remains important because quantum networking does not eliminate conventional cyber threats.
Ethically, quantum networking projects should consider unequal access, public procurement transparency, environmental costs of cryogenic infrastructure and dual-use applications. Sensitive sensing networks may reveal information about individuals, buildings or infrastructure. Data minimization, access logging and clear retention policies are therefore necessary.
Regulators and managers should require:
explicit threat models and security assumptions;
independent testing and incident reporting;
lifecycle plans for obsolete hardware;
clear separation between experimental evidence and production guarantees;
interoperability and accessibility requirements in procurement;
responsible communication of performance and uncertainty.
11. Best-practice evaluation framework
When assessing a quantum-network proposal, use the following sequence:
Define the application, users, distance and acceptable latency.
Specify whether the resource is a key, a quantum state, entanglement or a sensing correlation.
State the threat model and trust assumptions.
Calculate or measure a complete end-to-end budget for loss, fidelity, rate and memory time.
Compare direct, trusted-node, repeater and satellite alternatives.
Test interoperability using documented interfaces and calibration procedures.
Report uncertainty, failed attempts and operating conditions.
Evaluate total cost, energy, maintenance, skills and regulatory obligations.
Pilot the least complex architecture that can answer the business or research question.
Define upgrade paths toward error correction without assuming that future components are available today.
Chapter Summary
Quantum networks distribute quantum states and entanglement among separated nodes while relying heavily on classical control. Loss grows rapidly with distance, and unknown quantum states cannot be copied and amplified as ordinary classical signals. Trusted-node systems offer a practical near-term option but require trust in intermediate operators. Repeater networks use memories and entanglement swapping to extend links, while fault-tolerant architectures seek greater reliability at substantial resource cost.
Quantum memories, photon sources, detectors, frequency converters and synchronization systems determine practical performance. Applications include QKD, distributed quantum computing, networked sensing and quantum-data services. Fidelity, loss, rate, latency and availability must be reported together. AI can assist scheduling, calibration and anomaly detection, but it does not remove physical or governance constraints. Interoperability, realistic benchmarking, security assumptions, ethical oversight and staged deployment are essential to responsible quantum-network development.
Key Terms
Quantum network: Infrastructure that distributes quantum states or entanglement among nodes.
Flying qubit: A mobile quantum carrier, commonly a photon, used for communication.
Stationary qubit: A physical qubit used to store and process quantum information at a node.
Quantum memory: Device that stores a quantum state or entanglement for later use.
Quantum repeater: System that extends entanglement beyond direct-transmission limits.
Entanglement swapping: Procedure that creates entanglement between particles that did not directly interact.
Trusted node: Intermediate network node assumed not to compromise protected information.
Fidelity: Quantitative closeness between an actual state and a target state.
Quantum channel: Physical medium carrying quantum states.
Classical channel: Conventional communication path carrying control and measurement information.
Heralding: Classical notification that a probabilistic quantum event succeeded.
Purification: Protocol intended to increase the quality of shared entanglement using multiple imperfect pairs.
Quantum key distribution: Method for establishing shared cryptographic keys using quantum effects.
Quantum sensing: Measurement of physical parameters using quantum states or correlations.
Quantum-bit error rate: Fraction of relevant transmitted or measured bits that disagree with expected values.
Fault tolerance: Ability to operate reliably despite physical errors through encoding and error correction.
Interoperability: Ability of independently developed components to operate through agreed interfaces.
Decoherence: Loss of quantum coherence through interaction with the environment.
Entanglement-generation rate: Number of usable entangled pairs produced per unit time.
Threat model: Explicit description of adversaries, capabilities and assumptions in a security analysis.
Review Questions
Short Answer Questions
Why can quantum signals not be amplified in the same manner as ordinary classical signals?
What is the role of a quantum memory in a repeater network?
Distinguish a trusted-node network from an entanglement-swapping network.
Define fidelity and explain why it should be reported with rate.
Name two ways AI may support quantum-network operation.
Long Answer Questions
Explain the architecture and operating principles of a quantum repeater chain, including entanglement generation, storage and swapping.
Compare direct fibre, trusted-node, satellite and repeater-based architectures for a national quantum-network strategy.
Discuss the hardware requirements and limitations of quantum memories.
Evaluate QKD, distributed quantum computing and networked sensing as contemporary applications.
Explain why benchmarking and interoperability are essential for commercial quantum-network deployment.
Analytical / Application Questions
A fibre has attenuation α = 0.2 dB/km. Using the stated channel model, calculate the ideal transmission over 80 km and discuss why the result is not the complete end-to-end success probability.
A proposed distributed algorithm requires many nonlocal gates. Identify the network metrics that should be measured before deployment and recommend two compilation or scheduling strategies.
A public agency proposes trusted nodes for critical infrastructure communication. Construct a risk assessment covering technical assumptions, governance controls, alternative architectures and a staged migration plan.
Multiple Choice Questions with Answers
Question 1
Which function is most directly associated with a quantum repeater?
A. Copying an unknown quantum state without disturbance
B. Extending entanglement using storage and entanglement swapping
C. Replacing all classical control channels
D. Increasing fibre transmission by adding optical power
Correct Answer: B. Extending entanglement using storage and entanglement swapping
Question 2
For α = 0.2 dB/km and L = 100 km, the ideal channel transmission 10^(−αL/10) is:
A. 0.001
B. 0.01
C. 0.1
D. 1.0
Correct Answer: B. 0.01
Question 3
What is the principal security weakness of a trusted-node quantum network?
A. Photons cannot travel through fibre
B. Intermediate nodes must be trusted not to compromise information
C. It cannot use classical authentication
D. It requires every user to own a satellite
Correct Answer: B. Intermediate nodes must be trusted not to compromise information
Question 4
Entanglement swapping enables two end nodes to become entangled even though:
A. They never directly interacted
B. They used no classical communication
C. Their states were copied
D. All measurements were avoided
Correct Answer: A. They never directly interacted
Question 5
Which metric measures closeness to a target quantum state?
A. Latency
B. Availability
C. Fidelity
D. Attenuation
Correct Answer: C. Fidelity
Question 6
Under the simple model R_service = R_attempt × P_success, what happens if the attempt rate is fixed but complete-protocol success probability is halved?
A. Service rate doubles
B. Service rate is unchanged
C. Service rate is halved
D. Service rate becomes zero in every case
Correct Answer: C. Service rate is halved
Question 7
Why are quantum memories important in asynchronous repeater networks?
A. They allow successful links to be stored while other links are attempted
B. They eliminate the need for detectors
C. They convert every quantum state into classical data
D. They guarantee perfect fidelity
Correct Answer: A. They allow successful links to be stored while other links are attempted
Question 8
Which statement about QKD is correct?
A. It removes the need to authenticate the classical channel
B. It guarantees secure endpoints regardless of implementation
C. Its security depends on a stated threat model and implementation assumptions
D. It prevents all denial-of-service attacks
Correct Answer: C. Its security depends on a stated threat model and implementation assumptions
Question 9
A distributed quantum-computing workload with many nonlocal gates is especially sensitive to:
A. Network latency and entanglement-generation fidelity
B. Keyboard layout
C. Classical file compression only
D. Screen resolution
Correct Answer: A. Network latency and entanglement-generation fidelity
Question 10
Which practice best supports credible benchmarking?
A. Reporting only the most successful trial
B. Using a single metric without operating conditions
C. Reporting rate, fidelity, failures and experimental conditions
D. Replacing measurements with theoretical maximums
Correct Answer: C. Reporting rate, fidelity, failures and experimental conditions