arXiv:2609.39690
Scaling Laws of Quantum Networks: An Entanglement Transport Framework
Jaemin Kim, Petar Popovski
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^{-1})$ entanglement transport per activation slot below their thresholds and $Θ(\sqrt 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.
AI Summary
The paper asks how distance-sensitive entanglement delivery scales with network size $N$ and active-user population $M$, while distinguishing resource aggregation from physical timing. It defines “entanglement transport” as endpoint distance summed over delivered two-qubit pairs meeting a fixed Bell-state fidelity threshold, and separates capacity per activation slot from service per second. Under matched resource and physical models with at most $r$ activation slots per second, service is bounded by $rC_{\mathrm{ET}}^{(\infty)}$. For expanding honeycomb lattices with one uniformly random session, four specified fixed-window entanglement-percolation constructions achieve $\Theta(N^{-1})$ transport below their respective thresholds and $\Theta(\sqrt N)$ above them. These follow from subcritical connectivity decay, supercritical long-distance connectivity, and endpoint resource bounds. A specified all-shortest-path concurrence-percolation realization instead requires $\exp[\Theta(\sqrt N)]$ slots, suppressing its normalized transport; this is not a bound on alternative preparations. For homogeneous chains under random exclusive pairing, fixed-window capacity is $\Theta(Ma_N/N)$, versus $\Theta(wpa_NN)$ with asymptotic aggregation, a $\Theta(N^2/M)$ separation at fixed multiplicity $w$ and success probability $p$. Proofs combine interval-flow integrality, constructive routing, and fidelity-calibrated squashed-entanglement cut bounds. Specified noisy implementations achieve $\Theta(M/N)$ service in expansion; simulations give hop ceilings of 9 without purification and 12 with one-round DEJMPS. Ideal retention achieves $\Theta(N/\log N)$. The physical benchmarks neglect path-wide signaling delays, which invalidate the ideal-retention timing asymptotics at sufficiently large distances. Results concern the stated demand, supply, geometry, and protocols; critical percolation points and general-topology capacities remain unresolved.
manuscript organization and drafting, preparation of \LaTeX{} and TikZ source, and the development, execution, and verification of the numerical calculations underlying the reproducibility package.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 36 pages, 3 figures