The evolution of quantum computing technologies has been advancing at a steady pace in the recent years, and the current trend suggests that it will become available at scale for commercial purposes in the near future. The acceleration can be boosted by pooling compute infrastructures to either parallelize algorithm execution or solve bigger instances that are not feasible on a single quantum computer, which requires an underlying Quantum Internet: the interconnection of quantum computers by quantum links and repeaters to exchange entangled quantum bits. However, Quantum Internet research so far has been focused on provisioning point-to-point flows only, which is suitable for (e.g.) quantum sensing and metrology, but not for distributed quantum computing. In this paper, after a primer on quantum computing and networking, we investigate the requirements and objectives of smart computing on distributed nodes from the perspective of quantum network provisioning. We then design a resource allocation strategy that is evaluated through a comprehensive simulation campaign, whose results highlight the key features and performance issues, and lead the way to further investigation in this direction.
The evolution of quantum computing technologies has been advancing at a steady pace in the recent years, and the current trend suggests that it will become available at scale for commercial purposes in the near future. The acceleration can be boosted by pooling compute infrastructures to either parallelize algorithm execution or solve bigger instances that are not feasible on a single quantum computer, which requires an underlying Quantum Internet: the interconnection of quantum computers by quantum links and repeaters to exchange entangled quantum bits. However, Quantum Internet research so far has been focused on provisioning point-to-point flows only, which is suitable for (e.g.) quantum sensing and metrology, but not for distributed quantum computing. In this paper, after a primer on quantum computing and networking, we investigate the requirements and objectives of smart computing on distributed nodes from the perspective of quantum network provisioning. We then design a resource allocation strategy that is evaluated through a comprehensive simulation campaign, whose results highlight the key features and performance issues, and lead the way to further investigation in this direction.
In the future, quantum computers will become widespread and a network of quantum repeaters will provide them with end-to-end entanglement of remote quantum bits. As a result, a pervasive quantum computation infrastructure will emerge, which will unlock several novel applications, including distributed quantum computing, that is the pooling of resources on multiple computation nodes to address problem instances that are unattainable by any individual quantum computer. In this paper, we first investigate the issue of service differentiation in this new environment. Then, we define the problem of how to select which computation nodes should participate in each pool, so as to achieve a fair share of the quantum network resources available. The analysis is performed via an open source simulator and the results are fully and readily available.
Quantum computing is a new discipline that uses the ideas of quantum physics to do calculations that are not possible with conventional computers. Quantum bits, called qubits, could exist in superposition states, making them suitable for parallel processing in contrast to traditional bits. When it comes to addressing complex challenges like proof simulation, optimization, and cryptography, quantum entanglement and quantum interference provide exponential improvements. This survey focuses on recent advances in entanglement routing, quantum key distribution (QKD), and qubit management for short- and long-distance quantum communication. It studies optimization approaches such as integer programming, reinforcement learning, and collaborative methods, evaluating their efficacy in terms of throughput, scalability, and fairness. Despite improvements, challenges remain in dynamic network adaptation, resource limits, and error correction. Addressing these difficulties necessitates the creation of hybrid quantum–classical algorithms for efficient resource allocation, hardware-aware designs to improve real-world deployment, and fault-tolerant architecture. Therefore, this survey suggests that future research focus on integrating quantum networks with existing classical infrastructure to improve security, dependability, and mainstream acceptance. This connection has significance for applications that require secure communication, financial transactions, and critical infrastructure protection.
Quantum networks are a rapidly evolving technology that utilizes the principles of quantum mechanics to facilitate secure communication, distributed quantum computing, and highly sensitive sensor networks. Quantum networks are constructed using diverse components, such as quantum information sources, quantum memories, quantum repeaters, and quantum detectors. These networks leverage the distinctive features of quantum mechanics, such as superposition and entanglement, to attain superior performance benefits. Despite the numerous challenges that impede the development of quantum networks, such as the requirement for more efficient and dependable components, considerable advancements have been achieved in recent years through the utilization of simulations and experimental platforms. With the growing need for enhanced security and faster computing, the potential for quantum networks appears promising in the future. The potential of these innovations to revolutionize various fields and facilitate novel breakthroughs and discoveries is noteworthy. In this paper, we review the current state of the art in quantum networks, including key concepts and technologies such as quantum key distribution, quantum repeaters, and quantum routing. We also discuss some of the key challenges in quantum networks, including scalability, noise, and interoperability, and highlight some of the key research directions in this field. Finally, we discuss some of the potential applications of quantum networks, including secure communication, quantum computing, and quantum sensing. This paper provides a comprehensive overview of the current status and future directions of quantum networks and will be of interest to researchers, engineers, and policymakers working in this field.
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 are a rapidly evolving technology that utilizes the principles of quantum mechanics to facilitate secure communication, distributed quantum computing, and highly sensitive sensor networks. Quantum networks are constructed using diverse components, such as quantum information sources, quantum memories, quantum repeaters, and quantum detectors. These networks leverage the distinctive features of quantum mechanics, such as superposition and entanglement, to attain superior performance benefits. Despite the numerous challenges that impede the development of quantum networks, such as the requirement for more efficient and dependable components, considerable advancements have been achieved in recent years through the utilization of simulations and experimental platforms. With the growing need for enhanced security and faster computing, the potential for quantum networks appears promising in the future. The potential of these innovations to revolutionize various fields and facilitate novel breakthroughs and discoveries is noteworthy. In this paper, we review the current state of the art in quantum networks, including key concepts and technologies such as quantum key distribution, quantum repeaters, and quantum routing. We also discuss some of the key challenges in quantum networks, including scalability, noise, and interoperability, and highlight some of the key research directions in this field. Finally, we discuss some of the potential applications of quantum networks, including secure communication, quantum computing, and quantum sensing. This paper provides a comprehensive overview of the current status and future directions of quantum networks and will be of interest to researchers, engineers, and policymakers working in this field.
With the advantages of high-speed parallel processing, quantum computers can efficiently solve large-scale complex optimization problems in future networks. However, due to the uncertain qubit fidelity and quantum channel noise, distributed quantum computing, which relies on quantum networks connected through entanglement, faces many challenges in exchanging information across quantum computers. In this article, we propose an adaptive distributed quantum computing approach, called DQC2O, to manage quantum computers and quantum networks for solving optimization tasks in future networks. Firstly, we describe the fundamentals of quantum computing and its distributed concept in quantum networks. Secondly, to address the uncertainty of future demands of collaborative optimization tasks and instability over quantum networks, we propose a quantum resource allocation scheme based on stochastic programming for minimizing quantum resource consumption. Finally, based on the proposed approach, we discuss the potential military applications of collaborative optimization in future networks, such as smart grid management, IoT cooperation, and semantic communications. Promising research directions that can lead to the design and implementation of future distributed quantum computing frameworks are also highlighted.