Teleportation simulation of bosonic Gaussian channels: strong and uniform convergence★
Computer Science and York Centre for Quantum Technologies, University of York,
York YO10 5GH, UK
a e-mail: firstname.lastname@example.org
Published online: 25 September 2018
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.
© The Author(s) 2018. This article is published with open access at Springerlink.com
This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.