Quantum networks form the bedrock of emerging quantum technologies. By connecting quantum systems through entangled links, they enable remarkable applications such as distributed quantum computing, secure quantum communication, and entanglement-enhanced sensing. This thesis investigates several key challenges in quantum networks, namely resource distribution, percolation, and topology. The first part of the thesis analyses the limitations of entanglement distribution using separable states (EDSS) in the zero-added-loss photon multiplexing (ZALM) architecture. The study determines that EDSS protocols outperform direct entanglement distribution when only the separable carrier is sent through a noisy channel. However, when noise is considered in channels via transmission to the memories, this advantage is lost. The second part of the thesis investigates link-level state generation in a distillable multiplexed quantum repeater architecture. Three different photon encodings are compared for two distinct distillation protocols, and the results demonstrate that for the low-loss regime, the GKP photon encoding yields a higher distillable entanglement compared than both Single Rail and Dual Rail photon encodings, regardless of the distillation protocol. The final part of the thesis investigates the performance of an optimised genetic algorithm that infers the topology of an unknown quantum network. Operating in the framework of continuous-time quantum walks and using an externally attached sink probe, the algorithm can successfully reconstruct network topologies of up to 10 nodes. Moreover, when the number of probe sites is increased, the reconstruction process is significantly simplified, and the algorithm is capable of reliably reconstructing network topologies of up to 14 nodes.
Quantum networks form the bedrock of emerging quantum technologies. By connecting quantum systems through entangled links, they enable remarkable applications such as distributed quantum computing, secure quantum communication, and entanglement-enhanced sensing. This thesis investigates several key challenges in quantum networks, namely resource distribution, percolation, and topology. The first part of the thesis analyses the limitations of entanglement distribution using separable states (EDSS) in the zero-added-loss photon multiplexing (ZALM) architecture. The study determines that EDSS protocols outperform direct entanglement distribution when only the separable carrier is sent through a noisy channel. However, when noise is considered in channels via transmission to the memories, this advantage is lost. The second part of the thesis investigates link-level state generation in a distillable multiplexed quantum repeater architecture. Three different photon encodings are compared for two distinct distillation protocols, and the results demonstrate that for the low-loss regime, the GKP photon encoding yields a higher distillable entanglement compared than both Single Rail and Dual Rail photon encodings, regardless of the distillation protocol. The final part of the thesis investigates the performance of an optimised genetic algorithm that infers the topology of an unknown quantum network. Operating in the framework of continuous-time quantum walks and using an externally attached sink probe, the algorithm can successfully reconstruct network topologies of up to 10 nodes. Moreover, when the number of probe sites is increased, the reconstruction process is significantly simplified, and the algorithm is capable of reliably reconstructing network topologies of up to 14 nodes.
Entanglement distribution is a prerequisite for several important quantum information processing and computing tasks, such as quantum teleportation, quantum key distribution, and distributed quantum computing. In this work, we focus on two-dimensional quantum networks based on optical quantum technologies using dual-rail photonic qubits for the building of a fail-safe quantum internet. We lay out a quantum network architecture for entanglement distribution between distant parties using a Bravais lattice topology, with the technological constraint that quantum repeaters equipped with quantum memories are not easily accessible. We provide a robust protocol for simultaneous entanglement distribution between two distant groups of parties on this network. We also discuss a memory-based quantum network architecture that can be implemented on networks with an arbitrary topology. We examine networks with bow-tie lattice and Archimedean lattice topologies and use percolation theory to quantify the robustness of the networks. In particular, we provide figures of merit on the loss parameter of the optical medium that depend only on the topology of the network and quantify the robustness of the network against intermittent photon loss and intermittent failure of nodes. These figures of merit can be used to compare the robustness of different network topologies in order to determine the best topology in a given real-world scenario, which is critical in the realization of the quantum internet.
Future quantum networks will enable the realisation of a large family of quantum protocols, hence allowing for implementation of various tasks ranging from quantum cryptography through quantum computing to quantum metrology.In this thesis we analyse and develop the building blocks of quantum repeater networks.These networks consist of quantum repeater nodes, which are equipped with quantum memories enabling storage of quantum information.The repeater nodes are connected using optical fibres that enable for the transmission of photonic quantum signals between the repeater nodes.We specifically focus on the two building blocks: remote entanglement generation and entanglement distillation.We then investigate various proof of principle quantum repeater schemes used for generating shared secret key between distant parties.The repeater schemes that we consider utilise one to three memory nodes capable of generating memory-photon entanglement.Finally, we introduce a novel framework for investigating a foundational aspect in the use of quantum communication related to the uncertainty principle.Efficient remote entanglement generation is an indispensable building block of most near-term quantum repeater networks.In this thesis we consider various remote entanglement generation schemes that permit multiplexing, which aims at increasing the throughput of this procedure.We find that for the specific schemes that are suitable for platforms with a single communication qubit and multiple memory qubits, the performance of the multiplexing approach is strongly dependent on the time it takes to perform local operations within the memory nodes.Entanglement distillation enables for filtering out the noise from imperfect entangled states using only local operations and classical communication.Using a general framework for optimising such schemes, which we have developed, we have proven optimality of specific generic and experimentally relevant distillation schemes.We have developed a general framework for optimising such schemes, which we have used to prove optimality of various generic and experimentally relevant distillation schemes.In designing proof of principle quantum repeater schemes we assume an informationtheoretic approach, which enables us to assess their performance in a hardware-agnostic way.We find that all the schemes that we consider can prove useful in specific parameter regimes for the nitrogen-vacancy centre platform.Moreover, we find that one scheme which has already been realised experimentally in the context of remote entanglement generation, is expected to significantly outperform every possible system based on direct communication without repeaters.However, our analysis shows that encapsulating the nitrogen-vacancy centres in optical cavities for the enhancement of the emission rates is a necessary requirement for such a successful demonstration of the first proofof-principle quantum repeater.xi xii SUMMARY Finally, we investigate the quantum uncertainty principle which is a fundamental feature of quantum mechanics, allowing for security in many quantum cryptographic protocols.We find that in a particular scenario, relevant from the perspective of quantum key distribution, a significant part of the observed uncertainty is in fact due to lack of information rather than intrinsic.If the eavesdropper could access that information, she would be able to much better, or in some cases even with certainty, guess the value of the raw bit of the generated key.
Quantum information science is an interdisciplinary field that investigates the principles and applications of quantum mechanics in information processing. Upcoming quantum technologies promise a range of valuable applications, including powerful simulation of complex systems, enhanced computational capabilities, high-precision sensing and metrology, and secure communication via quantum key distribution. A central concept is entanglement, a unique type of correlation between quantum systems that has no classical counterpart. Entanglement plays a pivotal role in many quantum protocols, particularly as a key resource in quantum communication, where protocols such as distributed quantum computation and secret sharing are executed in a distributed setting. Hence, distributing entanglement over long distances and manipulating it locally is essential for enabling quantum communication applications. However, the effectiveness of such applications is limited by the challenges of transmitting quantum information and maintaining precise control over quantum systems. For example, quantum information carriers, such as photons traveling through optical fibers, may be lost, or the operations performed may not be perfect. Consequently, it is crucial to develop robust tools for distributing and manipulating entanglement in distributed settings in order to fully unlock the capabilities of quantum technologies. In this thesis, we explore the influence of noise on the manipulation of entanglement in entanglement-based quantum networks. First, we examine the noise resilience of various resource states, i.e., pre-established entangled states, used to achieve bipartite or tripartite communication. This is followed by an analysis of a fully asymmetric network scenario, incorporating the noise introduced by the delays from classical messaging within the quantum network. We then propose classical communication protocols to achieve bipartite communication and evaluate their noise impact under the optimization of the arrangement of the pre-established entanglement. In addition, we propose an alternative approach to quantum repeaters, a key device for entanglement distribution, based on growing multipartite states, allowing entanglement to be recycled and patched. All investigations have been carried out employing a novel formalism, also developed in this thesis, for efficiently and accurately simulating noisy quantum processes on classical hardware, with broader applicability beyond quantum communication.
The quantum internet enables distribution of quantum states across distant nodes, supporting secure communication, distributed computing, and quantum sensing. Unlike classical networks, it is constrained by the no cloning theorem, probabilistic entanglement generation, decoherence, and hardware drift, making classical abstractions inadequate. Scalable quantum networking therefore requires new architectures, protocols, and optimisation methods that explicitly account for these limitations.
This thesis studies the architecture, routing, and operation of quantum networks under realistic constraints, focusing on bipartite entanglement distribution over quantum repeater networks. Key metrics include end to end fidelity, throughput, scalability, and fairness. At the network layer, routing strategies are developed beyond assumptions of homogeneous nodes and full network knowledge. Routing under heterogeneous repeater efficiencies shows how partial knowledge of node quality improves fidelity and reduces path blocking. A grey box routing approach is then introduced, where path selection relies only on topology and end to end estimates, achieving robustness and fairness without detailed link information.
At the link layer, calibration and hardware drift are addressed through a calibration aware model separating activation and calibration phases. For linear repeater chains, an optimal calibration schedule is derived to balance operation time and calibration overhead. This is extended to general topologies with shared links, where a greedy orchestration heuristic is proposed.
Finally, the thesis connects network protocols with hardware via an instruction set architecture for programmable quantum repeater nodes based on NV centers, enabling coherent programmability and linking physical operations to higher layer protocols.
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.
Developments in the interdisciplinary field of quantum information open up previously impossible abilities in the realms of information processing and communication. Quantum entanglement has emerged as one property of quantum systems that acts as a resource for quantum information processing and, in particular, enables teleportation and secure cryptography. Therefore, the creation of entangled resources is of key importance for the application of these technologies. Despite a great deal of research the efficient creation of entanglement over long distances is limited by inevitable noise. This problem can be overcome by creating entanglement between nodes in a network and then performing operations to distribute the entanglement over a long distance. This thesis contributes to the field of entanglement distribution within such quantum networks. Entanglement distribution has been extensively studied for one-dimensional networks resulting in "quantum repeater" protocols. However, little work has been done on higher dimensional networks. In these networks a fundamentally different scaling, called "long distance entanglement distribution", can appear between the resources and the distance separating the systems to be entangled. I reveal protocols that enable long distance entanglement distribution for quantum networks composed of mixed state and give a few limitations to the capabilities of entanglement distribution. To aid in the implementation of all entanglement distribution protocols I finish by introducing a new system, composed of an optical nanofibre coupled to a carbon nanotube, that may enable new forms of photo-detectors and quantum memories.