pith. sign in

arxiv: 2604.04143 · v1 · submitted 2026-04-05 · 🪐 quant-ph · cs.NI

Entanglement Rate Maximization for Dual-Connectivity Wireless Quantum Networks

Kavini Thenuwara , Shiva Kazemi Taskooh , Ekram Hossain This is my paper

Pith reviewed 2026-05-13 16:58 UTC · model grok-4.3

classification 🪐 quant-ph cs.NI
keywords entanglement rate maximizationdual-connectivityquantum networkswireless quantum networksalternating optimizationresource allocationmixed integer nonlinear programmingquantum base stations
0
0 comments X

The pith

Dual-connectivity allows quantum users to link with two base stations, increasing entanglement rates over single-connectivity setups.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This paper examines how to maximize the rate of entanglement distribution in wireless quantum networks where quantum users can connect to multiple quantum base stations. By permitting each user to associate with up to two base stations, the dual-connectivity model makes better use of limited entanglement generation resources compared to traditional single-connection approaches. The joint optimization of associations and rate allocations is cast as a mixed-integer nonlinear program that accounts for base station capacity limits and user-specific rate and fidelity demands. An alternating optimization procedure solves the problem by iteratively handling association decisions and rate assignments, delivering solutions close to optimal with far less computation time. Numerical experiments confirm substantial rate improvements from the dual-connectivity architecture.

Core claim

The paper claims that a dual-connectivity wireless quantum network, in which each quantum user can associate with up to two quantum base stations, achieves higher entanglement rates than single-connectivity schemes. The joint association and rate allocation problem is formulated as a mixed-integer nonlinear programming problem with constraints on QBS entanglement generation capacity, heterogeneous minimum rate demands, and fidelity requirements. An alternating optimization algorithm decomposes the problem into subproblems for rate allocation and association, achieving near-optimal performance with reduced complexity, as validated by simulations.

What carries the argument

The alternating optimization algorithm that alternates between solving the entanglement rate allocation subproblem and the QBS-QU association subproblem to maximize total entanglement rate under dual-connectivity constraints.

If this is right

  • Dual-connectivity increases overall entanglement distribution rates by improving resource utilization at quantum base stations.
  • The alternating optimization algorithm provides performance close to the global optimum while reducing computational complexity.
  • Practical constraints such as limited base station capacities and user fidelity requirements can be effectively managed in the optimization.
  • Simulations show consistent outperformance over single-connectivity schemes across various network sizes and demands.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Extending the model to allow connections to more than two base stations could yield additional rate gains but would require new optimization techniques.
  • Dynamic user mobility would necessitate periodic re-optimization of associations, potentially using online versions of the algorithm.
  • The framework could integrate with quantum error correction to handle fidelity degradation in multi-association scenarios.
  • Deployment in large-scale networks might benefit from decentralized implementations of the alternating optimization to reduce central coordination overhead.

Load-bearing premise

Entanglement generation capacity at each base station stays constant no matter how many users associate with it at the same time, and fidelity demands are satisfied without extra costs that grow with the number of associations.

What would settle it

An experiment or detailed simulation demonstrating that a quantum base station's effective entanglement generation rate drops or fidelity cannot be maintained when serving two users simultaneously would disprove the reported gains of dual-connectivity.

Figures

Figures reproduced from arXiv: 2604.04143 by Ekram Hossain, Kavini Thenuwara, Shiva Kazemi Taskooh.

Figure 1
Figure 1. Figure 1: A schematic view of the considered quantum network. [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 3
Figure 3. Figure 3: Total entanglement rate vs. number of QUs when [PITH_FULL_IMAGE:figures/full_fig_p005_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Total entanglement rate vs. number of QBSs when [PITH_FULL_IMAGE:figures/full_fig_p005_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Total entanglement rate vs. different Rmin j ranges when N = 10 and U = 20. In [PITH_FULL_IMAGE:figures/full_fig_p005_5.png] view at source ↗
read the original abstract

The development of quantum networks (QNs) relies on efficient mechanisms for distributing entanglement among multiple quantum users (QUs) under practical system constraints. This paper investigates the problem of entanglement rate maximization in a dual-connectivity (DC) wireless quantum network comprising multiple quantum base stations (QBSs). Under the DC architecture, each QU can associate with up to two QBSs, thereby enhancing resource utilization compared to conventional single-connectivity (SC) schemes. The joint QBS-QU association and entanglement generation rate allocation problem is formulated as a mixed-integer nonlinear programming problem that incorporates practical constraints, including limited QBS entanglement generation capacity as well as heterogeneous minimum entanglement rate demands and fidelity requirements for QUs. To efficiently solve this challenging problem, an alternating optimization (AO) algorithm is developed, which decomposes the original formulation into entanglement rate allocation and association subproblems. Simulation results demonstrate that the proposed DC architecture significantly outperforms SC schemes, while the AO algorithm achieves near-optimal performance with substantially reduced computational complexity.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The manuscript investigates entanglement rate maximization in a dual-connectivity (DC) wireless quantum network where each quantum user (QU) can associate with up to two quantum base stations (QBSs). The joint QBS-QU association and rate allocation problem is cast as a mixed-integer nonlinear program incorporating QBS capacity limits, heterogeneous minimum rate demands, and fidelity constraints. An alternating optimization (AO) algorithm decomposes the problem into rate allocation and binary association subproblems. Simulations indicate that the DC architecture yields significantly higher entanglement rates than single-connectivity (SC) baselines and that AO achieves near-optimal performance at substantially lower computational cost.

Significance. If the modeling assumptions hold, the work provides a concrete, computationally tractable method for improving entanglement distribution efficiency in multi-QBS quantum networks under realistic capacity and fidelity constraints. The AO decomposition is a standard but well-executed application of block-coordinate descent that directly addresses the MINLP hardness, and the simulation trends are consistent with the claimed DC gains. These elements could inform practical protocol design for early quantum networks.

major comments (2)
  1. [§II] §II (System Model), capacity constraint: the entanglement generation capacity at each QBS is modeled as a fixed total that is allocated across associations without any reduction or contention penalty as the number of simultaneous QUs grows. This fixed-capacity assumption is load-bearing for the headline DC-vs-SC comparison; if capacity per association declines (e.g., due to time-division, beamforming overhead, or multi-user interference), the reported rate gains and the near-optimality of AO would shrink. No sensitivity analysis or alternative capacity model is provided to bound this effect.
  2. [§V] §V (Numerical Results): the simulation figures report point estimates without error bars, without comparison to a global MINLP solver on small instances, and without sweeps over fidelity-model parameters. These omissions make it difficult to assess the statistical significance of the DC gains and the claimed near-optimality of AO.
minor comments (2)
  1. [Abstract] Abstract: quantitative performance deltas (e.g., percentage rate improvement) and key simulation parameters are omitted, reducing the ability of readers to gauge the practical impact at a glance.
  2. [§III] Notation: the fidelity constraint is stated per QU but it is unclear whether the fidelity requirement applies to each individual association or to the aggregate rate delivered to the QU; a clarifying sentence or equation would help.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the constructive and detailed review of our manuscript. We address each major comment point by point below and indicate the planned revisions to strengthen the paper.

read point-by-point responses

  1. Referee: [§II] §II (System Model), capacity constraint: the entanglement generation capacity at each QBS is modeled as a fixed total that is allocated across associations without any reduction or contention penalty as the number of simultaneous QUs grows. This fixed-capacity assumption is load-bearing for the headline DC-vs-SC comparison; if capacity per association declines (e.g., due to time-division, beamforming overhead, or multi-user interference), the reported rate gains and the near-optimality of AO would shrink. No sensitivity analysis or alternative capacity model is provided to bound this effect.

    Authors: We appreciate the referee highlighting the implications of the fixed-capacity model in Section II. Our formulation treats the QBS entanglement generation capacity as a fixed aggregate resource that is optimally allocated among associated QUs under the rate and fidelity constraints. This modeling choice focuses on the joint association and allocation problem in an idealized setting where the QBS can dedicate resources without explicit contention penalties. We acknowledge that practical factors such as overhead or interference could alter the effective capacity. In the revised manuscript, we will expand the discussion in Section II to justify the assumption and add a sensitivity analysis in Section V by introducing load-dependent capacity scaling factors to evaluate the robustness of the reported DC gains. revision: yes

  2. Referee: [§V] §V (Numerical Results): the simulation figures report point estimates without error bars, without comparison to a global MINLP solver on small instances, and without sweeps over fidelity-model parameters. These omissions make it difficult to assess the statistical significance of the DC gains and the claimed near-optimality of AO.

    Authors: We agree that these enhancements would improve the clarity and credibility of the numerical evaluation. The current results present optimized point estimates for the considered parameter settings. In the revised Section V, we will add: (i) comparisons of the AO algorithm to a global MINLP solver on small-scale instances to quantify the optimality gap; (ii) sweeps over key fidelity parameters to illustrate sensitivity of the DC gains; and (iii) error bars or standard deviations where multiple random network topologies are averaged. These updates will be incorporated into the revised manuscript. revision: yes

Circularity Check

0 steps flagged

No significant circularity in formulation or AO algorithm

full rationale

The paper formulates a standard MINLP for joint association and rate allocation under explicit modeling constraints (fixed per-QBS entanglement capacity, fidelity requirements) and solves it with an alternating optimization procedure that decomposes into subproblems via block-coordinate descent. Performance claims rest on simulation comparisons of DC versus SC architectures rather than any closed-form derivation that reduces to fitted parameters or self-referential inputs. No self-citations, uniqueness theorems, or ansatzes from prior author work are invoked as load-bearing steps in the provided text; the central modeling choice of capacity independent of association count is stated as an assumption, not derived from the results.

Axiom & Free-Parameter Ledger

2 free parameters · 2 axioms · 0 invented entities

The central claim rests on standard wireless channel models and entanglement generation statistics drawn from prior quantum network papers; no new physical axioms are introduced.

free parameters (2)
  • QBS entanglement generation capacity
    Fixed per-station limit used as input to the optimization; value chosen to reflect hardware constraints but not derived in the paper.
  • Minimum entanglement rate demands
    Heterogeneous per-user requirements treated as given inputs rather than derived.
axioms (2)
  • domain assumption Entanglement generation at each QBS is independent across associations up to the capacity limit.
    Invoked when formulating the capacity constraint in the MINLP.
  • domain assumption Fidelity can be maintained above threshold without additional rate cost that depends on number of associations.
    Used to decouple fidelity requirements from the rate allocation subproblem.

pith-pipeline@v0.9.0 · 5477 in / 1437 out tokens · 22606 ms · 2026-05-13T16:58:09.588765+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

25 extracted references · 25 canonical work pages

  1. [1]

    Quantum communication: From funda- mentals to recent trends, challenges and open problems,

    H. Dutta and A. K. Bhuyan, “Quantum communication: From funda- mentals to recent trends, challenges and open problems,”arXiv preprint arXiv:2406.04492, 2024

    work page arXiv 2024

  2. [2]

    Towards quantum-native communication systems: State-of-the-art, trends, and challenges,

    X. Zhou, A. Shen, S. Hu, W. Ni, X. Wang, and E. Hossain, “Towards quantum-native communication systems: State-of-the-art, trends, and challenges,”IEEE Communications Surveys & Tutorials, 2025

    work page 2025

  3. [3]

    Can quantum-mechanical description of physical reality be considered complete?

    A. Einstein, B. Podolsky, and N. Rosen, “Can quantum-mechanical description of physical reality be considered complete?”Physical review, vol. 47, no. 10, p. 777, 1935

    work page 1935

  4. [4]

    On global quantum communication networking,

    I. B. Djordjevic, “On global quantum communication networking,” Entropy, vol. 22, no. 8, p. 831, 2020

    work page 2020

  5. [5]

    Entanglement distribution delay optimization in quantum networks with distillation,

    M. Chehimi, K. Goodenough, W. Saad, D. Towsley, and T. X. Zhou, “Entanglement distribution delay optimization in quantum networks with distillation,”IEEE Journal on Selected Areas in Communications, 2025

    work page 2025

  6. [6]

    Entanglement rate optimization in hetero- geneous quantum communication networks,

    M. Chehimi and W. Saad, “Entanglement rate optimization in hetero- geneous quantum communication networks,” in2021 17th International Symposium on Wireless Communication Systems (ISWCS). IEEE, 2021, pp. 1–6

    work page 2021

  7. [7]

    Energy-efficient decoherence-aware entanglement gener- ation for quantum internet of things,

    F. H. Panahi, “Energy-efficient decoherence-aware entanglement gener- ation for quantum internet of things,”IEEE Internet of Things Journal, 2025

    work page 2025

  8. [8]

    Limits and security of free-space quantum communica- tions,

    S. Pirandola, “Limits and security of free-space quantum communica- tions,”Physical Review Research, vol. 3, no. 1, p. 013279, 2021

    work page 2021

  9. [9]

    Reconfigurable intelligent surface (ris)- assisted entanglement distribution in fso quantum networks,

    M. Chehimi, M. Elhattab, W. Saad, G. Vardoyan, N. K. Panigrahy, C. Assi, and D. Towsley, “Reconfigurable intelligent surface (ris)- assisted entanglement distribution in fso quantum networks,”IEEE Transactions on Wireless Communications, 2025

    work page 2025

  10. [10]

    Optimal entanglement distribution using satellite based quantum networks,

    N. K. Panigrahy, P. Dhara, D. Towsley, S. Guha, and L. Tassiu- las, “Optimal entanglement distribution using satellite based quantum networks,” inIEEE INFOCOM 2022-IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS). IEEE, 2022, pp. 1–6

    work page 2022

  11. [11]

    Optimal entanglement distribution problem in satellite-based quantum networks,

    X. Wei, J. Liu, L. Fan, Y . Guo, Z. Han, and Y . Wang, “Optimal entanglement distribution problem in satellite-based quantum networks,” IEEE Network, vol. 39, no. 1, pp. 97–103, 2024

    work page 2024

  12. [12]

    Entanglement from sky: Optimizing satellite-based entanglement distribution for quantum networks,

    X. Wei, L. Fan, Y . Guo, Z. Han, and Y . Wang, “Entanglement from sky: Optimizing satellite-based entanglement distribution for quantum networks,”IEEE/ACM Transactions on Networking, vol. 32, no. 6, pp. 5295–5309, 2024

    work page 2024

  13. [13]

    Ex- perimental free-space quantum key distribution over a turbulent high- loss channel,

    M. M. Hassan, K. Reaz, A. Green, N. Crum, and G. Siopsis, “Ex- perimental free-space quantum key distribution over a turbulent high- loss channel,” in2023 IEEE International Conference on Quantum Computing and Engineering (QCE), vol. 01, 2023, pp. 1182–1186

    work page 2023

  14. [14]

    On the availability of the decoy state bb84 qkd over a terrestrial fso link,

    A. Ntanos, D. Zavitsanos, N. K. Lyras, G. Giannoulis, and H. Avramopoulos, “On the availability of the decoy state bb84 qkd over a terrestrial fso link,” in2021 International Conference on Optical Network Design and Modeling (ONDM). IEEE, 2021, pp. 1–6

    work page 2021

  15. [15]

    Hybrid mppm-bb84 quantum key distribution over fso channel considering atmospheric turbulence and pointing errors,

    N. Alshaer, M. E. Nasr, and T. Ismail, “Hybrid mppm-bb84 quantum key distribution over fso channel considering atmospheric turbulence and pointing errors,”IEEE Photonics Journal, vol. 13, no. 6, pp. 1–9, 2021

    work page 2021

  16. [16]

    Outage capacity optimization for free-space optical links with pointing errors,

    A. A. Farid and S. Hranilovic, “Outage capacity optimization for free-space optical links with pointing errors,”Journal of Lightwave technology, vol. 25, no. 7, pp. 1702–1710, 2007

    work page 2007

  17. [17]

    Atmospheric effects on free space optics wireless communication: Applications and challenges,

    S. P. Maswikaneng, P. A. Owolawi, S. O. Ojo, and M. I. Mphahlele, “Atmospheric effects on free space optics wireless communication: Applications and challenges,” in2018 International Conference on Intelligent and Innovative Computing Applications (ICONIC), 2018, pp. 1–5

    work page 2018

  18. [18]

    Performance analysis of fso array receivers in presence of atmospheric turbulence,

    P. Kaur, V . K. Jain, and S. Kar, “Performance analysis of fso array receivers in presence of atmospheric turbulence,”IEEE Photonics Tech- nology Letters, vol. 26, no. 12, pp. 1165–1168, 2014

    work page 2014

  19. [19]

    Mathematical model for the irradiance probability density function of a laser beam propagating through turbulent media,

    M. Al-Habash, L. C. Andrews, and R. L. Phillips, “Mathematical model for the irradiance probability density function of a laser beam propagating through turbulent media,”Optical engineering, vol. 40, no. 8, pp. 1554–1562, 2001

    work page 2001

  20. [20]

    Ber performance of fso links over strong atmospheric turbulence channels with pointing errors,

    H. G. Sandalidis, T. A. Tsiftsis, G. K. Karagiannidis, and M. Uysal, “Ber performance of fso links over strong atmospheric turbulence channels with pointing errors,”IEEE Communications Letters, vol. 12, no. 1, pp. 44–46, 2008

    work page 2008

  21. [21]

    Narrowgap: Reducing bottlenecks for end-to-end entanglement distribution in quan- tum networks,

    Z. Li, J. Li, K. Xue, L. Chen, N. Yu, Q. Sun, and J. Lu, “Narrowgap: Reducing bottlenecks for end-to-end entanglement distribution in quan- tum networks,”IEEE Transactions on Networking, vol. 33, no. 1, pp. 162–177, 2024

    work page 2024

  22. [22]

    Alternating minimization for mixed linear regression,

    X. Yi, C. Caramanis, and S. Sanghavi, “Alternating minimization for mixed linear regression,” inInternational Conference on Machine Learning. PMLR, 2014, pp. 613–621

    work page 2014

  23. [23]

    Linear optimization for the perfect meal: A data-driven approach to optimising the perfect meal using gurobi,

    U. Prajapati, T. Jain, A. Machiraju, and D. Kaushik, “Linear optimization for the perfect meal: A data-driven approach to optimising the perfect meal using gurobi,”arXiv preprint arXiv:2501.04143, 2025

    work page arXiv 2025

  24. [24]

    End-to-end resource slicing for coexistence of embb and urllc services in 5g-advanced/6g networks,

    S. K. Taskou, M. Rasti, and E. Hossain, “End-to-end resource slicing for coexistence of embb and urllc services in 5g-advanced/6g networks,” IEEE Transactions on Mobile Computing, vol. 23, no. 7, pp. 8015–8032, 2024

    work page 2024

  25. [25]

    Majorization-minimization algo- rithms in signal processing, communications, and machine learning,

    Y . Sun, P. Babu, and D. P. Palomar, “Majorization-minimization algo- rithms in signal processing, communications, and machine learning,” IEEE Transactions on Signal Processing, vol. 65, no. 3, pp. 794–816, 2016

    work page 2016