Quantum information degrades over distance due to the unavoidable imperfections of the transmission channels, with loss as the leading factor. This simple fact hinders quantum communication, as it relies on propagating quantum systems. A solution to this issue is to introduce quantum repeaters at regular intervals along a lossy channel, to revive the quantum signal. In this work we study unitary one-way quantum repeaters, which do not need to perform measurements and do not require quantum memories, and are therefore considerably simpler than other schemes. We introduce and analyze two methods to construct Hamiltonians that generate a repeater interaction that can beat the fundamental repeaterless key rate bound even in the presence of an additional coupling loss, with signals that contain only a handful of photons. The natural evolution of this work will be to approximate a repeater interaction by combining simple optical elements.
Quantum information degrades over distance due to the unavoidable imperfections of the transmission channels, with loss as the leading factor. This simple fact hinders quantum communication, as it relies on propagating quantum systems. A solution to this issue is to introduce quantum repeaters at regular intervals along a lossy channel, to revive the quantum signal. In this work we study unitary one-way quantum repeaters, which do not need to perform measurements and do not require quantum memories, and are therefore considerably simpler than other schemes. We introduce and analyze two methods to construct Hamiltonians that generate a repeater interaction that can beat the fundamental repeaterless key rate bound even in the presence of an additional coupling loss, with signals that contain only a handful of photons. The natural evolution of this work will be to approximate a repeater interaction by combining simple optical elements.
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 communications promises reliable transmission of quantum information, efficient distribution of entanglement and generation of completely secure keys. For all these tasks, we need to determine the optimal point-to-point rates that are achievable by two remote parties at the ends of a quantum channel, without restrictions on their local operations and classical communication, which can be unlimited and two-way. These two-way assisted capacities represent the ultimate rates that are reachable without quantum repeaters. Here, by constructing an upper bound based on the relative entropy of entanglement and devising a dimension-independent technique dubbed 'teleportation stretching', we establish these capacities for many fundamental channels, namely bosonic lossy channels, quantum-limited amplifiers, dephasing and erasure channels in arbitrary dimension. In particular, we exactly determine the fundamental rate-loss tradeoff affecting any protocol of quantum key distribution. Our findings set the limits of point-to-point quantum communications and provide precise and general benchmarks for quantum repeaters.
Most quantum communication tasks need to rely on the transmission of quantum signals over long distances. Unfortunately, transmission of such signals is most often limited by losses in the channel, the same issue that affects classical communication. Simple signal amplification provides an elegant solution for the classical world, but this is not possible in the quantum world, as the no-cloning theorem forbids such an operation and, thus, an alternative approach, a quantum repeater, is needed. Quantum repeaters enable one to create a known maximally entangled state between the end points of the network by first segmenting the network into pieces, creating entanglement between the segments, and then, connecting those entanglement to create the required long range entanglement. Quantum teleportation then allows an unknown quantum message to be transmitted between them using the long-range entangled state. This form of quantum communication will be at the heart of the future quantum Internet. In this review, we will detail various approaches to quantum repeaters, and discuss their expected performance and limitations.
Quantum repeaters enable long-range quantum communication in the presence of attenuation. Here we propose a method to construct a robust quantum repeater network using only existing technology. We combine the ideas of brokered graph-state construction with double-heralded entanglement generation to form a system that is able to perform all parts of the procedure in a way that is highly tolerant to photon loss and imperfections in detectors. We show that when used in quantum key distribution this leads to secure kilohertz bit rates over intercontinental distances.
Quantum communication can enable new features that are provably impossible with classical communication alone. However, the optical fibers used to send the quantum information are inherently lossy. To overcome the exponential losses over distance so-called quantum repeaters are needed to amplify the signal. As opposed to memory-based approaches, the third generation of quantum repeaters, also called one-way quantum repeaters do not require two-way communication thus enabling very high communication rates. In particular, the one-way quantum repeater based on photonic tree states proposed by Borregaard et al. (2019) realizes this task with a very modest amount of resources. Nevertheless, the method considered is susceptible to operational errors. In this work, we propose the use of code concatenation of a stabilizer code and the tree code, so that by measuring stabilizers of the stabilizer code and applying the syndrome corrections we can achieve a fault-tolerant one-way quantum repeater. In order to do so, we present a detailed protocol that uses the 5-qubit code. Moreover, we develop the first fully general simulation framework for studying the performance of tree-code based one-way quantum repeater chains, which in this thesis is used to perform an analysis of the proposed protocol. We find that the code-concatenation protocol under consideration has a similar tolerance against operational errors to the protocol proposed by Borregaard et al. (2019). Unfortunately, we are not able to draw a distinction between the tolerance of the two approaches. We do however suggest modified protocols that may provide fault tolerance. Studying these is beyond the scope of this thesis.
One of the main problems in quantum communications is how to achieve high rates at long distances. Quantum repeaters, i.e., untrusted, intermediate relay stations, are necessary to overcome the repeaterless bound which sets the fundamental rate-distance limit of repeaterless communications. In this work, we introduce a continuous-variable protocol which overcomes the repeaterless bound and scales like the single-repeater bound using just one linear-optical device called a "quantum scissor", combining the entanglement distillation and entanglement swapping elements of previous repeater proposals into a single step, thus, removing the need for quantum memories. Implementing a standard continuous-variable quantum key distribution protocol using our repeater we predict key rates which surpass the repeaterless bound. Our protocol works well for non-ideal single-photon sources and non-ideal single-photon detectors, and can tolerate some level of excess noise, making our protocol implementable with existing technology. We show that our scheme can be extended to longer repeater chains using quantum memories, using less physical resources than previous schemes. Furthermore, for applications beyond key distribution, our scheme generalises to higher order and distils more entanglement at the cost of a reduced probability of success.