Practical distributed quantum computing and error correction require quantum networks with high-qubit-rate, high-fidelity, and low-reconfiguration-latency. Unfortunately, current approaches are limited by fundamental constraints: single-channel entanglement rates remain at the MHz level with millisecond-level reconfiguration, which is insufficient for fault-tolerant distributed quantum computing. Here, we propose a quantum network architecture that leverages reconfigurable quantum interfaces and wavelength-selective switches to overcome bandwidth and latency constraints. By tuning the frequency and temporal modes of photonic qubits across dense wavelength division multiplexing (DWDM) channels, our protocol achieves an entanglement generation rate of up to 183.4 MHz based on our comprehensive modeling of the networked cold atom computing systems. Our architecture enables nanosecond-scale network reconfiguration with low loss, low infidelity, and high dimensionality. Our modeling and simulation are designed for deployable distributed quantum computing and error correction, integrating the quantum interface, network switching, circuit compilation, and execution into a unified framework. The proposed architecture is fully compatible with industry-standard DWDM infrastructure, providing a scalable and cost-effective foundation for distributed quantum computing.
Practical distributed quantum computing and error correction require quantum networks with high-qubit-rate, high-fidelity, and low-reconfiguration-latency. Unfortunately, current approaches are limited by fundamental constraints: single-channel entanglement rates remain at the MHz level with millisecond-level reconfiguration, which is insufficient for fault-tolerant distributed quantum computing. Here, we propose a quantum network architecture that leverages reconfigurable quantum interfaces and wavelength-selective switches to overcome bandwidth and latency constraints. By tuning the frequency and temporal modes of photonic qubits across dense wavelength division multiplexing (DWDM) channels, our protocol achieves an entanglement generation rate of up to 183.4 MHz based on our comprehensive modeling of the networked cold atom computing systems. Our architecture enables nanosecond-scale network reconfiguration with low loss, low infidelity, and high dimensionality. Our modeling and simulation are designed for deployable distributed quantum computing and error correction, integrating the quantum interface, network switching, circuit compilation, and execution into a unified framework. The proposed architecture is fully compatible with industry-standard DWDM infrastructure, providing a scalable and cost-effective foundation for distributed quantum computing.
Abstract Quantum communication networks enable applications ranging from highly secure communication to clock synchronization and distributed quantum computing. Miniaturized, flexible, and cost-efficient resources will be key elements for ensuring the scalability of such networks as they progress towards large-scale deployed infrastructures. Here, we bring these elements together by combining an on-chip, telecom-wavelength, broadband entangled photon source with industry-grade flexible-grid wavelength division multiplexing techniques, to demonstrate reconfigurable entanglement distribution between up to 8 users in a resource-optimized quantum network topology. As a benchmark application we use quantum key distribution, and show low error and high secret key generation rates across several frequency channels, over both symmetric and asymmetric metropolitan-distance optical fibered links and including finite-size effects. By adapting the bandwidth allocation to specific network constraints, we also illustrate the flexible networking capability of our configuration. Together with the potential of our semiconductor source for distributing secret keys over a 60 nm bandwidth with commercial multiplexing technology, these results offer a promising route to the deployment of scalable quantum network architectures.
As we move towards scalable and modular quantum computing, quantum data centres become imperative. Existing analyses typically treat network constraints in isolation or through simplified models, leaving the interplay between error correction operations and communication resources underexplored. In this work, we present an end-to-end simulation framework that jointly models surface-code operations, internal QPU connectivity, and realistic network constraints including finite entanglement generation rates, limited communication qubits, and bandwidth contention, producing execution latency, from which logical error rate estimates are obtained. The framework is modular by design, allowing individual components such as routing heuristics, scheduling policies, and network topologies to be independently replaced. Numerical evaluation reveals distinct operating regimes in which the optimal resource allocation and code distance selection shift depending on the network characteristics. These results point to tradeoffs in the design of distributed quantum computing architectures that are not visible when computation and communication are modeled separately.
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 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.
Abstract Distributed quantum computing (DQC) combines the computing power of multiple networked quantum processing modules, ideally enabling the execution of large quantum circuits without compromising performance or qubit connectivity 1,2 . Photonic networks are well suited as a versatile and reconfigurable interconnect layer for DQC; remote entanglement shared between matter qubits across the network enables all-to-all logical connectivity through quantum gate teleportation (QGT) 3,4 . For a scalable DQC architecture, the QGT implementation must be deterministic and repeatable; until now, no demonstration has satisfied these requirements. Here we experimentally demonstrate the distribution of quantum computations between two photonically interconnected trapped-ion modules. The modules, separated by about two metres, each contain dedicated network and circuit qubits. By using heralded remote entanglement between the network qubits, we deterministically teleport a controlled-Z (CZ) gate between two circuit qubits in separate modules, achieving 86% fidelity. We then execute Grover’s search algorithm 5 —to our knowledge, the first implementation of a distributed quantum algorithm comprising several non-local two-qubit gates—and measure a 71% success rate. Furthermore, we implement distributed iSWAP and SWAP circuits, compiled with two and three instances of QGT, respectively, demonstrating the ability to distribute arbitrary two-qubit operations 6 . As photons can be interfaced with a variety of systems, the versatile DQC architecture demonstrated here provides a viable pathway towards large-scale quantum computing for a range of physical platforms.