Jul 2026· Annual International Computer Software and Applications Conference· pp. 1252-1261· 0 citations· 27 references
Abstract
Ensuring the reliability of quantum networks requires the accurate evaluation of fidelity-a metric representing link quality-and the selection of high-fidelity links. However, since fidelity estimation consumes a large number of measurements, an efficient method for identifying high-quality communication links with limited resources is desirable. Existing studies have primarily focused on identifying high-fidelity links between a pair of nodes, leaving adaptive resource allocation insufficiently explored in multi-destination environments where destinations differ in network importance (e.g., communication demand or the quantum memory capacity of nodes). In this study, we propose DaTopLinks (Demand-aware Top- $K$ HighFidelity Links), a method for efficiently identifying the top- $K$ destinations and their best link for each selected destination according to a utility function that combines destination importance and link fidelity. The algorithm introduces a dual-criterion link elimination mechanism that simultaneously performs intradestination link elimination and top- $K$ destination elimination. It also incorporates an early confirmation mechanism that allows early termination of measurements for destinations once their inclusion in the top- $K$ set and the identification of their best link are statistically guaranteed. In our theoretical analysis, we derive an upper bound on the sample complexity based on an effective gap that captures both inter-destination utility differences and intra-destination fidelity differences. Simulation results demonstrate that the proposed method functions effectively under depolarizing, dephasing, and bit-flip noise models.
In this study, for the first time, a novel routing and purification approach for quantum networks is presented, using the end-to-end (E2E) relative entropy of coherence (REC) together with E2E fidelity to determine the purification level and the feasibility of candidate paths.
H. S. D. Tunç, Joy Halder, Azita Hajizade et al.· Scientific Reports· 0 citations
As practical quantum networks approach large-scale deployment, the need for efficient user-to-user frequency allocation is increasing, yet current approaches only provide partial solutions to the routing and spectrum allocation problem for an arbitrary quantum network. We address this challenge for repeater-less flex-grid quantum networks based on hyperentangled photons using an efficient three-stage pipeline combining leading tools in classical networking with recent advances in numerical optimization. First, double instantiations of Yen's algorithm obtain low-loss route candidates between each pair of users and the entanglement sources. Second, the advanced process optimizer (APOPT) obtains frequency channel allocations that maximize distribution rates under fidelity constraints. Finally, the constraint programming solver using satisfiability methods (CP-SAT) assigns specific frequency bins to each link, ensuring that there is no contention between frequencies from different sources. We numerically demonstrate this approach on a representative ring network and a Manhattan incumbent local exchange carrier topology, realizing significant improvements over prior genetic algorithm approaches in speed, accuracy, and scalability. Overall, this pipeline provides an efficient heuristic workflow for optimizing broadband entanglement distribution, applicable to arbitrarily connected quantum networks integrated within the existing lightwave infrastructure.
Zachary Goisman, M. L. Stevens, Maxwell Goisman et al.· 0 citations
This work constructs a link control protocol that dynamically adapts source pump power and polarization compensation to maximize entanglement distribution rate subject to a minimum fidelity constraint and shows that software-based physical layer control can provide a practical mechanism for improving near-term quantum link performance without requiring additional quantum hardware.
C. Clayton, C. Nunn, Quinn Carmack et al.· 0 citations
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, Qianfan Wang, Yangmin Zhao et al.· 0 citations
We show that entanglement-generation speed across a fixed network interface is governed by two distinct resources: the entangling capacity of the interface itself and the ability of the surrounding architecture to replenish it with fresh degrees of freedom. For fermionic Gaussian dynamics, we derive the coefficient-sharp bound $\sum_k|\dot\theta_k|\leq\frac12\|K_{AB}\|_*$ on the collective speed of the canonical entanglement angles. Explicit Ising-chain rematching trajectories saturate this bound, thereby certifying exact minimum interaction times under the stated control model. Beyond the Gaussian setting, exhaustive optimization of the complete $N=8$ tree--tree family shows that, at fixed interface capacity, first-layer entanglement, connectedness, and edge budget, the saturation depth is exactly classified by rooted architecture. With higher-resolution $x$-only control, variational entanglement-enhancing-field (VEEF) optimization reaches the numerically resolved fast-$X$ optimum in a two-channel benchmark. Across all 21 symmetry-reduced rooted orbits, a pre-specified two-time VEEF growth diagnostic recovers the complete replenishment partition directly from optimized dynamics. Interface capacity therefore sets how much entangling flux is available, whereas architecture determines whether fresh degrees of freedom can continually replenish the interface and sustain repeated use of that capacity.
This work argues that the absence of utility-driven network formation is not solely a consequence of immature applications, but also of insufficient abstraction, and that quantum interconnects constitute the enabling technology required to decouple physical implementations from network functionalities.
Gustavo C. Amaral· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
