Abstract The ability to reliably distribute entanglement among the nodes of a network is an essential requirement for the development of effective quantum communication protocols and the realization of useful quantum networks. It has been demonstrated, in different contexts, that two remote systems can be entangled via local interactions with a carrier system that always remains in a separable state with respect to such distant particles. We develop a strategy for entanglement distribution via separable carriers that can be applied to any number of network nodes to achieve various entanglement distribution patterns. We show that our protocol results in multipartite entanglement, while the carrier mediating the process is always in a separable state with respect to the network. We provide examples showcasing the flexibility of our approach and propose a scheme of principle for the experimental demonstration of the protocol.
Abstract The ability to reliably distribute entanglement among the nodes of a network is an essential requirement for the development of effective quantum communication protocols and the realization of useful quantum networks. It has been demonstrated, in different contexts, that two remote systems can be entangled via local interactions with a carrier system that always remains in a separable state with respect to such distant particles. We develop a strategy for entanglement distribution via separable carriers that can be applied to any number of network nodes to achieve various entanglement distribution patterns. We show that our protocol results in multipartite entanglement, while the carrier mediating the process is always in a separable state with respect to the network. We provide examples showcasing the flexibility of our approach and propose a scheme of principle for the experimental demonstration of the protocol.
Entanglement distribution among the nodes of a quantum network is possible without having to send any entanglement. We extend this phenomenon to a multipartite setting, using one separable carrier to entangle multiple qubits. It is shown that postselective measurements on the carrier at the end of the protocol can be used to enhance the entanglement produced. We consider the impact of sending the carrier through noisy channels. An experimental proposal is put forward to demonstrate how this could be realised using photons.
The main focus of this thesis is quantum entanglement and, more specifically, pro- tocols that allow its distribution between distant places. In the last decades, with the rise of attention on quantum technologies, entangle- ment is mostly seen as a resource, that could be exchanged, measured, and ideally stored and used when convenient. However, entanglement is not as stable and cheap as the classical resources. One reason for this is that entanglement between two quantum systems is easily disrupted by the interaction with the environment that surrounds them. The presence of noise is even more significant when we wish to entangle two systems that are very far away, a task that is essential for quantum communication technologies. In this case, what can disrupt the entanglement is not only the noise that the particles experience locally, but also the noise in the quantum channel during the communication process, which can be significant over long distances. For this reason, it is important to design distribution protocols that work well in such conditions. In 2003, Cubitt et al. showed the existence of a very curious class of protocols, often called entanglement distribution with separable states (EDSS). They proved that a non-entangled (separable) carrier can be used to increase, or even gener- ate entanglement between two already distant parties. From this, some questions arise. First, what limits or allows an entanglement distribution protocol, if not the entanglement that is sent. Quantum discord was shown to be a necessary, but not sufficient, resource for entanglement distribution. Another natural question is whether these protocols can beat others, for technological purposes, especially in noisy conditions. I will describe some work I have done in an attempt to partially 9 address both of these questions. After introducing various tools and concepts that are useful to understand this topic (chapter 1) and motivate the necessity of entanglement distribution in quantum communication (chapter 2), I will describe a proof-of-principle experiment demon- strating EDSS schemes (chapter 3). Later (chapter 4), I will introduce a more general classification of distribution protocols (excessive or non-excessive protocols), based on whether the entanglement gain is larger than the one that is communicated, describing specific examples and general properties of such protocols. I will then partially address the problem regarding the robustness to the noise of communica- tion protocols (chapter 5). Finally, in chapter 6, I will describe how entanglement of a bipartite state can grow with a quantum measurement with unknown results. I discuss the properties of the measurement and of the initial state that make this process effective.
Scaling the number of entangled nodes in a quantum network is a challenge with significant implications for quantum computing, clock synchronisation, secure communications, and quantum sensing. In a quantum network, photons interact with matter qubits at different nodes, flexibly enabling the creation of remote entanglement between them. Multipartite entanglement among multiple nodes will be crucial for many proposed quantum network applications, including quantum computational tasks and quantum metrology. To date, experimental efforts have primarily focused on generating bipartite entanglement between nodes, which is widely regarded as the fundamental quantum resource for quantum networks. However, relying exclusively on bipartite entanglement to form more complex multipartite entanglement introduces several challenges. These include the need for ancillary qubits, extensive local entangling operations which increases the preparation latency, and increasingly stringent requirements on coherence times as the number of nodes grows. Here, we analyse various schemes that achieve multipartite entanglement between nodes in a single step, bypassing the need for multiple rounds of bipartite entanglement. We demonstrate that different schemes can produce distinct multipartite entangled states, with varying fidelity and generation rates. Additionally, we discuss the applicability of these schemes across different experimental platforms, highlighting their primary advantages and disadvantages.
Quantum networks create a completely new way for communication, and the most important function of a quantum network is to generate long-distance quantum entanglement to serve a number of quantum applications. As the scale of the network expands, in order to establish end-to-end entanglement between two remote nodes, entangled pairs need to be generated and distributed among multiple repeaters along the path from the source to the destination, which requires a specific protocol to negotiate resource allocations and quantum operations among the repeaters. Thus, to realize such remote entanglement distribution in a quantum network, designing a stable and reliable protocol becomes urgent and necessary. In this article, we focus on how to guarantee the generation rate of entangled pairs between any two quantum nodes to meet the requirements of various quantum applications in a large-scale quantum network. We present a connection-oriented entanglement distribution protocol inspired by the connection-oriented communication model in classical networks. Our protocol is located in the network layer of the quantum network to enable end-to-end quantum communication. Three main features are provided by the proposed protocol: 1) it is reliable and can guarantee the successful entanglement generation; 2) it can reduce the influence of quantum decoherence via reducing the latency caused by resource competition; and 3) it can guarantee the rate of generating entanglement between two quantum nodes according to the requirement of quantum applications.
Quantum network is a promising platform for numerous quantum applications, including distributed quantum computing, secure communication, and improved sensing. Implementing entanglement distribution between remote quantum nodes plays a vital role in realizing the quantum network's capabilities, and it requires effective remote entanglement distribution protocols. To meet this requirement, we propose two strategies, namely connection-oriented and connectionless, to achieve end-to-end entanglement distribution inspired by the designs of classical communication. For the connection-oriented strategy, an exclusive quantum connection is pre-established between the source and destination nodes. For the connectionless strategy, entanglement swapping is performed hop-by-hop tentatively. In this way, the best-effort service is provided for the source node to establish long-distance entanglement with the destination node. Analogous to classical communication, the proposed strategies have their advantages and disadvantages. Our simulation results show that the connectionless strategy is more efficient and robust than the connection-oriented strategy in terms of throughput. However, the connection-oriented strategy provides reliable end-to-end entanglement distribution but at the expense of higher overhead. Moreover, the application scenarios of these two strategies are discussed. This work paves the road for designing end-to-end entanglement distribution protocols in quantum networks.
Quantum entanglement plays a central role in many quantum communication protocols. It allows distant particles to share correlations beyond the limits of classical interactions. Entanglement is essential for superdense coding, quantum teleportation, and secure cryptographic key distribution in quantum communication. It is also a pillar for developing quantum networks, where the management and distribution of entanglement are crucial for connecting distant nodes. Although perfect entanglement is a sought-after ideal, experimental imperatives, including entanglement distribution over long distances, often limit the quality of entangled states. An important question is whether weaker entanglement still offers advantages. First, we study more general tasks than dense coding to show that simpler measurements, combined with entanglement, allow advantageous and sometimes even optimal qubit communication protocols to be obtained. We also demonstrate that simple measurements can generate quantum correlations that cannot be modelled by two classical communication bits and can constitute an optimal protocol with quantum resources. We implement a novel Bell-type inequality tailored for certifying full network non-locality (FNN) to develop certification methods guaranteeing security on an entanglement-based network. Our experiment uses two pairs of polarised entangled photons in a network configuration with three nodes, briefly referred to as a bilocal network scenario. Finally, we show that weakly entangled states can improve communication over a qubit channel using only separate (local) measurements on isotropic non-steerable two-qubit states, without interference, of individual photons, across two communication tasks: secret sharing and its stochastic variant.