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.
We review recent results on the simulation of quantum channels, the reduction of adaptive protocols (teleportation stretching), and the derivation of converse bounds for quantum and private communication, as established in PLOB [Pirandola, Laurenza, Ottaviani, Banchi, arXiv:1510.08863]. We start by introducing a general weak converse bound for private communication based on the relative entropy of entanglement. We discuss how combining this bound with channel simulation and teleportation stretching, PLOB established the two-way quantum and private capacities of several fundamental channels, including the bosonic lossy channel. We then provide a rigorous proof of the strong converse property of these bounds by adopting a correct use of the Braunstein-Kimble teleportation protocol for the simulation of bosonic Gaussian channels. This analysis provides a full justification of claims presented in the follow-up paper WTB [Wilde, Tomamichel, Berta, arXiv:1602.08898] whose upper bounds for Gaussian channels would be otherwise infinitely large. Besides clarifying contributions in the area of channel simulation and protocol reduction, we also present some generalizations of the tools to other entanglement measures and novel results on the maximum excess noise which is tolerable in quantum key distribution.
What is the ultimate performance for discriminating two arbitrary quantum channels acting on a finite-dimensional Hilbert space? Here we address this basic question by deriving a general and fundamental lower bound. More precisely, we investigate the symmetric discrimination of two arbitrary qudit channels by means of the most general protocols based on adaptive (feedbackassisted) quantum operations. In this general scenario, we first show how port-based teleportation can be used to simplify these adaptive protocols into a much simpler non-adaptive form, designing a new type of teleportation stretching. Then, we prove that the minimum error probability affecting the channel discrimination cannot beat a bound determined by the Choi matrices of the channels, establishing a general, yet computable formula for quantum hypothesis testing. As a consequence of this bound, we derive ultimate limits and no-go theorems for adaptive quantum illumination and single-photon quantum optical resolution. Finally, we show how the methodology can also be applied to other tasks, such as quantum metrology, quantum communication and secret key generation.
We investigate the maximum rates for transmitting quantum information, distilling entanglement and distributing secret keys between a sender and a receiver in a multipoint communication scenario, with the assistance of unlimited two-way classical communication involving all parties. First we consider the case where a sender communicates with an arbitrary number of receivers, so called quantum broadcast channel. Here we also provide a simple analysis in the bosonic setting where we consider quantum broadcasting through a sequence of beamsplitters. Then, we consider the opposite case where an arbitrary number of senders communicate with a single receiver, so called quantum multiple-access channel. Finally, we study the general case of all-in-all quantum communication where an arbitrary number of senders communicate with an arbitrary number of receivers. Since our bounds are formulated for quantum systems of arbitrary dimension, they can be applied to many different physical scenarios involving multipoint quantum communication.
One of the main open problems in quantum communication is the design of efficient quantum-secured networks. This is a challenging goal, because it requires protocols that guarantee both unconditional security and high communication rates, while increasing the number of users. In this scenario, continuous-variable systems provide an ideal platform where high rates can be achieved by using off-the-shelf optical components. At the same time, the measurement-device independent architecture is also appealing for its feature of removing a substantial portion of practical weaknesses. Driven by these ideas, here we introduce a modular design of continuous-variable network where each individual module is a measurement-device-independent star network. In each module, the users send modulated coherent states to an untrusted relay, creating multipartite secret correlations via a generalized Bell detection. Using one-time pad between different modules, the network users may share a quantum-secure conference key over arbitrary distances at constant rate.
In this review we discuss how channel simulation can be used to simplify the most general protocols of quantum parameter estimation, where unlimited entanglement and adaptive joint operations may be employed. Whenever the unknown parameter encoded in a quantum channel is completely transferred in an environmental program state simulating the channel, the optimal adaptive estimation cannot beat the standard quantum limit. In this setting, we elucidate the crucial role of quantum teleportation as a primitive operation which allows one to completely reduce adaptive protocols over suitable teleportation-covariant channels and derive matching upper and lower bounds for parameter estimation. For these channels, we may express the quantum Cramér Rao bound directly in terms of their Choi matrices. Our review considers both discrete-and continuous-variable systems, also presenting some new results for bosonic Gaussian channels using an alternative sub-optimal simulation. It is an open problem to design simulations for quantum channels that achieve the Heisenberg limit.
We show how adaptive protocols of quantum and private communication through bosonic Gaussian channels can be simplifed into much easier block versions that involve resource states with finite energy. This is achieved by combining an adaptive-to-block reduction technique devised earlier, based on teleportation stretching and relative entropy of entanglement, with a recent finite-resource simulation of Gaussian channels. In this way, we derive weak converse upper bounds for the secret-key capacity of phase-insensitive Gaussian channels which approximate the optimal limit for infinite energy. Our results apply to both point-to-point and repeater-assisted private communications.
We consider the secret key capacity of the thermal loss channel, which is modeled by a beam splitter mixing an input signal mode with an environmental thermal mode. This capacity is the maximum value of secret bits that two remote parties can generate by means of the most general adaptive protocols assisted by unlimited and two-way classical communication. To date, only upper and lower bounds are known. The present work improves the lower bound by resorting to Gaussian protocols based on suitable trusted-noise detectors.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
334 Leonard St
Brooklyn, NY 11211
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.