A reference-only topological post-selection oracle is introduced for composable finite-key analyses governed by the Generalized Entropy Accumulation Theorem and a modular simulation framework equipped with stochastic noise injection and an explicit GEAT security ledger is developed.
Abstract
Inter-satellite links (ISLs) are the mandatory backbone for global quantum networks. While Twin-Field Quantum Key Distribution (TF-QKD) successfully surpasses linear rate-loss bounds, its extreme phase sensitivity makes it highly vulnerable to dynamic, non-IID (Independent and Identically Distributed) orbital environments. In composable finite-key analyses governed by the Generalized Entropy Accumulation Theorem (GEAT), traditional adaptive post-selection heuristics either violate strict independence conditions or incur massive second-order penalties that collapse the secret key rate. To overcome this, we introduce a reference-only topological post-selection oracle. By modeling the constellation as a Cellular Sheaf and applying Topological Data Analysis (TDA), our protocol derives a public acceptance event ($\Omega$) exclusively from classical beacon telemetry. To rigorously validate this mechanism, we develop a modular simulation framework equipped with stochastic noise injection and an explicit GEAT security ledger. Simulations across 2,000-5,000 km ISL separations compare the same Hodge-Koopman gate with TDA disabled and enabled. At 2,000 km, the median conditional candidate rates are $2.14 \times 10^{-6}$ and $5.87 \times 10^{-7}$ bit per emitted pulse, respectively; both configurations return zero at 3,000-5,000 km. TDA is active in all 4,788 evaluated windows, but does not extend the positive-candidate range in this scenario. These exported rates are conditional numerical candidates: the full protocol-level composable-security proof remains incomplete and the certified composable rate is therefore zero throughout.
The framework developed in this paper can serve as an algorithmic building block for QEC-aware routing under logical-error and logical-lifetime constraints and reduces single-flow average routing cost and multi-flow throughput-normalized congestion by approximately 28--31\% over Greedy-Assignment.
Yuanbo Zhang, Qian-Fan Wang, Yang-Min Zhao et al.· 0 citations
Bell's theorem shows that quantum theory is incompatible with local hidden-variable models. In recent years, research on nonlocality has moved beyond Bell's original scenario to quantum networks, where multiple independent sources distribute physical systems among distant parties, giving rise to correlations certified...
Twin-field (TF) quantum key distribution (QKD) offers a promising approach to long-distance QKD networks due to its superior performance over large channel losses. Due to specialized hardware requirements, nearly all long-distance TFQKD demonstrations have only two users exchanging keys, rather than a network with thre...
Reem Mandil, Yen-An Shih, A. Verma et al.· 0 citations
A unified QKD simulation platform that implements four foundational protocols BB84, B92, E91, and BBM92 within a single Python/Qiskit engine and demonstrates Bell-inequality-based intrusion detection independent of QBER is presented.
When a photon and one member of an entangled photon pair are jointly projected onto a Bell-state measurement (BSM), the quantum state of the photon can be transferred to the distant partner of the pair without physically transmitting this information carrier. In real-world deployment, however, teleportation performance...
Ri-Yao Song, Ya-Zhou Zhao, Yun-Ru Fan et al.· 2 citations
An entanglement-assisted stabilizer framework based on the extended structure of entanglement-assisted quantum error-correcting (EAQEC) codes is developed, in which the remote halves of pre-shared ebits are used directly as local phase probes while the joint state simultaneously carries an encoded logical subsystem.
Huidan Zheng, IlKwon Sohn, Jun Heo· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.