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 [S. Pirandola et al., Nat. Comm. 8, 15043 (2017)]. 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.
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 [S. Pirandola et al., Nat. Comm. 8, 15043 (2017)]. 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.
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.
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 et al 2017 Nat. Commun. 8 15043). 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 et al 2017 IEEE Trans. Inf. Theory 63 1792–817) 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.
In the literature on the continuous-variable bosonic teleportation protocol due to Braunstein and Kimble [Phys. Rev. Lett. 80, 869 (1998)], it is often loosely stated that this protocol converges to a perfect teleportation of an input state in the limit of ideal squeezing and ideal detection, but the exact form of this convergence is typically not clarified. In this paper, I explicitly clarify that the convergence is in the strong sense, and not the uniform sense, and furthermore that the convergence occurs for any input state to the protocol, including the infinite-energy Basel states defined and discussed here. I also prove, in contrast to the above result, that the teleportation simulations of pure-loss, thermal, pure-amplifier, amplifier, and additive-noise channels converge both strongly and uniformly to the original channels, in the limit of ideal squeezing and detection for the simulations. For these channels, I give explicit uniform bounds on the accuracy of their teleportation simulations. I then extend these uniform convergence results to particular multimode bosonic Gaussian channels. These convergence statements have important implications for mathematical proofs that make use of the teleportation simulation of bosonic Gaussian channels, some of which have to do with bounding their nonasymptotic secret-key-agreement capacities. As a by-product of the discussion given here, I confirm the correctness of the proof of such bounds from my joint work with Berta and Tomamichel from [Wilde, Tomamichel, and Berta, IEEE Trans. Inf. Theory 63, 1792 (2017)]. Furthermore, I show that it is not necessary to invoke the energy-constrained diamond distance in order to confirm the correctness of this proof.
We consider private communication over bosonic Gaussian channels via the most general adaptive protocols based on local operations and two-way classical communication. These protocols include all the possible strategies allowed by quantum mechanics where two remote parties have local quantum computers but do not share prior quantum entanglement. In this context, Pirandola-Laurenza-Ottaviani-Banchi (PLOB) [Nat. Commun. 8, 15043 (2017)] established weak converse upper bounds for the secret key capacity of these channels. These bounds were computed by combining teleportation stretching, able to simplify any adaptive protocol into a block form, and the channel’s relative entropy of entanglement, so that data-processing properties allow one to write simple single-letter quantities. Here we discuss an extension of these bounds to repeater-assisted quantum communications. Then, using an energy-constrained version of the diamond norm and the Braunstein-Kimble teleportation protocol, we can rigorously show the strong converse property of the bounds discovered by PLOB. Our analysis provides a full mathematical justification of recent claims appeared in the literature.
Abstract We study the Kimble–Braunstein continuous-variable quantum teleportation with the quantum channel physically realized in the turbulent atmosphere. In this context, we examine the applicability of different strategies preserving the Gaussian entanglement (Bohmann et al 2016 Phys. Rev. A 94 010302(R)) for improving the fidelity of the coherent-state teleportation. First, we demonstrate that increasing the squeezing parameter characterizing the entangled state is restricted by its optimal value, which we derive for realistic experimentally-verified examples. Further, we consider the technique of adaptive correlations of losses and show its performance for channels with large squeezing parameters. Finally, we investigate the efficiencies of postselection strategies in dependence on the stochastic properties of the channel transmittance.
We investigate quantum teleportation of ensembles of coherent states of light with a Gaussian distributed displacement in phase space. Recently, the following general question has been addressed in [P. Liuzzo-Scorpo et al., arXiv:1705.03017]: Given a limited amount of entanglement and mean energy available as resources, what is the maximal fidelity that can be achieved on average in the teleportation of such an alphabet of states? Here, we consider a variation of this question, where Einstein–Podolsky–Rosen steering is used as a resource rather than plain entanglement. We provide a solution by means of an optimisation within the space of Gaussian quantum channels, which allows for an intuitive visualisation of the problem. We first show that not all channels are accessible with a finite degree of steering, and then prove that practical schemes relying on asymmetric two-mode Gaussian states enable one to reach the maximal fidelity at the border with the inaccessible region. Our results provide a rigorous quantitative assessment of steering as a resource for secure quantum teleportation beyond the so-called no-cloning threshold. The schemes we propose can be readily implemented experimentally by a conventional Braunstein–Kimble continuous variable teleportation protocol involving homodyne detections and corrective displacements with an optimally tuned gain. These protocols can be integrated as elementary building blocks in quantum networks, for reliable storage and transmission of quantum optical states.