The realization of distributed quantum neural networks (DQNNs) over quantum internet infrastructures faces fundamental challenges arising from the fragile nature of entanglement and the demanding synchronization requirements of distributed learning. We introduce a Consensus-Entanglement-Aware Scheduling (CEAS) framework that co-designs quantum consensus protocols with adaptive entanglement management to enable robust synchronous training across distributed quantum processors. CEAS integrates fidelity-weighted aggregation, in which parameter updates are weighted by quantum Fisher information to suppress noisy contributions, with decoherence-aware entanglement scheduling that treats Bell pairs as perishable resources subject to exponential decay. The framework incorporates quantum-authenticated Byzantine fault tolerance, ensuring security against malicious nodes while maintaining compatibility with noisy intermediate-scale quantum (NISQ) constraints. Our theoretical analysis establishes convergence guarantees under heterogeneous noise conditions, while numerical simulations demonstrate that CEAS maintains 10-15 percentage points higher accuracy compared to entanglement-oblivious baselines under coordinated Byzantine attacks, achieving 90 percent Bell-pair utilization despite coherence time limitations. This work provides a foundational architecture for scalable distributed quantum machine learning, bridging quantum networking, distributed optimization, and early fault-tolerant quantum computation.
The realization of distributed quantum neural networks (DQNNs) over quantum internet infrastructures faces fundamental challenges arising from the fragile nature of entanglement and the demanding synchronization requirements of distributed learning. We introduce a Consensus-Entanglement-Aware Scheduling (CEAS) framework that co-designs quantum consensus protocols with adaptive entanglement management to enable robust synchronous training across distributed quantum processors. CEAS integrates fidelity-weighted aggregation, in which parameter updates are weighted by quantum Fisher information to suppress noisy contributions, with decoherence-aware entanglement scheduling that treats Bell pairs as perishable resources subject to exponential decay. The framework incorporates quantum-authenticated Byzantine fault tolerance, ensuring security against malicious nodes while maintaining compatibility with noisy intermediate-scale quantum (NISQ) constraints. Our theoretical analysis establishes convergence guarantees under heterogeneous noise conditions, while numerical simulations demonstrate that CEAS maintains 10-15 percentage points higher accuracy compared to entanglement-oblivious baselines under coordinated Byzantine attacks, achieving 90 percent Bell-pair utilization despite coherence time limitations. This work provides a foundational architecture for scalable distributed quantum machine learning, bridging quantum networking, distributed optimization, and early fault-tolerant quantum computation.
This paper proposes a novel distributed consensus algorithm utilizing quantum entanglement to achieve Byzantine fault tolerance. Traditional consensus algorithms struggle to guarantee correctness in the face of malicious actors (Byzantine faults) where nodes can arbitrarily deviate from the honest majority. This work introduces a protocol that leverages the unique properties of quantum entanglement to establish correlated states between nodes, enabling the detection and mitigation of these malicious behaviors without relying on trusted third parties or computationally intensive verification processes. The core claim is that quantum entanglement provides a provably secure and efficient mechanism for distributed consensus, offering superior resilience compared to classical approaches. The algorithm is formally described, and key mathematical components, including state transformations and probability calculations, are presented. The theoretical analysis demonstrates the algorithm's ability to converge to a correct consensus state even when a significant fraction of nodes are faulty. The use of entanglement fundamentally alters the Byzantine fault tolerance landscape, offering a pathway towards more robust and secure distributed systems.
Abstract Quantum communication plays a key role in enabling distributed Noisy Intermediate-Scale Quantum (NISQ) systems; however, practical quantum networks are often affected by link fluctuations, limited quantum resources, and entanglement degradation. These factors make reliable routing and scheduling difficult, particularly in large-scale and dynamically changing environments. Classical methods such as Historical Weighted Fidelity Routing (HWFR) and Dynamic Multi-Priority Quantum Scheduling (DMPQS) generally perform well only when network conditions remain stable, and their performance degrades when entanglement success rates vary or relay nodes become congested. A major challenge therefore lies in operating under uncertain and time-varying fidelity conditions. Most existing approaches focus on either routing or scheduling in isolation and do not explicitly consider future fidelity variations, which can lead to inefficient resource usage and increased end-to-end latency. In this work, we propose a Deep Reinforcement Learning-based Quantum Communication Optimization Framework (DRL-QCOF) that jointly addresses routing and scheduling. The framework employs a Bi-LSTM-based Quantum Fidelity Prediction Network (QFPN) to estimate future link fidelity F_"pred" (t)from time-series features including link length, noise coefficient, entanglement success probability, and relay utilization. These predictions are then used by a Deep Reinforcement Learning-based Adaptive Quantum Scheduling Agent (DRAQS-Agent), implemented using an Actor–Critic architecture with a continuous reward formulation, to guide routing and scheduling decisions across distributed nodes. Simulation results indicate that the proposed approach improves the average link fidelity to a maximum of 0.88, compared to 0.78–0.86 achieved by existing methods. The end-to-end latency is reduced from 104 ms to 83 ms, while baseline schemes remain above 110 ms under the same conditions. In addition, the average response time is reduced to approximately 147 ms, resource utilization increases to 71–83%, and the success ratio improves from 93% to 97%, resulting in improved end-to-end reliability. The cumulative reward stabilizes at around 16.0, with convergence observed within 300 training episodes, and the achieved throughput reaches 118–121 entangled pairs per second, confirming the effectiveness of the proposed framework in dynamic NISQ network scenarios.
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.
The scalability of quantum neural networks (QNNs) is limited by hardware constraints such as restricted qubit connectivity and circuit depth. This paper presents a distributed quantum neural network (DQNN) architecture that enables multi-processor quantum computation through teleportationbased distributed CNOT gates. The proposed framework allows variational circuits to operate seamlessly across nodes using ancilla-mediated entanglement and pre-shared Bell pairs, without requiring direct physical links. We demonstrate that this distributed design inherently mitigates the barren plateau problem by reducing circuit depth per node, localizing cost functions, and introducing structured inter-node entanglement, thereby improving gradient trainability. Experiments on network traffic anomaly detection show that the DQNN achieves competitive classification accuracy while efficiently managing resource tradeoffs, including a 33 % ancilla overhead, minimal communication cost (2 bits per distributed CNOT), and distribution of up to 50 % of CNOT operations. These results establish a scalable and trainable architecture for near-term quantum machine learning.
This paper presents a novel approach to distributed consensus protocols leveraging quantum entanglement and Byzantine fault tolerance. The core claim is that quantum entanglement can provide secure and efficient agreement among nodes even in the presence of malicious actors. We propose a mechanism that utilizes quantum key distribution (QKD) to establish shared entanglement between participating nodes. Subsequent quantum measurements identify faulty nodes, informing a robust consensus algorithm built upon majority voting and entanglement-based error correction. The potential advantages of this combined approach – enhanced security and efficiency compared to traditional classical methods – are explored. The research addresses the critical challenge of achieving reliable consensus in distributed systems susceptible to Byzantine attacks. This work introduces a new paradigm for consensus, potentially leading to more resilient and secure distributed applications.
As quantum computing transitions into the Noisy Intermediate-Scale Quantum (NISQ) era, scaling monolithic quantum processors remains a significant challenge due to decoherence and operational noise. This dissertation proposes enhancing the connectivity of distributed quantum systems as a scalable solution, focusing on three major research tasks: architectural co-design, operation scheduling optimization, and network topology design. First, to address the physical qubit limits of single-chip processors, we investigate the co-design of network topology and logical qubit allocation for Distributed Quantum Computing (DQC). By modeling qubit interaction as a graph partition problem, we propose a joint optimization framework to minimize inter-QPU communication overhead. Our results demonstrate that the proposed linearized formulation, TACO-L, significantly outperforms traditional two-stage methods in executing complex quantum circuits. Second, we address the challenge of maintaining high-fidelity long-distance entanglements through the optimization of Swapping and Purification Schemes (SPS). We prove that in Binary systems, any optimal swapping and purification tree (OSPT) must follow a Restricted SPT (RT) pattern, where purification is integrated at the link level prior to swapping. Furthermore, we introduce the gradient-based GradTree algorithm, which enables an efficient search for low-cost, high-fidelity scheduling in complex noise environments. Finally, this dissertation formulates the first general Topology Design Problem (TDP) for quantum networks, jointly optimizing quantum memory allocation, optical channel deployment, and entanglement scheduling. By analyzing flow-based and path-based formulations, we prove the optimality of the Relaxed Complete Swapping Tree (RCST) in minimizing the expected cost of entanglement distribution. Collectively, these contributions provide a comprehensive theoretical and algorithmic framework for building scalable, cost-effective global quantum internet architectures.