This thesis assesses the theoretical performance of a realistic multi-node quantum repeater that is implementable with current technology. A quantum repeater, by definition, allows for communication rates in a channel to be larger than what is fundamentally possible over a loss only channel. We consider a simple, one-way, multi-node quantum repeater that utilizes entanglement swapping in the absence of any quantum error correction or entanglement purification. We create a theoretical model of the quantum repeater, incorporating the imperfections of each component within the system, to get an accurate key rate using current, viable state-of-the-art experimental parameters. Our main goal is to benchmark the performance of this specific multi-node quantum repeater. We compare the performance of this multi-node system to that of a single node repeater, which has been previously analysed for this architecture. We are interested to see if there is an advantage for introducing more nodes in this type of system. We also provide some suggestions for improving the key rate performance.
This thesis assesses the theoretical performance of a realistic multi-node quantum repeater that is implementable with current technology. A quantum repeater, by definition, allows for communication rates in a channel to be larger than what is fundamentally possible over a loss only channel. We consider a simple, one-way, multi-node quantum repeater that utilizes entanglement swapping in the absence of any quantum error correction or entanglement purification. We create a theoretical model of the quantum repeater, incorporating the imperfections of each component within the system, to get an accurate key rate using current, viable state-of-the-art experimental parameters. Our main goal is to benchmark the performance of this specific multi-node quantum repeater. We compare the performance of this multi-node system to that of a single node repeater, which has been previously analysed for this architecture. We are interested to see if there is an advantage for introducing more nodes in this type of system. We also provide some suggestions for improving the key rate performance.
This thesis is an exploration of quantum repeaters from a practical point of view. Quantum repeaters are devices which help improve the quantum communication capacity of a lossy bosonic channel (which include photonic channels such as optical fiber) beyond what is possible using a purely lossy channel. The analyses in this thesis involve modeling the experimental imperfections inherent in the various devices which comprise a quantum repeater, then combining these models to calculate various quantities of interest. \n \nTwo systems are analyzed in this thesis. One is a simple quantum repeater, while the other is a potential building block for more complex quantum repeaters. \n \nThe simple quantum repeater scheme can be implemented with currently available technology. In it, two parties perform quantum key distribution (QKD) by exchanging photons with two quantum memories placed between them. Its secret key rate ideally scales as the square root of the transmittivity of the optical channel, which is superior to QKD schemes based on direct transmission because key rates for the latter scale at best linearly with transmittivity. Taking into account imperfections in the setup, such as detector efficiency and dark counts, we present parameter regimes in which our protocol outperforms protocols based on direct transmission. We find that implementing our scheme with trapped ions is a promising way to reach the necessary parameter regimes, and that the regimes are easier to reach if the optical channels are very lossy. \n \nThe creation of entanglement between two quantum memories is an important building block in some quantum repeater schemes. We consider a specific quantum memory consisting of an atom trapped in a cavity. The system allows a CNOT operation to be performed between an atom and a photon. We study three methods for taking advantage of this to entangle two atoms: (1) interacting a coherent pulse with each atom, then performing an entangling measurement on the pulses; (2) interacting a single coherent pulse with each atom sequentially; (3) emitting an entangled photon from one atom and interacting it with the other atom. The success probability of each method is compared, as well as the quality of the entangled states produced by each one, taking into account imperfections which appear in a specific experimental implementation of such memories. We find that there is a tradeoff between success probability and entangled state quality when coherent states are used, and that method 3 provides higher-quality entangled states than is possible with the other two methods.
Quantum key distribution allows for the generation of a secret key between distant parties connected by a quantum channel such as optical fibre or free space. Unfortunately, the rate of generation of a secret key by direct transmission is fundamentally limited by the distance. This limit can be overcome by the implementation of so-called quantum repeaters. Here, we assess the performance of a specific but very natural setup called a single sequential repeater for quantum key distribution. We offer a fine-grained assessment of the repeater by introducing a series of benchmarks. The benchmarks, which should be surpassed to claim a working repeater, are based on finite-energy considerations, thermal noise and the losses in the setup. In order to boost the performance of the studied repeaters we introduce two methods. The first one corresponds to the concept of a cut-off, which reduces the effect of decoherence during storage of a quantum state by introducing a maximum storage time. Secondly, we supplement the standard classical post-processing with an advantage distillation procedure. Using these methods, we find realistic parameters for which it is possible to achieve rates greater than each of the benchmarks, guiding the way towards implementing quantum repeaters.
Quantum key distribution allows for the generation of a secret key between distant parties connected by a quantum channel such as optical fibre or free space. Unfortunately, the rate of generation of a secret key by direct transmission is fundamentally limited by the distance. This limit can be overcome by the implementation of so-called quantum repeaters. Here, we assess the performance of a specific but very natural setup called a single sequential repeater for quantum key distribution. We offer a fine-grained assessment of the repeater by introducing a series of benchmarks. The benchmarks, which should be surpassed to claim a working repeater, are based on finite-energy considerations, thermal noise and the losses in the setup. In order to boost the performance of the studied repeaters we introduce two methods. The first one corresponds to the concept of a cut-off, which reduces the effect of decoherence during the storage of a quantum state by introducing a maximum storage time. Secondly, we supplement the standard classical post-processing with an advantage distillation procedure. Using these methods, we find realistic parameters for which it is possible to achieve rates greater than each of the benchmarks, guiding the way towards implementing quantum repeaters.
The derivation of ultimate limits to communication over certain quantum repeater networks have provided extremely valuable benchmarks for assessing near-term quantum communication protocols. However, these bounds are usually derived in the limit of ideal devices and leave questions about the performance of practical implementations unanswered. To address this challenge, we quantify how the presence of loss in repeater stations affect the maximum attainable rates for quantum communication over linear repeater chains and more complex quantum networks. Extending the framework of node splitting, we model the loss introduced at the repeater stations and then prove the corresponding limits. In the linear chain scenario we show that, by increasing the number of repeater stations, the maximum rate cannot overcome a quantity, which solely depends on the loss of a single station. We introduce a way of adapting the standard machinery for obtaining bounds to this realistic scenario. The difference is that whilst ultimate limits for any strategy can be derived given a fixed channel, when the repeaters introduce additional decoherence, then the effective overall channel is itself a function of the chosen repeater strategy (e.g., one-way versus two-way classical communication). Classes of repeater strategies can be analysed using additional modeling and the subsequent bounds can be interpreted as the optimal rate within that class.
Abstract Quantum key distribution allows for the generation of a secret key between distant parties connected by a quantum channel such as optical fibre or free space. Unfortunately, the rate of generation of a secret key by direct transmission is fundamentally limited by the distance. This limit can be overcome by the implementation of so-called quantum repeaters. Here, we assess the performance of a specific but very natural setup called a single sequential repeater for quantum key distribution. We offer a fine-grained assessment of the repeater by introducing a series of benchmarks . The benchmarks, which should be surpassed to claim a working repeater, are based on finite-energy considerations, thermal noise and the losses in the setup. In order to boost the performance of the studied repeaters we introduce two methods. The first one corresponds to the concept of a cut-off , which reduces the effect of decoherence during the storage of a quantum state by introducing a maximum storage time. Secondly, we supplement the standard classical post-processing with an advantage distillation procedure. Using these methods, we find realistic parameters for which it is possible to achieve rates greater than each of the benchmarks, guiding the way towards implementing quantum repeaters.
When built, quantum repeater networks will require classical network protocols to control the quantum operations. However, existing work on repeaters has focused on the quantum operations themselves, with less attention paid to the contents, semantics, ordering and reliability of the classical control messages. In this work we define and describe our implementation of the classical control protocols. The state machines and packet sequences for the three protocol layers are presented, and operation confirmed by running the protocols over simulations of the physical network. We also show that proper management of the resources in a bottleneck link allows the aggregate throughput of two end-to-end flows to substantially exceed that of a single flow. Our layered architectural framework will support independent evolution of the separate protocol layers. Networks of quantum repeaters utilize three concepts to execute a distributed algorithm that creates entangled quantum states between nodes that are far apart: a basic entanglement mechanism which depends on the physical implementation, error management (in this work, we study a method known as purification), and finally a quantum state propagation layer (here we implement entanglement swapping, which builds multi-hop connections from single-hop connections). Some researchers are investigating approaches that are substantially different from entanglement swapping [30, 24, 19]. Here we focus on swapping, but the layered architecture approach is broadly applicable, allowing other implementations to replace only a single layer in the protocol stack. Previous work primarily focused on the physical and mathematical tools for building repeaters. Classical information is also needed to enable teleportation and swapping, as many quantum operations are not deterministic, and results of quantum measurements need to be reported to distant partners before further operations can proceed. Also, operations in the middle of the network must be coordinated to route and swap properly. This requires classical messages to make operations robust, but message propagation times penalize performance. Even though this delay is usually included in repeater simulations, prior work has not defined the protocols in detail, especially with respect to how all of the nodes make consistent decisions in a timely fashion. In this work, we introduce a protocol stack for networks of quantum repeaters that considers all the necessary classical messages and which can be easily adapted for different approaches at all three protocol layers. We run simulations of competing flows on a dumbbell topology in order to increase our confidence in the behavior of our network protocols. By adjusting the fidelity thresholds required for entanglement swapping, we show that some configurations boost the aggregate throughput for multiple flows significantly above the maximum for a single flow, taking advantage of resources that would otherwise sit idle. The operation of such complex networks and such delicate tuning of the system without formal protocol definitions would not be possible. Previous work has also concentrated almost exclusively on the dedicated use of a single line or chain of repeaters, delivering Bell pairs only to the two nodes at the ends of the chain. Networks, however, typically have more than two end points, and allow any pair of these end nodes to communicate. More topologically complex networks, with numerous end nodes, are obviously much more scalable than connecting every possible pair of nodes using a dedicated line of repeaters. we investigate how classical multiplexing schemes translate to the domain of quantum repeaters, in order to manage shared resources and active communication flows of data from different stations. We simulate four sharing protocols in a complex network with competing traffic. Circuit switching gives any individual flow the best performance, but makes poor use of the overall network and is inflexible. We use circuit switching as our baseline case to compare time division multiplexing, buffer space multiplexing, and statistical multiplexing, and show that all multiplexing schemes are better than circuit switching. For the particular network simulated, we find that statistical multiplexing outperforms time division multiplexing by 28% and buffer space multiplexing by 13%. We find that all three multiplexing schemes are fair; each flow is penalized a similar percentage of its throughput as the the total number of users in the network increases. Finally, statistical multiplexing requires no network-wide coordination of the use of quantum memory or channels, and is easier to implement than a robust, scalable scheme for the other protocols. Our current results suggest that the best strategy for quantum repeater networks is statistical multiplexing. (This is in fact the quantum analogue of the basis on which the Internet works.) However, our current simulations are done with no degradation of memory over time, using the assumption of quantum error-corrected memory at each repeater; inclusion of decoherence and a finite qubit lifetime remains as future work.