Scaling Laws of Quantum Networks: An Entanglement Transport Framework

Abstract

As quantum networks move toward multi-user architectures, a central question is how the performance of entanglement distribution scales with the numbers of network nodes N and active users M, yet existing studies use different objectives, resource assumptions, and normalizations. To account for delivery distance under multi-user demand, we define entanglement transport, which weights each delivered Bell pair meeting a fixed fidelity threshold by its endpoint separation. In a two-layer framework, (i) a resource layer measures capacity per activation slot under different aggregation regimes, and (ii) a physical layer measures service per second under implementation constraints. For matched implementations with a bounded number of activation slots per second, asymptotic-aggregation capacity sets a service ceiling, whereas achievable service must be established separately. On expanding honeycomb lattices with one random session, fixed-window entanglement-percolation constructions achieve Θ(N⁻¹) entanglement transport per activation slot below their thresholds and Θ(√N) above them. For homogeneous chains, asymptotic aggregation exceeds fixed-window capacity by a factor Θ(N²/M), and in spatial expansion a noisy physical implementation achieves Θ(M/N) service per second. These examples show that entanglement-transport scaling depends not only on connectivity but also on resource aggregation and physical implementation. The framework provides a common basis on which quantum-network scaling laws can be established.

A scalable entanglement distribution framework for hybrid quantum networks
Yaqi Zhao, Kan He, Jinchuan Hou +3
arXiv22 Sep 2026PreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
A Polynomial-Scaling PDE Solver with Entanglement-Basis Tensor Networks
Abhijatmedhi Chotrattanapituk, Michael J. Landry, Chu-Liang Fu +1
arXiv1 Oct 2026PreprintCC BY 4.0Full textNumerical analysis & scientific computing Computational physicsarXiv
Quantum Beam Splitter as a Deterministic Entanglement Source: Exact Photon-Number Statistics, Hong-Ou-Mandel Interference, and von Neumann Entropy Scaling from Balanced Inputs
Seyed Mohsen Moosavi Khansari
arXiv22 Sep 2026PreprintCC BY-NC-ND 4.0Full textQuantum physics & quantum informationarXiv
Scaling analysis of quantum geometry in second-order nonlinear transport
Zhen-Hao Gong, Zhihong Du, Hai-Peng Sun +2
中国科学通报：英文版27 Jul 2026Peer-reviewedCC BY8 citedAtomic, molecular & optical physics Condensed matterOpenAlex
Quantum transport and unified scaling law in graphene with polyadic Cantor electrostatic barriers
Sudhanshu Shekhar, Mohammad Umar, Bhabani Prasad Mandal
arXiv28 Aug 2026PreprintarXiv licenceFull textMathematical physics Condensed matterarXiv

Cite

BibTeX RIS

BibTeX

@misc{kim2026scaling,
  title = {{Scaling Laws of Quantum Networks: An Entanglement Transport Framework}},
  author = {Jaemin Kim and Petar Popovski},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.39690},
  eprint = {2609.39690},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.39690},
  note = {CC BY 4.0},
}

RIS

TY  - UNPB
TI  - Scaling Laws of Quantum Networks: An Entanglement Transport Framework
AU  - Jaemin Kim
AU  - Petar Popovski
PY  - 2026
DA  - 2026/09/30
PB  - arXiv
DO  - 10.48550/arxiv.2609.39690
UR  - https://arxiv.org/abs/2609.39690
AB  - As quantum networks move toward multi-user architectures, a central question is how the performance of entanglement distribution scales with the numbers of network nodes N and active users M, yet existing studies use different objectives, resource assumptions, and normalizations. To account for delivery distance under multi-user demand, we define entanglement transport, which weights each delivered Bell pair meeting a fixed fidelity threshold by its endpoint separation. In a two-layer framework, (i) a resource layer measures capacity per activation slot under different aggregation regimes, and (ii) a physical layer measures service per second under implementation constraints. For matched implementations with a bounded number of activation slots per second, asymptotic-aggregation capacity sets a service ceiling, whereas achievable service must be established separately. On expanding honeycomb lattices with one random session, fixed-window entanglement-percolation constructions achieve Θ(N^−1) entanglement transport per activation slot below their thresholds and Θ(√N) above them. For homogeneous chains, asymptotic aggregation exceeds fixed-window capacity by a factor Θ(N^2/M), and in spatial expansion a noisy physical implementation achieves Θ(M/N) service per second. These examples show that entanglement-transport scaling depends not only on connectivity but also on resource aggregation and physical implementation. The framework provides a common basis on which quantum-network scaling laws can be established.
ER  -

Abstract

Related

Cite