This chapter introduces a few of the many proposed and experimental approaches, while minimizing the need to understand complex physics. It focuses on a qualitative understanding of the physical process, including what factors limit the probability of success and the fidelity represented in the output density matrix. The chapter reviews the common characteristics of the operations that affect link protocol design and ultimately network design. Quantum states of light can be created by transferring a qubit held in a stationary device to light pulse or directly using physical mechanisms that reliably emit one photon or a pair of photons interpreted as qubits. The chapter looks at decoherence in the computational basis for a single qubit, then studies the more complex case of a Bell pair, written in the Bell basis. An important mid-term milestone is demonstration of the entanglement of the photonic pulse and the stationary memory.
This chapter introduces a few of the many proposed and experimental approaches, while minimizing the need to understand complex physics. It focuses on a qualitative understanding of the physical process, including what factors limit the probability of success and the fidelity represented in the output density matrix. The chapter reviews the common characteristics of the operations that affect link protocol design and ultimately network design. Quantum states of light can be created by transferring a qubit held in a stationary device to light pulse or directly using physical mechanisms that reliably emit one photon or a pair of photons interpreted as qubits. The chapter looks at decoherence in the computational basis for a single qubit, then studies the more complex case of a Bell pair, written in the Bell basis. An important mid-term milestone is demonstration of the entanglement of the photonic pulse and the stationary memory.
In order to understand the operation and importance of quantum networks, one must learn about the general principles upon which quantum computers are founded. This chapter reviews the basic concepts needed to understand quantum computing and communication, with emphasis on manipulating qubits and grasping the key idea of entanglement through the example of Bell pairs. It begins with quantum mechanics, presenting Dirac's ket notation, with a few notes on linear algebra, then states Schrödinger's equation and Hamiltonian dynamics as a fact. It then informally defines a qubit, discusses its state-vector, and Bloch sphere representations and corresponding manipulations. Two-qubit gates are explained, along with the three-qubit Toffoli and Fredkin gates. The chapter covers Bell pairs, their experimental demonstration and the no-cloning theorem. When system decoherence sets in, measurement of the system probably will not produce the desired results, causing the failure of our quantum algorithm.
This chapter presents the basic concepts necessary to use photons as physical implementations of qubits. It starts with a traditional field quantization approach in the optical domain, where it puts an emphasis on how to obtain field modes which can be used as single localizable qubits. After quickly touching on several ways of generating single photon states, it moves to more technical aspects of parametric down conversion, which up to now has been the workhorse for most of the demonstration experiments involving two or a few more qubits in entangled states of high purity. The reader should be able to understand most aspects of contemporary sources of this type. The chapter then finishes by touching upon a few qubit operations with photons, exploring the high temporal correlation of down converted photon pairs, which also allow for at least a partial Bell state analysis.
Quantum networks intersect a paradigmatic shift in communication technologies, offering unprecedented capabilities for secure communication and distributed computation through the exploitation of quantum mechanical phenomena.These networks facilitate revolutionary and unlimited of possibility applications such as quantum key distribution (QKD), distributed quantum computing (DQC), quantum teleportation (QT), quantum clock synchronization (QCS), etc. -all fundamentally predicated on quantum entanglement as their operational cornerstone.Moreover, on the contrary with classical computer communication protocol, quantum networks have the fundamental no-cloning theorem in the quantum mechanic prohibits conventional signal amplification techniques, necessitating the development of quantum-native routing strategies that operate within these unique constraints.However, the practical realization of quantum networks until now still faces a crucial challenge: The reliability and efficient distribution of highfidelity entangled quantum states across long distances.Due to this distribution, the process faces intrinsic limitations arising from quantum decoherence, photonic loss in transmission channels, and the inherently probabilistic nature of entanglement generation protocols.In quantum communication, fidelity serves as a fundamental metric, representing the degree of similarity or correlation between the actual distributed entangled state and an ideal maximally entangled Bell pair.Fidelity is a crucial measure of the quality of quantum states in a network since it directly affects the reliability and effectiveness of quantum communication protocols.High fidelity ensures that the transmitted entangled states maintain their quantum properties, closely resembling the ideal Bell pair, and are thus suitable for performing secure and efficient quantum operations.Latency, on the other hand, refers to the total time delay involved in the entire process of entanglement establishment, from the initial creation of the entangled pairs to the final verification and confirmation of the entanglement quality.This includes several distinct components: the physical propagation delay, which accounts for the time it takes for quantum information to travel through the communication channel (such as optical fibers); the entanglement generation time, which involves the probabilistic creation of entangled states between quantum nodes; and the quantum memory storage time, which reflects the duration for which quantum states I
This paper is a tutorial-style introduction to methods and protocols for reliable transmission of quantum information over noisy quantum links. The exposition is based on a design philosophy that parallels classical link-layer mechanisms such as forward error correction and Automatic Repeat reQuest (ARQ). It starts by drawing analogies and highlights differences between classical and quantum links. Such analogies are used as guiding principles, with explicit attention to where the classical correspondence no longer applies and where non-classical constraints and resources govern the protocol design. The emphasis is on the fact that classical reliability is achieved through fungible and cloneable bits, whereas unknown quantum states cannot be copied or freely retransmitted. In addition, quantum information is subject to stringent physical constraints due to decoherence as well as the need for transduction between stationary and flying qubits. Quantum error correction is presented as the analogue of classical forward error correction, where logical qubits are protected by encoding them into larger entangled code spaces and using syndrome measurements to infer and correct errors without collapsing the encoded state. It then introduces teleportation-based link abstractions, in which transmission of an unknown qubit is realized by consuming shared Bell pairs together with classical messages. Entanglement purification protocols play a role similar to ARQ-style reliability enhancement by converting many noisy entangled pairs into fewer, higher-fidelity pairs at the cost of additional resources. The paper is written from the perspective of classical communication engineering and is intended as a guide for translating the relevant ideas toward reliable quantum links and networks.
This chapter discusses current progress in building up a quantum internet intended to enable the transmission of quantum bits (qubits) between distant quantum devices to achieve the tasks that are impossible using classical communication. Like the classical internet, a quantum internet consists of network components like physical communication links, and eventually routers. The chapter utilizes the mathematical tools from classical routing theory for computing the latency of the routing algorithms for single source–destination pairs. It presents some numerical simulations for illustration of the performance in the case of multiple source–destination pairs. The chapter focuses on entanglement pre-sharing and routing models in more general graphs. It also presents a protocol stack model for breaking down the complexity of entanglement-based quantum networks. The focus is on the structures and architectures of quantum networks. The aim of the network is to generate arbitrary graph states between its clients on demand.
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.