Source-linked AI summary
Implementation of a 46-node quantum metropolitan area network
Teng-Yun Chen, Xiao Jiang, Shi-Biao Tang, Lei Zhou, Xiao Yuan, Hongyi Zhou, Jian Wang, Yang Liu, Luo-Kan Chen, Wei-Yue Liu, Hong-Fei Zhang, Ke Cui, Hao Liang, Xiao-Gang Li, Yingqiu Mao, Liu-Jun Wang, Si-Bo Feng, Qing Chen, Qiang Zhang, Li Li, Nai-Le Liu, Cheng-Zhi Peng, Xiongfeng Ma, Yong Zhao, Jian-Wei Pan
TL;DR
Practical large QKD networks must address topology, scalability, key management, applications, and robustness beyond demonstrations with fewer than ten nodes. The authors field-operated a 46-node metropolitan network with varied topologies and systematic key management; over 31 months, representative links had average key rates from 6 to 60.5 kbps, and the network supported encrypted communications.
Problem
Earlier QKD network demonstrations had fewer than ten nodes, while practical large networks must address topology, scalability, key management, applications, and robustness.
Source: INTRODUCTION · pp. 1–2Method
The authors built and operated a 46-node metropolitan QKD network with varied topologies, standard equipment, systematic key management, and application modules.
Source: INTRODUCTION · p. 2, Network topology · p. 3Results
Over 31 months, representative links had average key rates ranging from 6 to 60.5 kbps, and 22 users made calls simultaneously for six minutes.
Source: Network robustness · p. 5, Application · p. 5Takeaways & Limitations
The network can be scaled by adding users and relays and connected to the Shanghai–Beijing backbone to become a national network.
Source: DISCUSSION · p. 6
Abstract
from arXiv · showhide
Quantum key distribution (QKD) enables secure key exchanges between two remote users. The ultimate goal of secure communication is to establish a global quantum network. The existing field tests suggest that quantum networks are feasible. To achieve a practical quantum network, we need to overcome several challenges, including realising versatile topologies for large scales, simple network maintenance, extendable configuration, and robustness to node failures. To this end, we present a field operation of a quantum metropolitan-area network with 46 nodes and show that all these challenges can be overcome with cutting-edge quantum technologies. In particular, we realise different topological structures and continuously run the network for 31 months, by employing standard equipment for network maintenance with an extendable configuration. We realise QKD pairing and key management with a sophisticated key control center. In this implementation, the final keys have been used for secure communication such as real-time voice telephone, text messaging, and file transmission with one-time pad encryption, which can support 11 pairs of users to make audio calls simultaneously. Combined with inter-city quantum backbone and ground-satellite links, our metropolitan implementation paves the way toward a global quantum network.
INTRODUCTION
The introduction frames large practical QKD networks as a step toward global secure communication, noting that earlier network demonstrations had fewer than ten nodes and that deployment requires more than adding nodes. The Hefei network addresses these challenges through multiple topologies, scalable equipment, key management, practical applications, and node-failure handling.
INTRODUCTION
- Earlier QKD networks had fewer than ten nodes, while practical deployment also requires attention to topology, scalability, key management, applications, and robustness.The introduction places these challenges within the broader goal of global QKD communication.Source: INTRODUCTION · pp. 1–2
- The 46-node Hefei network connects 40 user nodes, three trusted relays, and three optical switches across the city.It was designed to address topology, scalability, key management, applications, and node-failure challenges.Source: INTRODUCTION · p. 2
Network topology
- In the network diagram, switch-connected users have transmitters and receivers, whereas trusted-relay-connected users have transmitters only.Three sub-networks are directly connected, with users attached through optical switches or trusted relays.Source: Figure 1 · p. 2
- Full connectivity avoids relays and single points of failure but has quadratically increasing link costs; star networks use linearly many links but are vulnerable to central-switch failure.Trusted-relay networks can extend distance, but users must trust the relay.Source: Network topology · p. 3
- The network combines full connections among three sub-networks with star-like local access, using either trusted nodes or optical switches at star centers.The full connections provide robustness between important users, while star-like connections are used for more efficient local access.Source: Network topology · p. 3
- The optical switches redistribute quantum signals, while trusted nodes assign classical keys; the 16-port switch can support eight simultaneous user pairs.Switch losses were below 1.2 dB, compared with 50 dB channel isolation.Source: Network topology · p. 3
Standard QKD equipments
The network uses standard QKD equipment with different user configurations for switch and trusted-relay connections. Its key-management system schedules pairings according to stored keys and provides an onboarding process for new users.
Standard QKD equipments
- Switch-connected users have both quantum transmitters and receivers, while trusted-relay-connected users have transmitters only, reducing the need for more expensive receivers at every node.The network uses polarization-encoding BB84 with a vacuum-plus-weak-decoy-state method.Source: Standard QKD equipments · p. 3
- Standard devices use four 1550 nm lasers for BB84 polarization states and produce signal, decoy, and vacuum pulses; calibration takes no more than five minutes.The calibration includes timing and polarization feedback; standardization lets device count scale linearly with user nodes.Source: Standard QKD equipments · p. 4
- The QKD setup uses signal and decoy mean photon numbers of 0.6 and 0.2 per pulse, respectively, in a 6:1:1 signal-decoy-vacuum ratio.The setup uses four-channel InGaAs single-photon detection with 10% detection efficiency and a 500 ps effective gate width.Source: Figure 2 · p. 4
Key management
- The switching strategy prioritizes users with the least stored key material, and the Roll-Call-Polling protocol determines the pairing queue.The 16-port switch supports 120 possible user-pairing schemes; switching intervals can be configured from 10 to 60 minutes.Source: Key management · p. 4
- A new device authenticates with 32 kbit of initial keys using HMAC based on SM4, then joins the key-generation queue within two minutes of power-on.The passage notes that this authentication does not provide information-theoretic security.Source: Key management · pp. 4–5
Security analysis
The security analysis gives the decoy-state BB84 secret-key-rate expression and describes how finite-size statistical fluctuations and failure probabilities are handled.
Security analysis
- The BB84 secret-key-rate expression combines the signal-state error-correction cost with a single-photon contribution estimated using decoy states.The passage defines the signal-state gain and QBER, and identifies single-photon yield and phase error as quantities estimated by the decoy-state method.Source: Security analysis · p. 5
- Finite-size statistical fluctuations primarily affect phase-error estimation, with the Z-basis single-photon phase error bounded using the X-basis single-photon bit error rate and an optimized deviation.The analysis uses the numbers of X- and Z-basis bits in the deviation calculation.Source: Security analysis · p. 5
- Authentication, error verification, and privacy amplification also have failure probabilities that depend on secure-key consumption and add under composable security.The analysis describes these alongside finite-size parameter-estimation effects.Source: Security analysis · p. 5
Application
The network used generated keys for one-time-pad encrypted voice, messaging, and file transmission. Tests also measured encryption performance and simultaneous calling capacity.
Application
- One-time-pad encryption was used for voice telephone, instant messaging, and digital-file transmission, with 10 Gbits of information encrypted.The encryption speed was 800 Mbps and total encryption delay was less than 50 µs.Source: Application · p. 5
- Real-time voice telephone ran at 2.4 kbps, while file transmission ran at 320 kbps.Source: Application · p. 5
- Twenty-two users simultaneously made calls in the quantum network for six minutes.The network capacity test lasted 50 minutes.Source: Application · p. 5
Network robustness
The network operated continuously for 31 months, with reported average key rates from 6 to 60.5 kbps. Its results and discussion describe simultaneous QKD calls and a path toward scaling and connecting metropolitan networks.
Network robustness
- Twenty-two users simultaneously made QKD calls; green areas mark the duration of each call.Source: Figure 3 · p. 6
- For representative links, key rates are plotted over time for relay-to-relay and relay-to-user connections, using monthly averages from measurements every 30 seconds.Eleven user nodes ran continuously during the robustness test.Source: Figure 4 · p. 6
- Average key rates ranged from 6 to 60.5 kbps during 31 months of continuous operation, with polarization-driven fluctuations followed by calibration.Table II lists average inter-subnetwork key rates and within-subnetwork ranges.Source: Network robustness · p. 5, Table II · p. 6
DISCUSSION
- The Hefei network uses standard commercial QKD products and systematic key management, and the authors describe scaling it with added users and relays and connecting it to backbone and satellite-linked networks.Source: DISCUSSION · p. 6
1. Details of the experimental parameters
The experimental parameters cover key reconciliation and privacy amplification as well as monitored QKD operation.
- FPGA-based Winnow reconciliation has efficiency 1.3 ∼1.5 and takes less than 50 ms for a 256 kbits sifted key when the bit error rate is below 4%.A CRC determines whether the reconciled key string is retained or abandoned.Source: §1 · p. 7
- Privacy amplification estimates the secure factor with the decoy method and uses blockwise FPGA Toeplitz multiplication, with finite-key effects included in parameter estimation.Source: §1 · p. 7
- At 20 km, QBER is generally below 1% and bidirectional key rate reaches 30 kbps; the robustness test uses a 40 MHz clock.Total loss includes fiber loss proportional to one fourth of fiber length in kilometers, detector loss of about 3 dB, and detector efficiency of about 10%.Source: §1 · p. 7
2. Details of the calibration
Calibration comprises detector-gate, polarization-feedback, and synchronization steps, with the full process taking no more than five minutes.
- Detector-gate calibration scans detector positions to maximize visibility, with a 15% minimum and abortion after three consecutive below-threshold readings for any detector.Alice sends 40 MHz optical pulses during this step.Source: §2 · p. 7
- Polarization feedback requires at least 20 dB visibility and checks H, V, +, and − pulses, aborting after three failed trials.After H passes, H is switched off and V is checked; + and − are then calibrated.Source: §2 · p. 7
- Synchronization adjusts Alice’s lasers to 100 kHz to match the synchronization pulses and aborts if any laser fails three consecutive times.Source: §2 · p. 7
- Total calibration time stays within 5 minutes; stronger pulses improve calibration, so laser power rises with transmission distance.Source: §2 · p. 7
- Fiber polarization drift is the network’s main noise source; TR2–TR3 calibration occurred 15 times in 24 hours, with daytime calibration every 56 minutes.Overnight, polarization was stable and the system ran steadily for almost 11 hours.Source: §2 · p. 8
3. Details of the key management
The control center authenticates key-management devices and configures their neighboring connections, while separate measures govern authentication keys and secure-key storage.
- The control center authenticates devices when they log in, then controls authenticated devices and provides neighboring-device connection configurations for QKD.Source: §3 · p. 8
- Authentication keys are automatically replenished after use, but lost keys require manual reset; these keys are stored separately and reserved for identity authentication.Source: §3 · p. 8
- New secure keys are encrypted with previously generated keys before storage in secure modules, which use FPGA-based isolation and anti-detection measures.The system also restricts electromagnetic radiation.Source: §3 · p. 8
4. Details of the key rates
The section reports key rates for the Hefei network and profiles one typical link over a week.
4. Details of the key rates
- Detailed key rates are reported in Supplementary Tables IV–VIII, with a typical link profiled over a week in Supplementary Figure 5.The section points to the supplementary tables for network-wide link rates and to the figure for the typical-link time series.Source: §4 · p. 8
Supplementary Note 2: Key Rate Calculation
The calculation estimates finite-size BB84 key rates from experimental data, accounting for decoy-state bounds and statistical fluctuations. It combines key lengths from both bases and applies the resulting rate calculation to a representative link.
Supplementary Note 2: Key Rate Calculation
- Vacuum and weak-decoy states bound the single-photon yield Y1 from below and the single-photon error rate e1 from above.Signal and weak-decoy intensities are μ and ν; their gains are Qμ and Qν, while the dark-count yield is Y0 and its error rate is e0 = 0.5.Source: Supplementary Note 2: Key Rate… · p. 8
- Finite-size phase-error bounds use random sampling to account for deviations between phase- and bit-error rates across bases.The calculation uses the single-photon bit-error bound and applies statistical-fluctuation substitutions to the key-rate quantities.Source: Supplementary Note 2: Key Rate… · pp. 8–9
- The finite-key calculation uses sifted-key counts nx and nz from the X and Z bases, respectively, to set qx = nx/(nx + nz).The BB84 expression is recalled as the starting key-rate formula.Source: Supplementary Note 2: Key Rate… · pp. 8–9
- Finite-size estimation uses Gaussian fluctuations set to 10 standard deviations, with bounds applied to observed gains, error rates, and detection counts.The bounds also cover successful single-photon detections, which cannot be directly observed; signal and weak-decoy probabilities are qs = 0.75 and qd = 0.125.Source: Supplementary Note 2: Key Rate… · p. 9
- The total finite-key length is Ktot = Kx + Kz, and the key rate is r0Ktot/N, where r0 is the source repetition rate.The post-processing key consumption Δ is of order 10^2 bits when each step has failure probability 10^-10.Source: Supplementary Note 2: Key Rate… · p. 9
- The example calculates a finite-size key rate for link UB-23 to TR-3 using experimental parameters listed in Supplementary Table IX.The resulting rate is reported in Supplementary Table IV; the authors plan to update the calculation module with the Chernoff-Hoeffding method.Source: Supplementary Note 2: Key Rate… · pp. 8–9