Abstract A quantum version of an internet, called a quantum internet, holds promise for achieving distributed quantum sensing and large-scale quantum computer networks, as well as quantum communication among arbitrary clients all over the globe. The main building block is efficient distribution of entanglement—entangled bits (ebits)—between arbitrary clients in a quantum network with error bounded by a constant, irrespective of their distance. In practice, this should be accomplished across multiple self-organising quantum networks, analogously to what the current internet does in conventional communication. Here we present a practical recipe on how to efficiently give arbitrary clients ebits with error bounded by a constant, regardless of their distance, across multiple quantum networks. This recipe is composed of two new concepts, minimum cost aggregation and network concatenation. Our recipe forms the necessary basis of designing a quantum internet protocol for networking self-organising quantum networks to make a global-scale quantum internet.
Abstract A quantum version of an internet, called a quantum internet, holds promise for achieving distributed quantum sensing and large-scale quantum computer networks, as well as quantum communication among arbitrary clients all over the globe. The main building block is efficient distribution of entanglement—entangled bits (ebits)—between arbitrary clients in a quantum network with error bounded by a constant, irrespective of their distance. In practice, this should be accomplished across multiple self-organising quantum networks, analogously to what the current internet does in conventional communication. Here we present a practical recipe on how to efficiently give arbitrary clients ebits with error bounded by a constant, regardless of their distance, across multiple quantum networks. This recipe is composed of two new concepts, minimum cost aggregation and network concatenation. Our recipe forms the necessary basis of designing a quantum internet protocol for networking self-organising quantum networks to make a global-scale quantum internet.
A quantum internet holds promise for achieving distributed quantum sensing and large-scale quantum computer networks, as well as quantum communication among arbitrary clients all over the globe. The main building block is efficient distribution of entanglement, entangled bits (ebits), between clients with fixed error, irrespective of their distance. In practice, this should be accomplished across multiple quantum networks, analogously to what the current Internet does in conventional communication. However, existing quantum repeater schemes for efficient distribution of ebits over long distances work only on linear networks. Besides, there was no prescription on how to choose such linear networks from quantum networks with arbitrary topology. Here we present a practical recipe on how to aggregate quantum networks with arbitrary topology in order to give clients ebits with fixed error efficiently, regardless of their distance. This recipe is based on combination of two new concepts of minimum cost aggregation and network concatenation. Our recipe forms the basis of designing a quantum internet protocol for networking self-organizing quantum networks to make a global-scale quantum internet.
The quantum internet holds promise for accomplishing quantum teleportation and unconditionally secure communication freely between arbitrary clients all over the globe, as well as the simulation of quantum many-body systems. For such a quantum internet protocol, a general fundamental upper bound on the obtainable entanglement or secret key has been derived [K. Azuma, A. Mizutani, and H.-K. Lo, Nat. Commun. 7, 13523 (2016)]. Here we consider its converse problem. In particular, we present a universal protocol constructible from any given quantum network, which is based on running quantum repeater schemes in parallel over the network. For arbitrary lossy optical channel networks, our protocol has no scaling gap with the upper bound, even based on existing quantum repeater schemes. In an asymptotic limit, our protocol works as an optimal entanglement or secret-key distribution over any quantum network composed of practical channels such as erasure channels, dephasing channels, bosonic quantum amplifier channels, and lossy optical channels.
Quantum networks play a pivotal role in quantum information science, which not only provide a secure communication platform for remote access to quantum computers but also serve as the strategic core for achieving large-scale quantum information processing, forming the foundational infrastructure for the future global-scale quantum internet. Quantum teleportation, which enables the transmission of unknown quantum states over long distances by employing quantum entanglement together with classical communication, is essential for the distribution of quantum resources in the construction of the global-scale quantum internet. To realize a global-scale quantum internet, quantum repeater protocols represent one of the most promising approaches for enabling quantum communication between any nodes. This concise review presents representative experimental demonstrations of quantum teleportation for constructing quantum networks across different physical platforms. Along this trajectory, the review discusses current challenges, open issues, and future perspectives toward scalable and practical quantum internet.
The quantum internet is one of the frontiers of quantum information science. It will revolutionize the way we communicate and do other tasks, and it will allow for tasks that are not possible using the current, classical internet. The backbone of a quantum internet is entanglement distributed globally in order to allow for such novel applications to be performed over long distances. Experimental progress is currently being made to realize quantum networks on a small scale, but much theoretical work is still needed in order to understand how best to distribute entanglement and to guide the realization of large-scale quantum networks, and eventually the quantum internet, especially with the limitations of near-term quantum technologies. This work provides an initial step towards this goal. The main contribution of this thesis is a mathematical framework for entanglement distribution protocols in a quantum network, which allows for discovering optimal protocols using reinforcement learning. We start with a general development of quantum decision processes, which is the theoretical backdrop of reinforcement learning. Then, we define the general task of entanglement distribution in a quantum network, and we present ground- and satellite-based quantum network architectures that incorporate practical aspects of entanglement distribution. We combine the theory of decision processes and the practical quantum network architectures into an overall entanglement distribution protocol. We also define practical figures of merit to evaluate entanglement distribution protocols, which help to guide experimental implementations.
Quantum mechanics shows that if one is able to generate and manipulate entanglement over a distance, one is able to perform certain tasks which are impossible using only classical communication. Classical communication refers to what is used in the Internet of today. A quantum internet would therefore bring new capabilities to our highly connected world. These capabilities both involve (1) the ability to perform tasks with are provably impossible in the current Internet, such as unconditionally secure communication, and (2) the ability to perform certain tasks much more efficient, such as distributed (quantum) computing or extending the baseline of telescopes. To be able to build a quantum internet, two main components are needed: (i) hardware that can store, manipulate and entangle qubits and (ii) a software stack to control the hardware. The core task of both of these is to generate entanglement to be used by applications. In this thesis we focus on the latter, i.e. the development of software and protocols that enable entanglement generation using capable hardware. To enable a certain application, one can certainly, in theory, manually specify each operation the hardware should perform, involving micro-wave pulses, lasers etc. However, in practice this is not feasible, if not to say impossible, due to the complexity of the operations needed, especially in a distributed system such as a quantum network. What is needed is a software stack, which can help with abstracting complexity away in multiple layers. This allows for someone to program a protocol in one layer without knowing all the details of the lower layers. In particular, one can abstract away the hardware details, in order to make higher-layer protocols and applications hardware-agnostic. Therefore, to be able to build a universal, efficient and scalable quantum internet, a software stack is crucial. In chapter 2 we start discussing the networking part of a software stack. Namely, we introduce a network stack for a quantum internet, drawing parallels to the IP/TCP-suite of the classical Internet. We continue with proposing a service and interface of the lowest layer of the network stack: the link layer. The link layer is here responsible for generating entanglement between nodes in a quantum network which are directly connected by a quantum link, i.e. a fiber cable. When developing a protocol or application it is very useful to be able to run it. Both to see if the intended ideas make sense and also to check that the implementation is actually correct. Currently we do not have quantum hardware that exposes a full-fledge API that can be used to execute applications. For this reason, it is very useful to be able to instead simulate the hardware in a way that exposes the same API as the hardware being developed. In chapter 3 we introduce SimulaQron for this exact purpose. Any application of a quantum internet will need entanglement in one way or another. However, entanglement is generally hard to generate and is usually the bottleneck when executing an application. We would therefore like to make use of the generated entanglement in the most optimal way. To be able to do this we need to understand how entanglement can be transformed and distributed in a quantum network. We study the entanglement of a particular class of states called graph states in chapters 4 to 9 and how these states can be transformed in a quantum network.