Showing papers by "Stefano Pirandola published in 2017"

Fundamental limits of repeaterless quantum communications.

Abstract: 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.

General bounds for sender-receiver capacities in multipoint quantum communications

Abstract: 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, a 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, a 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.

Ultimate Precision of Adaptive Noise Estimation

Abstract: We consider the estimation of noise parameters in a quantum channel, assuming the most general strategy allowed by quantum mechanics. This is based on the exploitation of unlimited entanglement and arbitrary quantum operations, so that the channel inputs may be interactively updated. In this general scenario, we draw a novel connection between quantum metrology and teleportation. In fact, for any teleportation-covariant channel (e.g., Pauli, erasure, or Gaussian channel), we find that adaptive noise estimation cannot beat the standard quantum limit, with the quantum Fisher information being determined by the channel's Choi matrix. As an example, we establish the ultimate precision for estimating excess noise in a thermal-loss channel, which is crucial for quantum cryptography. Because our general methodology applies to any functional that is monotonic under trace-preserving maps, it can be applied to simplify other adaptive protocols, including those for quantum channel discrimination. Setting the ultimate limits for noise estimation and discrimination paves the way for exploring the boundaries of quantum sensing, imaging, and tomography.

On a recent comment on: "Theory of channel simulation and bounds for private communication"

Abstract: We clarify how a recent comment [Wilde, arXiv:1712.00145v1] to the review paper [Pirandola et al., arXiv:1711.09909v1] does not mitigate but further confirms the divergence problem in the derivations of the strong converse bound for the secret key capacity of the phase-insensitive Gaussian channels as presented in [WTB, arXiv:1602.08898v1]. These derivations were done without bounding the energy of the input alphabet and without controlling the error of the channel simulation, so that the application of the Braunstein-Kimble protocol inevitably leads to unbounded results. Here we briefly confirm why this is the case, and also discuss how basic misinterpretations of the previous literature have led this author to this technical error.

Finite-size analysis of measurement-device-independent quantum cryptography with continuous variables

Abstract: We study the impact of finite-size effects on the key rate of continuous-variable (CV) measurement-device-independent (MDI) quantum key distribution (QKD), considering two-mode Gaussian attacks. Inspired by the parameter estimation technique developed in by Ruppert et al. [Phys. Rev. A 90, 062310 (2014)], we adapt it to study CV-MDI-QKD and, assuming realistic experimental conditions, we analyze the impact of finite-size effects on the key rate. We find that the performance of the protocol approaches the ideal one, increasing the block size, and, most importantly, that blocks between ${10}^{6}$ and ${10}^{9}$ data points may provide key rates $\ensuremath{\sim}{10}^{\ensuremath{-}2}$ bit/use over metropolitan distances.

Simulation of non-Pauli channels

Abstract: We consider the simulation of a quantum channel by two parties who share a resource state and may apply local operations assisted by classical communication (LOCC). One specific type of such LOCC is standard teleportation, which is however limited to the simulation of Pauli channels. Here we show how we can easily enlarge this class by means of a minimal perturbation of the teleportation protocol, where we introduce noise in the classical communication channel between the remote parties. By adopting this noisy protocol, we provide a necessary condition for simulating a non-Pauli channel. In particular, we characterize the set of channels that are generated assuming the Choi matrix of an amplitude damping channel as a resource state. Within this set, we identify a class of Pauli-damping channels for which we bound the two-way quantum and private capacities.

Modular network for high-rate quantum conferencing

Abstract: 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.

Channel Simulation in Quantum Metrology

Abstract: 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 Cramer 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.

Gaussian two-mode attacks in one-way quantum cryptography

Abstract: We investigate the asymptotic security of one-way continuous variable quantum key distribution against Gaussian two-mode coherent attacks. The one-way protocol is implemented by arranging the channel uses in two-mode blocks. By applying symmetric random permutations over these blocks, the security analysis is in fact reduced to study two-mode coherent attacks and, in particular, Gaussian ones, due to the extremality of Gaussian states. We explicitly show that the use of two-mode Gaussian correlations by an eavesdropper leads to asymptotic secret key rates which are strictly larger than the rate obtained under standard single-mode Gaussian attacks.

Adaptive estimation and discrimination of Holevo-Werner channels

Abstract: The class of quantum states known as Werner states have several interesting properties, which often serve to illuminate unusual properties of quantum information. Closely related to these states are the Holevo-Werner channels whose Choi matrices are Werner states. Exploiting the fact that these channels are teleportation covariant, and therefore simulable by teleportation, we compute the ultimate precision in the adaptive estimation of their channel-defining parameter. Similarly, we bound the minimum error probability affecting the adaptive discrimination of any two of these channels. In this case, we prove an analytical formula for the quantum Chernoff bound which also has a direct counterpart for the class of depolarizing channels. Our work exploits previous methods established in [Pirandola and Lupo, PRL 118, 100502 (2017)] to set the metrological limits associated with this interesting class of quantum channels at any finite dimension.

Theory of channel simulation and bounds for private communication

Abstract: 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.

Rebuttal of recent comments on: "Theory of channel simulation and bounds for private communication"

Abstract: We consider the Braunstein-Kimble protocol for continuous variable teleportation and its application for the simulation of bosonic channels. We discuss the convergence properties of this protocol under various topologies (strong, uniform, and bounded-uniform) clarifying some typical misinterpretations in the literature. We then show that the teleportation simulation of an arbitrary single-mode Gaussian channel is uniformly convergent to the channel if and only if its noise matrix has full rank. The various forms of convergence are then discussed within adaptive protocols, where the simulation error must be propagated to the output of the protocol by means of a "peeling" argument, following techniques from PLOB [arXiv:1510.08863]. Finally, as an application of the peeling argument and the various topologies of convergence, we provide complete rigorous proofs for recently-claimed strong converse bounds for private communication over Gaussian channels.

Erratum: Ultimate Precision of Adaptive Noise Estimation [Phys. Rev. Lett. 118, 100502 (2017)].

Abstract: This corrects the article DOI: 10.1103/PhysRevLett.118.100502.

Super-additivity and entanglement assistance in quantum reading

Abstract: Quantum information theory determines the maximum rates at which information can be transmitted through physical systems described by quantum mechanics. Here we consider the communication protocol known as quantum reading. Quantum reading is a protocol for retrieving the information stored in a digital memory by using a quantum probe, e.g., shining quantum states of light to read an optical memory. In a variety of situations using a quantum probe enhances the performance of the reading protocol in terms of fidelity, data density and energy efficiency. Here we review and characterize the quantum reading capacity of a memory model, defined as the maximum rate of reliable reading. We show that, like other quantities in quantum information theory, the quantum reading capacity is super-additive. Moreover, we determine conditions under which the use of an entangled ancilla improves the performance of quantum reading.

Teleportation simulation of bosonic Gaussian channels: Strong and uniform convergence

Abstract: We consider the Braunstein-Kimble protocol for continuous variable teleportation and its application for the simulation of bosonic channels. We discuss the convergence properties of this protocol under various topologies (strong, uniform, and bounded-uniform) clarifying some typical misinterpretations in the literature. We then show that the teleportation simulation of an arbitrary single-mode Gaussian channel is uniformly convergent to the channel if and only if its noise matrix has full rank. The various forms of convergence are then discussed within adaptive protocols, where the simulation error must be propagated to the output of the protocol by means of a "peeling" argument, following techniques from PLOB [arXiv:1510.08863]. Finally, as an application of the peeling argument and the various topologies of convergence, we provide complete rigorous proofs for recently-claimed strong converse bounds for private communication over Gaussian channels.

Finite-resource teleportation stretching for continuous-variable systems

Abstract: We show how adaptive protocols of quantum and private communication through bosonic Gaussian channels can be simplified into much easier block versions that involve resource states with finite energy. This is achieved by combining the adaptive-to-block reduction technique devised earlier [S. Pirandola et al., Nat. Commun. 8, 15043 (2017)], based on teleportation stretching and relative entropy of entanglement, with an alternative simulation of Gaussian channels recently introduced by Liuzzo-Scorpo et al. [Phys. Rev. Lett. 119, 120503 (2017)]. 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.

Discord, Quantum Knowledge and Private Communications

Abstract: In this brief review, we discuss the role that quantum correlations, as quantified by quantum discord, play in two interesting settings. The first one is discerning which unitaries have been applied on a quantum system, by taking advantage of knowledge regarding its initial configuration. Here discord captures the ‘quantum’ component of this knowledge, useful only when we have access to a quantum memory. In particular, discord can be used to detect whether an untrusted party has certain quantum capabilities. The second setting is quantum cryptography. Here discord represents an important resource for trusted-noise quantum key distribution and also provides a general upper bound for the optimal secret key rates that are achievable by ideal protocols. In particular, the (two-way assisted) secret key capacity of a lossy bosonic channel exactly coincides with the maximum discord that can be distributed between the remote parties at the two ends of the channel.

High-rate quantum conferencing and secret sharing

Abstract: We introduce a measurement-device independent star network which is conveniently based on continuous variable systems and standard linear optics. Here an arbitrary number of users send modulated coherent states to an untrusted relay where a generalized Bell detection creates multi-partite secret correlations. These correlations are then distilled into a shared secret key to implement a completely-secure quantum conference or, alternatively, a protocol of quantum secret-sharing. Our scheme is composably secure and able to achieve high rates with cheap optical implementation.

Composable Security of Measurement-Device-Independent Continuous-Variable Quantum Key Distribution against Coherent Attacks

Abstract: We present for the first time a composable security proof for Continuous-Variable Measurement-Device-Independent Quantum Key Distribution (CV MDI QKD). We first prove the security against collective Gaussian attacks by applying a new bound on the conditional smooth min-entropy. Then we extend our proof to the most general class of coherent attacks via the Gaussian De Finetti reduction. Our results show that it is possible to achieve a nonzero secret key rate against the most general class of coherent attacks for block size of the order of 10^6-10^9. Therefore, our results show that a field demonstration of CV MDI QKD is feasible with currently available technologies.