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.
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.
Abstract In quantum mechanics, a fundamental law prevents quantum communications to simultaneously achieve high rates and long distances. This limitation is well known for point-to-point protocols, where two parties are directly connected by a quantum channel, but not yet fully understood in protocols with quantum repeaters. Here we solve this problem bounding the ultimate rates for transmitting quantum information, entanglement and secret keys via quantum repeaters. We derive single-letter upper bounds for the end-to-end capacities achievable by the most general (adaptive) protocols of quantum and private communication, from a single repeater chain to an arbitrarily complex quantum network, where systems may be routed through single or multiple paths. We analytically establish these capacities under fundamental noise models, including bosonic loss which is the most important for optical communications. In this way, our results provide the ultimate benchmarks for testing the optimal performance of repeater-assisted quantum communications.
In quantum mechanics, a fundamental law prevents quantum communications to simultaneously achieve high rates and long distances. This limitation is well known for point-to-point protocols, where two parties are directly connected by a quantum channel, but not yet fully understood in protocols with quantum repeaters. Here we solve this problem bounding the ultimate rates for transmitting quantum information, entanglement and secret keys via quantum repeaters. We derive single-letter upper bounds for the end-to-end capacities achievable by the most general (adaptive) protocols of quantum and private communication, from a single repeater chain to an arbitrarily complex quantum network, where systems may be routed through single or multiple paths. We analytically establish these capacities under fundamental noise models, including bosonic loss which is the most important for optical communications. In this way, our results provide the ultimate benchmarks for testing the optimal performance of repeater-assisted quantum communications.
The field of quantum communications promises the faithful distribution of quantum information, quantum entanglement, and absolutely secret keys. However, the highest rates of these tasks are fundamentally limited by the transmission distances. Quantum repeaters are necessary to overcome the repeaterless bound which sets the fundamental rate-distance limit of any repeaterless quantum communication protocol. The ultimate end-to-end rates of quantum repeater networks are known to be achievable by an optimal entanglement-distillation protocol followed by quantum teleportation. In this thesis, we give physical repeater designs for this achievability. We also propose practical repeater designs with near-term potential for real-world practical applications.
Abstract The optimal performance of a communication network is limited not only by the quality of point-to-point channels, but by the efficacy of its constituent technologies. Understanding the limits of quantum networks requires an understanding of both the ultimate capacities of quantum channels and the efficiency of imperfect quantum repeaters. In this work, using a recently developed node-splitting technique which introduces internal losses and noise into repeater devices, we present achievable end-to-end rates for noisy-repeater quantum networks. These are obtained by extending the coherent and reverse coherent information (single channel capacity lower bounds) into end-to-end capacity lower bounds, both in the context of single-path and multi-path routing. These achievable rates are completely general, and apply to networks composed of arbitrary channels arranged in general topologies. Through this general formalism, we show how tight upper-bounds can also be derived by supplementing appropriate single-edge capacity bounds. As a result, we develop tools which provide tight performance bounds for quantum networks constituent of channels whose capacities are not exactly known, and reveal critical network properties which are necessary for high-rate quantum communications. This permits the investigation of pertinent classes of quantum networks with realistic technologies; qubit amplitude damping networks and bosonic thermal-loss networks.
Characterizing the ultimate rates of entanglement distribution is essential for both foundational research and the practical deployment of quantum technologies. To investigate these limits, we introduce an erasure-Pauli channel model describing the distribution of polarization entanglement in optical fiber. For this channel, we derive bounds on the rates of entanglement distribution and related quantum resources under optimal local operations and two-way classical communication (two-way assisted capacities). This framework allows us to determine the optimal repeaterless performance achievable over realistic optical fibers affected by polarization mode dispersion, thereby providing a rigorous benchmark for long-distance polarization-based quantum communication. Finally, we show that both our model and capacity bounds remain robust under the inclusion of detector dark counts.
Quantum communications enable secure key transmission and entanglement distribution, but their rates and maximum transmission distances are limited due to the losses and noise introduced by quantum channels. Various techniques have been developed to address these limitations, tailored to the platform and the nature of the decoherence. In this thesis, we explore ways to enhance the performance of quantum communications, with a particular focus on increasing the key rates and transmission distances in quantum key distribution (QKD), a method that leverages quantum mechanics to securely share keys between trusted parties. Additionally, we aim to improve the purity of entangled states shared between two parties, contributing to broader advancements in quantum communications. We begin by introducing a software-enhanced continuous-variable QKD (CV-QKD) protocol, where keys are encoded onto the phase and amplitude degrees of the optical field. This protocol enhances both transmission distance and key rates through a post-selection method employing arbitrary filters, experimentally demonstrated on two different platforms. Its adaptability makes it highly promising, as it can be implemented on existing CV-QKD platforms and dynamically optimises key rates for rapidly changing channels. We then present a protocol for the pure-loss channel leveraging quantum repeaters to mitigate the channel losses by segmenting the total communication distance into smaller, more manageable intervals. This repeater-like protocol introduces a more efficient entanglement-swapping measurement at the repeater station than the state-of-the-art twin-field protocols. Instead of polarisation encoding, our protocol relies on encoding keys in the photon-number basis, optimising the states to achieve the highest key rates for each distance. Notably, this protocol shows strong potential for improving long-distance quantum communication by surpassing the capacity of the direct communication channel at a shorter distance than the existing repeater protocols such as twin-field QKD while achieving an overall higher transmission distance. Finally, in this thesis, we demonstrate that for the Pauli-dephasing channel, placing a node in the middle of the quantum channel to perform a Bell-state measurement as an entanglement-swapping operation does not result in improved key rates, even with reduced decoherence. As a result, we propose an entanglement purification protocol that refines a larger set of noisy entangled states into a smaller set of high-fidelity ones using local operations and classical communication. This purification protocol builds upon earlier purification methods, extending their application from two Bell pairs to any number of Bell pairs and thereby achieving the capacity of the dephasing channel. Through numerous recursive iterations, it produces near-perfect Bell pairs, making it well-suited for quantum repeaters and correcting dephasing errors in quantum computers.