Curator's Take
AI Commentary
This article demonstrates the first operational, entanglement‑based quantum‑key‑distribution network that spans four cities without any trusted repeaters, showing that a fully meshed topology can be built from passive wavelength routing using a new matrix formalism. By delivering keys in real time through the ETSI GS QKD 014 stack and benchmarking against finite‑key security bounds, the work moves beyond laboratory coincidence counts to a practical, standards‑compatible service with measurable secret‑bit rates of up to 13.5 bits s⁻¹ over 109 km. The authors also identify that swapping the current detect‑and‑discard approach for full error correction could boost finite‑key rates by more than a factor of four, pointing toward scalable, high‑performance quantum cryptography for national fiber infrastructures.
— Mark Eatherly
Summary
Quantum key distribution (QKD) generates shared secret keys whose security rests on the laws of physics rather than on computational assumptions. We report the entanglement-based segment of the Slovak national quantum communication infrastructure, connecting four cities in western Slovakia over deployed telecommunication fiber. Polarization-entangled photons generated at a central node are passively routed by wavelength to form a trusted-node-free, fully meshed sub-network of three cities, with the fourth connected through the central node and all links operated simultaneously. We also introduce a matrix formalism for passive wavelength routing that enables the algorithmic construction of uniquely and fully connected topologies. Unlike most previous demonstrations, which estimate key rates from raw coincidences, all rates reported here are obtained after the complete post-processing chain, with keys delivered in real time via ETSI GS QKD 014. With partial non-local chromatic dispersion compensation, we obtain 13.5 bit/s over 109 km, and 4.3 bit/s over 32.1 dB of accumulated loss between two cities without a direct fiber link. Benchmarking against finite-key security bounds shows that the implemented heuristic privacy amplification can exceed the finite-key bound, and that replacing detect-and-discard with error correction would increase the finite-key rate by a factor of 4.1-6.6, and yield a positive finite-key rate on the 142.9 km link where the implemented scheme yields none.