Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2609.39690

Scaling Laws of Quantum Networks: An Entanglement Transport Framework

Jaemin Kim, Petar Popovski

quant-phSubmitted Sep 30, 2026• Announced Oct 1, 2026• 0 citations
arXivHTMLPDF

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.

Likely largely AI-generatedAI use disclosedIncrementalStrong assumptionsUnclear novelty
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

Related papers

Quantum Network Science: Linking Graph Structure to Entanglement Performance

Rawan AlMakinah, Muhammed Abdullah Canbaz

Quantum communication networks—the substrate of a future quantum Internet—demand analytical tools that account for entanglement, fidelity, and quantum-specific constraints absent from classical models. In this paper, we introduce the Quantum Network Science (QNS) framework that adapts core network metrics to the quantum setting through fidelity-, success-probability-, and capacity-aware weighting. We formalize centrality (including Quantum PageRank and continuous-time quantum-walk variants), community structure on entanglement graphs, and robustness/percolation with fidelity thresholds. The framework is validated via analytic motifs and controlled simulations on Erdős–Rényi, scale-free, and small-world topologies, as well as satellite-assisted versus fiber-only designs. Our results show that (i) fidelity weighting reorders structural importance and can reconnect networks that appear fragmented classically; (ii) heavy-tailed degree patterns improve tolerance to random failures but heighten vulnerability to targeted hub attacks; (iii) small-world shortcuts induced by long-range quantum links shrink path lengths; and (iv) overlapping “connected components” emerge from entanglement swapping, motivating revised connectivity baselines. We also discuss design implications—degree caps and hub hardening, link-type diversity, multipath routing, and buffering policies—and outline extensions to temporal and multilayer modeling that couple the quantum plane with its classical control layer. QNS thus offers a principled, measurement-oriented foundation for analyzing, comparing, and engineering resilient, high-capacity quantum networks.

Proceedings of the AAAI Symposium Series•Nov 23, 2025•1 citation

A Quantum Overlay Network for Efficient Entanglement Distribution

Shahrooz Pouryousef, Nitish K. Panigrahy, Don Towsley

Distributing quantum entanglements over long distances is essential for the realization of a global scale quantum Internet. Most of the prior work and proposals assume an on-demand distribution of entanglements which may result in significant network resource under-utilization. In this work, we introduce Quantum Overlay Networks (QONs) for efficient entanglement distribution in quantum networks. When the demand to create end-to-end user entanglements is low, QONs can generate and store maximally entangled Bell pairs (EPR pairs) at specific overlay storage nodes of the network. Later, during peak demands, requests can be served by performing entanglement swaps either over a direct path from the network or over a path using the storage nodes. We solve the link entanglement and storage resource allocation problem in such a QON using a centralized optimization framework. We evaluate the performance of our proposed QON architecture over a wide number of network topologies under various settings using extensive simulation experiments. Our results demonstrate that QONs fare well by a factor of 40% with respect to meeting surge and changing demands compared to traditional non-overlay proposals. QONs also show significant improvement in terms of average entanglement request service delay over non-overlay approaches.

arXiv:2212.01694•IEEE Conference on Computer Communications (INFOCOM)•May 17, 2023•40 citations

Emergent Operational Entanglement Graphs and Sub-Quadratic Authentication Scaling in Realistic E91 Quantum Networks

José Luis Rosales

Large-scale entanglement-based quantum key distribution (QKD) networks are commonly assumed to require authentication resources scaling quadratically with the number of users. We show that realistic quantum communication networks operating under loss, decoherence, and LOCC constraints exhibit fundamentally different scaling laws. Using Pauli transfer matrix (PTM) transport, we demonstrate that Bell correlations decay exponentially along entanglement-swapping paths, generating finite operational correlation lengths and sparse operational entanglement graphs. In sparse metropolitan quantum networks, the number of CHSH-usable Bell pairs consequently scales linearly with network size, while authentication complexity scales as \[ Θ(N\log N), \] under sparse-mixing assumptions. We further present an ancilla-assisted distributed Bell-state verification framework for realistic E91 quantum metropolitan infrastructures. Our results suggest that scalable authentication in quantum communication networks emerges directly from the physics of entanglement transport.

quant-pharXiv:2605.27434•May 25, 2026•0 citations

Where to Decide: Control-Plane Geometry in Coherence-Limited Quantum Networks

I. Dey, N. Marchetti

Quantum networks are usually framed by two hardware limits: how fast entanglement can be heralded, and how long a memory can hold it. We establish a third, geometric limit: entanglement decoheres while control information travels, so the distance to whoever allocates resources enters the fidelity budget directly. We develop a functional-graph abstraction weighting each link by its predicted multiplicative contribution to end-to-end fidelity, separating global but delayed state from local and immediate state, and compare centralized against local allocation in a replicated discrete-event model. Centralized delivery latency grows with network diameter while local latency is nearly scale invariant, differing up to twenty-fold for short-range traffic; the coherence threshold at which a global view outweighs a fresh one does not shift across the tested sizes; and as heralding accelerates, the dominant cost moves into the control plane. Slot synchronization instead obeys the product of slot rate and one-way link delay, so it is bounded by repeater spacing rather than diameter. Controller placement, decision locality, repeater spacing and slot rate are physical design parameters, not implementation details.

quant-pharXiv:2609.23047•Sep 22, 2026•0 citations

Entanglement-based wavelength multiplexed quantum communication network (Conference Presentation)

Sören Wengerowsky, Siddarth Koduru Joshi, Fabian Steinlechner +2 more

Quantum networks scale the advantages of quantum communication protocols to more than just two distant users. Here we present a fully connected quantum network architecture in which a single entangled photon source distributes quantum states to a multitude of users. Our network architecture thus minimizes the resources required of each user without sacrificing security or functionality. As no adaptations of the source are required to add users, the network can readily be scaled to a large number of clients, whereby no trust in the provider of the quantum source is required. Unlike previous attempts at multi-user networks, which have been based on active components, and thus limited to some duty cycle, our implementation is fully passive and thus provides the potential for unprecedented quantum communication speeds. We experimentally demonstrate the feasibility of our approach using a single source of bi-partite polarization entanglement which is multiplexed into 12 wavelength channels to distribute 6 states between 4 users in a fully connected graph using only 1 fiber and polarization analysis module per user. We then discuss practical usage scenarios to demonstrate the advantage of some of the salient features of our network topology. These include adaptations/hardware implementations that are more favorable for local area networks and those for long distance intercity links. Our implementation consisted of a single Type 0 MgO:PPLN crystal pumped bidirectionally in a Sagnac interferometer to produce polarization entangled photon pairs with an ≈ 60 nm bandwidth. These pair wise entangled photons were split into 12 different wavelength channels corresponding to 6 correlated wavelength pairs. Each of the 4 users in our demonstration received 3 wavelength channels multiplexed together via a solitary single mode fiber. Each user had just one detector unit that they used to simultaneously measure all input channels. We exploited small time delays between different channels to isolate the relevant signal from noise. We measured the quality of entanglement between each channel pair simultaneously and calculated the effective secure key rate using the E91 protocol. Our experiment showed the effectiveness of our network topology and its scalability against noise, number of users and losses. Further experiments are underway to increase the number of clients and improve the scalability of the topology. Also, we plan to demonstrate distributed computation tasks like secure auctions, Byzantine fault tolerance, and asynchronous reference frame agreement are feasible using our network architecture.

SPIE Quantum Information Science and Technology•Oct 11, 2018•1 citation

Adaptive Resource and Memory Control for Stability in Quantum Entanglement Distribution

Nicolò Lo Piparo, William J. Munro, Kae Nemoto

We investigate congestion-aware control of quantum repeater nodes operating under stochastic traffic and finite memory coherence. Entanglement generation is modeled as a probabilistic process producing Werner states subject to depolarizing memory decoherence, while entanglement requests arrive according to Poisson and bursty ON--OFF processes. Using a queueing-theoretic framework, we couple physical-layer memory dynamics with congestion-dependent service behavior to analyze stability, delay, and fidelity trade-offs. Operating regimes are characterized in terms of the load parameter, showing that fixed cutoff policies impose a fundamental fidelity--latency trade-off together with strict stability limits. Queue-aware adaptive control strategies are then introduced that dynamically adjust memory cutoff times and the number of parallel entanglement-generation channels. Cutoff adaptation restores stability near critical load by trading fidelity for service capacity, whereas resource scaling increases capacity without degrading entanglement quality. Under bursty traffic, joint adaptation suppresses delay spikes while activating additional channels only during congestion periods. The framework is further extended to a two-user shared-resource scenario in which independent traffic flows compete for a common resource pool. Stability is determined by aggregate load, while adaptive resource redistribution stabilizes queues that diverge under fixed partitioning. These results provide a queue-aware congestion-control perspective for adaptive resource management in quantum networks.

quant-pharXiv:2603.24874•Mar 27, 2026•0 citations
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 NNN and active users MMM, 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)Θ(N^{-1})Θ(N−1) entanglement transport per activation slot below their thresholds and Θ(N)Θ(\sqrt N)Θ(N​) above them. For homogeneous chains, asymptotic aggregation exceeds fixed-window capacity by a factor Θ(N2/M)Θ(N^2/M)Θ(N2/M), and in spatial expansion a noisy physical implementation achieves Θ(M/N)Θ(M/N)Θ(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.
The paper asks how distance-sensitive entanglement delivery scales with network size NNN and active-user population MMM, 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 rrr activation slots per second, service is bounded by rCET(∞)rC_{\mathrm{ET}}^{(\infty)}rCET(∞)​.
For expanding honeycomb lattices with one uniformly random session, four specified fixed-window entanglement-percolation constructions achieve Θ(N−1)\Theta(N^{-1})Θ(N−1) transport below their respective thresholds and Θ(N)\Theta(\sqrt N)Θ(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⁡[Θ(N)]\exp[\Theta(\sqrt N)]exp[Θ(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 Θ(MaN/N)\Theta(Ma_N/N)Θ(MaN​/N), versus Θ(wpaNN)\Theta(wpa_NN)Θ(wpaN​N) with asymptotic aggregation, a Θ(N2/M)\Theta(N^2/M)Θ(N2/M) separation at fixed multiplicity www and success probability ppp. Proofs combine interval-flow integrality, constructive routing, and fidelity-calibrated squashed-entanglement cut bounds. Specified noisy implementations achieve Θ(M/N)\Theta(M/N)Θ(M/N) service in expansion; simulations give hop ceilings of 9 without purification and 12 with one-round DEJMPS. Ideal retention achieves Θ(N/log⁡N)\Theta(N/\log N)Θ(N/logN).
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.
Quantum communication networks—the substrate of a future quantum Internet—demand analytical tools that account for entanglement, fidelity, and quantum-specific constraints absent from classical models. In this paper, we introduce the Quantum Network Science (QNS) framework that adapts core network metrics to the quantum setting through fidelity-, success-probability-, and capacity-aware weighting. We formalize centrality (including Quantum PageRank and continuous-time quantum-walk variants), community structure on entanglement graphs, and robustness/percolation with fidelity thresholds. The framework is validated via analytic motifs and controlled simulations on Erdős–Rényi, scale-free, and small-world topologies, as well as satellite-assisted versus fiber-only designs. Our results show that (i) fidelity weighting reorders structural importance and can reconnect networks that appear fragmented classically; (ii) heavy-tailed degree patterns improve tolerance to random failures but heighten vulnerability to targeted hub attacks; (iii) small-world shortcuts induced by long-range quantum links shrink path lengths; and (iv) overlapping “connected components” emerge from entanglement swapping, motivating revised connectivity baselines. We also discuss design implications—degree caps and hub hardening, link-type diversity, multipath routing, and buffering policies—and outline extensions to temporal and multilayer modeling that couple the quantum plane with its classical control layer. QNS thus offers a principled, measurement-oriented foundation for analyzing, comparing, and engineering resilient, high-capacity quantum networks.
Distributing quantum entanglements over long distances is essential for the realization of a global scale quantum Internet. Most of the prior work and proposals assume an on-demand distribution of entanglements which may result in significant network resource under-utilization. In this work, we introduce Quantum Overlay Networks (QONs) for efficient entanglement distribution in quantum networks. When the demand to create end-to-end user entanglements is low, QONs can generate and store maximally entangled Bell pairs (EPR pairs) at specific overlay storage nodes of the network. Later, during peak demands, requests can be served by performing entanglement swaps either over a direct path from the network or over a path using the storage nodes. We solve the link entanglement and storage resource allocation problem in such a QON using a centralized optimization framework. We evaluate the performance of our proposed QON architecture over a wide number of network topologies under various settings using extensive simulation experiments. Our results demonstrate that QONs fare well by a factor of 40% with respect to meeting surge and changing demands compared to traditional non-overlay proposals. QONs also show significant improvement in terms of average entanglement request service delay over non-overlay approaches.
Large-scale entanglement-based quantum key distribution (QKD) networks are commonly assumed to require authentication resources scaling quadratically with the number of users. We show that realistic quantum communication networks operating under loss, decoherence, and LOCC constraints exhibit fundamentally different scaling laws. Using Pauli transfer matrix (PTM) transport, we demonstrate that Bell correlations decay exponentially along entanglement-swapping paths, generating finite operational correlation lengths and sparse operational entanglement graphs. In sparse metropolitan quantum networks, the number of CHSH-usable Bell pairs consequently scales linearly with network size, while authentication complexity scales as Θ(Nlog⁡N), Θ(N\log N), Θ(NlogN), under sparse-mixing assumptions. We further present an ancilla-assisted distributed Bell-state verification framework for realistic E91 quantum metropolitan infrastructures. Our results suggest that scalable authentication in quantum communication networks emerges directly from the physics of entanglement transport.
Quantum networks are usually framed by two hardware limits: how fast entanglement can be heralded, and how long a memory can hold it. We establish a third, geometric limit: entanglement decoheres while control information travels, so the distance to whoever allocates resources enters the fidelity budget directly. We develop a functional-graph abstraction weighting each link by its predicted multiplicative contribution to end-to-end fidelity, separating global but delayed state from local and immediate state, and compare centralized against local allocation in a replicated discrete-event model. Centralized delivery latency grows with network diameter while local latency is nearly scale invariant, differing up to twenty-fold for short-range traffic; the coherence threshold at which a global view outweighs a fresh one does not shift across the tested sizes; and as heralding accelerates, the dominant cost moves into the control plane. Slot synchronization instead obeys the product of slot rate and one-way link delay, so it is bounded by repeater spacing rather than diameter. Controller placement, decision locality, repeater spacing and slot rate are physical design parameters, not implementation details.
Quantum networks scale the advantages of quantum communication protocols to more than just two distant users. Here we present a fully connected quantum network architecture in which a single entangled photon source distributes quantum states to a multitude of users. Our network architecture thus minimizes the resources required of each user without sacrificing security or functionality. As no adaptations of the source are required to add users, the network can readily be scaled to a large number of clients, whereby no trust in the provider of the quantum source is required. Unlike previous attempts at multi-user networks, which have been based on active components, and thus limited to some duty cycle, our implementation is fully passive and thus provides the potential for unprecedented quantum communication speeds. We experimentally demonstrate the feasibility of our approach using a single source of bi-partite polarization entanglement which is multiplexed into 12 wavelength channels to distribute 6 states between 4 users in a fully connected graph using only 1 fiber and polarization analysis module per user. We then discuss practical usage scenarios to demonstrate the advantage of some of the salient features of our network topology. These include adaptations/hardware implementations that are more favorable for local area networks and those for long distance intercity links. Our implementation consisted of a single Type 0 MgO:PPLN crystal pumped bidirectionally in a Sagnac interferometer to produce polarization entangled photon pairs with an ≈ 60 nm bandwidth. These pair wise entangled photons were split into 12 different wavelength channels corresponding to 6 correlated wavelength pairs. Each of the 4 users in our demonstration received 3 wavelength channels multiplexed together via a solitary single mode fiber. Each user had just one detector unit that they used to simultaneously measure all input channels. We exploited small time delays between different channels to isolate the relevant signal from noise. We measured the quality of entanglement between each channel pair simultaneously and calculated the effective secure key rate using the E91 protocol. Our experiment showed the effectiveness of our network topology and its scalability against noise, number of users and losses. Further experiments are underway to increase the number of clients and improve the scalability of the topology. Also, we plan to demonstrate distributed computation tasks like secure auctions, Byzantine fault tolerance, and asynchronous reference frame agreement are feasible using our network architecture.
We investigate congestion-aware control of quantum repeater nodes operating under stochastic traffic and finite memory coherence. Entanglement generation is modeled as a probabilistic process producing Werner states subject to depolarizing memory decoherence, while entanglement requests arrive according to Poisson and bursty ON--OFF processes. Using a queueing-theoretic framework, we couple physical-layer memory dynamics with congestion-dependent service behavior to analyze stability, delay, and fidelity trade-offs. Operating regimes are characterized in terms of the load parameter, showing that fixed cutoff policies impose a fundamental fidelity--latency trade-off together with strict stability limits. Queue-aware adaptive control strategies are then introduced that dynamically adjust memory cutoff times and the number of parallel entanglement-generation channels. Cutoff adaptation restores stability near critical load by trading fidelity for service capacity, whereas resource scaling increases capacity without degrading entanglement quality. Under bursty traffic, joint adaptation suppresses delay spikes while activating additional channels only during congestion periods. The framework is further extended to a two-user shared-resource scenario in which independent traffic flows compete for a common resource pool. Stability is determined by aggregate load, while adaptive resource redistribution stabilizes queues that diverge under fixed partitioning. These results provide a queue-aware congestion-control perspective for adaptive resource management in quantum networks.