Abstract Quantum-network capacity planning couples memory physics, finite storage, topology, and traffic. We study these interactions using a discrete-event simulator with six representative memory profiles. A memory–topology atlas contains 9,360 completed runs, complemented by 8,730 confirmatory runs and an extended per-node memory-budget sweep. We distinguish a threshold relative to the best performance observed on a finite grid from a physical saturation limit. Among 840 reported threshold estimates, 22.3% reach 95% of the observed maximum by four slots per node, while 35.5% first reach it at the upper grid boundary of 64 slots. Four tested scalar reductions do not provide a topology independent collapse; the best pooled quadratic fit explains 37.9% of response variance. The retrieval-window parameter χr = τr pgen/tattempt provides an interpretable descriptor, but an independent-channel approximation does not establish a network memorysizing law. In 5,310 heterogeneous-placement runs, hub and betweenness-based placement outperform peripheral placement in aggregate, with topology-specific exceptions. Coupling assumptions change absolute performance while preserving the aggregate strategy ordering. Harmonized model comparisons provide limited robustness evidence, not1 independent native-protocol validation. The results support model-specific capacity and placement analysis with explicit metric definitions, finite-grid limitations, and interface assumptions
Abstract Quantum-network capacity planning couples memory physics, finite storage, topology, and traffic. We study these interactions using a discrete-event simulator with six representative memory profiles. A memory–topology atlas contains 9,360 completed runs, complemented by 8,730 confirmatory runs and an extended per-node memory-budget sweep. We distinguish a threshold relative to the best performance observed on a finite grid from a physical saturation limit. Among 840 reported threshold estimates, 22.3% reach 95% of the observed maximum by four slots per node, while 35.5% first reach it at the upper grid boundary of 64 slots. Four tested scalar reductions do not provide a topology independent collapse; the best pooled quadratic fit explains 37.9% of response variance. The retrieval-window parameter χr = τr pgen/tattempt provides an interpretable descriptor, but an independent-channel approximation does not establish a network memorysizing law. In 5,310 heterogeneous-placement runs, hub and betweenness-based placement outperform peripheral placement in aggregate, with topology-specific exceptions. Coupling assumptions change absolute performance while preserving the aggregate strategy ordering. Harmonized model comparisons provide limited robustness evidence, not1 independent native-protocol validation. The results support model-specific capacity and placement analysis with explicit metric definitions, finite-grid limitations, and interface assumptions
Quantum-network capacity planning couples memory physics, finite storage, topology, and traffic. We study these interactions with a discrete-event simulator and six representative memory profiles. The simulator is validated against exact single-link, queueing, and swap-ASAP results and against the native SeQUeNCe protocol stack. The native comparison shows that a shared-multiplexing convention used in earlier versions of the model overstates the capacity gain from additional memory, so we report a per-slot model as the primary analysis and the earlier conventions as a sensitivity arm. A single frozen campaign of 266,736 time-based runs with 20 seeds per cell covers an atlas of six profiles, nine topologies, three loads, three network sizes, and seven per-node memory budgets, together with fixed-total-memory, coherence-time, heterogeneous-placement, and Sobol-sensitivity experiments. Under the primary model, the memory budget at which completion reaches 95% of its observed maximum has a median of 8 slots per node, depends more on topology than on memory profile, and reaches the grid boundary of 64 slots in 3.9% of 9688 regimes. Under the earlier conventions, it is strongly profile-dependent, with medians from 4 to at least 64 and 45.8% boundary cases. Four scalar reductions do not collapse the response (pooled quadratic R2 at most 0.152). Topology effects persist at fixed total memory after adjustment for path length. Request completion is independent of the coherence time T2 by construction and is governed by retrieval efficiency, attempt time, and the retrieval decay time τr; T2 enters through fidelity-qualified service. The retrieval-window parameter χr=τrpgen/tattempt orders the profiles by achievable completion but is not a memory-sizing law. Placing high-quality memories at hubs or betweenness bottlenecks outperforms peripheral placement in both model arms and under three interface-coupling rules. Memory-sizing conclusions are therefore sensitive to how multiplexing and storage are modeled and should be validated against native protocol implementations.
Quantum computing promises computational capabilities beyond those of classical systems by exploiting superposition, entanglement, and quantum interference. However, the scalability of current noisy intermediate-scale quantum (NISQ) devices is limited by physical and engineering constraints, restricting the number of available qubits. Distributed quantum computing (DQC) mitigates this limitation by interconnecting multiple quantum processing units (QPUs) via quantum networks capable of distributing high-fidelity entanglement. Realizing such networks requires overcoming probabilistic entanglement generation, finite memory coherence, photon loss, and architectural constraints. This dissertation conducts an in-depth and comprehensive study of resource allocation in quantum networks, aiming to support high-throughput and high-fidelity entanglement distribution over lossy infrastructures. Our work spans the quantum networking stack, from physical-layer entanglement distribution protocols to network planning, quantum storage architectures, and distributed quantum computing. We begin by introducing two asynchronous entanglement distribution protocols-Sequential and Parallel-designed for early-stage quantum networks without global synchronization. Unlike many prior models, our protocols account for classical communication delays and quantum memory decoherence, reflecting practical constraints. Through simulations on real-world topologies such as SURFnet, we show that simple mechanisms such as cutoff-based memory management and sequential asynchronous entanglement distribution protocols can deliver competitive performance while significantly simplifying coordination, narrowing the gap between theoretical proposals and deployable protocols. Next, we formulate quantum network planning as a utility maximization problem that jointly considers entanglement distribution rate and fidelity, treating repeater and memory placement as optimization variables. We propose scalable heuristics and mixed-integer formulations, evaluating them under realistic conditions such as finite coherence time of quantum memories, limited number of memories per repeaters and end nodes, and real network topologies such as ESNet. Our findings offer practical design guidance and highlight how optimal placements depend on underlying physical constraints. To support dynamic workloads and respond to traffic bursts, we propose the Quantum Storage Network (QSN) architecture, where storage nodes buffer EPR pairs in advance of demand as an overlay network. This temporal decoupling improves responsiveness and throughput. Simulations across multiple topologies show that QSNs reduce entanglement distribution service latency by up to 40% and provide improved robustness compared to non-overlay designs, underscoring the value of storage-aware planning in future quantum networks. Finally, we focus on DQC, where large-scale quantum circuits are executed across networked QPUs. We propose a window-based circuit partitioning algorithm that minimizes nonlocal gate execution while balancing load across QPUs. Building on this partitioning, we design an adaptive, dependency-aware entanglement generation scheduler that opportunistically initiates remote entanglement as soon as dependent gates are ready, while accounting for realistic constraints such as coherence limits, probabilistic link generation, and Bell-state measurement (BSM) contention. Applied to benchmark circuits such as QAOA and QFT, this joint approach reduces execution delay by up to 35%. We further perform a two-qubit gate fidelity-sensitivity analysis under to show when the distributed quantum computing can be beneficial. Results show that the number of QPUs significantly impacts sensitivity to non-local gate fidelity: with fewer QPUs, distributed execution can outperform monolithic execution under looser fidelity constraints, whereas with more QPUs, achieving the same advantage requires substantially higher non-local gate fidelities relative to local gate fidelities. These findings identify the parameter regimes in which distributed quantum computing is beneficial, mapping break-even regions (as a function of number of QPUs) and quantifying how much cross-QPU (non-local) gate fidelity must improve—or, equivalently, how much per-QPU local gate fidelity must improve under modularization—for distributed execution to outperform a monolithic baseline. Together, these contributions form a cohesive framework for resource allocation in quantum networks in order to build scalable, delay-tolerant quantum networks and distributed computing systems. By grounding architectural design in realistic physical assumptions, this work advances the state of the art from theoretical modeling to practical, deployable quantum infrastructure.
Quantum networks face a fundamental challenge absent in classical networks; finite memory coherence times mean that queuing delay directly degrades information quality, causing decoherence that has no classical analog. Existing routing protocols optimize for hop count or channel fidelity while treating scheduling delays as a secondary concern, leaving fidelity vulnerable to congestion-induced decoherence. We present a coherence-aware routing protocol that integrates decoherence constraints into path selection via a priority-modulated aging model derived analytically from Weighted Fair Queueing theory, where high-priority traffic receives compressed effective queue delay. We build a custom discrete-event simulator verified against NetSquid (across 104 states), and evaluate across two structurally diverse topology classes under identical physical parameters, isolating topology structure as the sole independent variable. In all experiments, our protocol is benchmarked against loss-only Dijkstra routing and FIFO scheduling as baselines. On topologies, P2 traffic achieves 96.08% fidelity under a 9x load increase with only 0.04 percentage point degradation, versus a 13.51 percentage point collapse for the loss-only baseline; P2 tail latency holds stable at 0.055 ms while Dijkstra degrades 5.5x. On Barabasi-Albert scale-free topologies, our protocol delivers a +4.12 percentage point fidelity advantage with 97.8% higher aggregate throughput at operational loads over the baseline, with a clearly characterized hub-saturation boundary at 160k QPS. FIFO scheduling provides negligible priority differentiation on both topology classes, providing strong evidence that coherence-aware routing-not scheduling alone is responsible for the observed QoS gains.
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.
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 Θ(N2/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.
Findings: On the original quantum-network dataset, the best nonlinear model, Random Forest, reduces mean absolute error (MAE) by only 4.0% relative to Ridge regression with one-hot-encoded categorical features (2.500 versus 2.605), while Ridge reduces MAE by 49.5% relative to a constant predictor (5.160). Nearly all predictive signal is associated with memory family; every individual numerical feature has |r| < 0.08 with the target memory budget mc. In four of five controlled synthetic scenarios—threshold effects, saturation, phase transitions, and family-specific nonlinearity—the best tree ensemble reduces MAE by 31–66% relative to Ridge. In the heterogeneous scenario, Random Forest also reduces the observed under-dimensioning frequency from 55.5% to 35.0%. For a two-way numerical interaction, however, the improvement is only 12.5%. These single-split results support Ridge with one-hot encoding as a necessary baseline, but do not establish a universal model-selection threshold. Method: The original dataset contains 1,000 seed-averaged entanglement-buffering configurations spanning six memory families, nine topology classes, three noise levels, seven traffic levels, and five network sizes (N ϵ {10,15,20,30,50}), with mc ϵ [1,20]. We compare a constant predictor, single-feature linear regression, multivariable linear regression, Ridge regression, Random Forest, and XGBoost on one fixed 60/20/20 train/validation/test split. MAE is the primary metric, supplemented by tolerance accuracy and the fraction of predictions below the target. To probe where nonlinear models begin to add value, we construct five synthetic datasets of 1,000 observations each with controlled threshold, interaction, saturation, phase-transition, and family-heterogeneous response functions. Because all reported comparisons use one split and seed, differences of a few percentage points are exploratory.