Quantum amplifier channels are at the core of several physical processes. Not only do they model the optical process of spontaneous parametric down-conversion, but the transformation corresponding to an amplifier channel also describes the physics of the dynamical Casimir effect in superconducting circuits, the Unruh effect, and Hawking radiation. Here we study the communication capabilities of quantum amplifier channels. Invoking a recently established minimum output-entropy theorem for single-mode phase-insensitive Gaussian channels, we determine capacities of quantum-limited amplifier channels in three different scenarios. First, we establish the capacities of quantum-limited amplifier channels for one of the most general communication tasks, characterized by the trade-off between classical communication, quantum communication, and entanglement generation or consumption. Second, we establish capacities of quantum-limited amplifier channels for the trade-off between public classical communication, private classical communication, and secret key generation. Third, we determine the capacity region for a broadcast channel induced by the quantum-limited amplifier channel, and we also show that a fully quantum strategy outperforms those achieved by classical coherent-detection strategies. In all three scenarios, we find that the capacities significantly outperform communication rates achieved with a naive time-sharing strategy.
Quantum amplifier channels are at the core of several physical processes. Not only do they model the optical process of spontaneous parametric down-conversion, but the transformation corresponding to an amplifier channel also describes the physics of the dynamical Casimir effect in superconducting circuits, the Unruh effect, and Hawking radiation. Here we study the communication capabilities of quantum amplifier channels. Invoking a recently established minimum output-entropy theorem for single-mode phase-insensitive Gaussian channels, we determine capacities of quantum-limited amplifier channels in three different scenarios. First, we establish the capacities of quantum-limited amplifier channels for one of the most general communication tasks, characterized by the trade-off between classical communication, quantum communication, and entanglement generation or consumption. Second, we establish capacities of quantum-limited amplifier channels for the trade-off between public classical communication, private classical communication, and secret key generation. Third, we determine the capacity region for a broadcast channel induced by the quantum-limited amplifier channel, and we also show that a fully quantum strategy outperforms those achieved by classical coherent-detection strategies. In all three scenarios, we find that the capacities significantly outperform communication rates achieved with a naive time-sharing strategy.
Coding theorems in quantum Shannon theory express the ultimate rates at which a sender can transmit information over a noisy quantum channel. More often than not, the known formulas expressing these transmission rates are intractable, requiring an optimization over an infinite number of uses of the channel. Researchers have rarely found quantum channels with a tractable classical or quantum capacity, but when such a finding occurs, it demonstrates a complete understanding of that channel's capabilities for transmitting classical or quantum information. Here we show that the three-dimensional capacity region for entanglement-assisted transmission of classical and quantum information is tractable for the Hadamard class of channels. Examples of Hadamard channels include generalized dephasing channels, cloning channels, and the Unruh channel. The generalized dephasing channels and the cloning channels are natural processes that occur in quantum systems through the loss of quantum coherence or stimulated emission, respectively. The Unruh channel is a noisy process that occurs in relativistic quantum information theory as a result of the Unruh effect and bears a strong relationship to the cloning channels. We give exact formulas for the entanglement-assisted classical and quantum communication capacity regions of these channels. The coding strategy for each of these examples is superior to a na\"{\i}ve time-sharing strategy, and we introduce a measure to determine this improvement.
The trade-off capacity region of a quantum channel characterizes the optimal net rates at which a sender can communicate classical, quantum, and entangled bits to a receiver by exploiting many independent uses of the channel, along with the help of the same resources. Similarly, one can consider a trade-off capacity region when the noiseless resources are public, private, and secret-key bits. We identified [see Wilde, Hayden, and Guha, Phys. Rev. Lett. 108, 140501 (2012)] these trade-off rate regions for the pure-loss bosonic channel and proved that they are optimal provided that a long-standing minimum-output entropy conjecture is true. Additionally, we showed that the performance gains of a trade-off coding strategy when compared to a time-sharing strategy can be quite significant. In this paper, we provide detailed derivations of the results announced there, and we extend the application of these ideas to thermal-noise and amplifying bosonic channels. We also derive a ``rule of thumb'' for trade-off coding, which determines how to allocate photons in a coding strategy if a large mean photon number is available at the channel input. Our results on the amplifying bosonic channel also apply to the ``Unruh channel'' considered in the context of relativistic quantum information theory.
This paper establishes a general theory of energy-constrained quantum and private capacities of quantum channels. We begin by defining various energy-constrained communication tasks, including quantum communication with a uniform energy constraint, entanglement transmission with an average energy constraint, private communication with a uniform energy constraint, and secret key transmission with an average energy constraint. We develop several code conversions, which allow us to conclude non-trivial relations between the capacities corresponding to the above tasks. We then show how the regularized, energy-constrained coherent information is equal to the capacity for the first two tasks and is an achievable rate for the latter two tasks, whenever the energy observable satisfies the Gibbs condition of having a well-defined thermal state for all temperatures and the channel satisfies a finite output-entropy condition. For degradable channels satisfying these conditions, we find that the single-letter energy-constrained coherent information is equal to all of the capacities. We finally apply our results to degradable quantum Gaussian channels and recover several results already established in the literature (in some cases, we prove new results in this domain). Contrary to what may appear from some statements made in the literature recently, proofs of these results do not require the solution of any kind of minimum output entropy conjecture or entropy photon-number inequality.
We consider quantum and private communications assisted by repeaters, from the basic scenario of a single repeater chain to the general case of an arbitrarily-complex quantum network, where systems may be routed through single or multiple paths. In this context, we investigate the ultimate rates at which two end-parties may transmit quantum information, distribute entanglement, or generate secret keys. These end-to-end capacities are defined by optimizing over the most general adaptive protocols that are allowed by quantum mechanics. Combining techniques from quantum information and classical network theory, we derive single-letter upper bounds for the end-to-end capacities in repeater chains and quantum networks connected by arbitrary quantum channels, establishing exact formulas under basic decoherence models, including bosonic lossy channels, quantum-limited amplifiers, dephasing and erasure channels. For the converse part, we adopt a teleportation-inspired simulation of a quantum network which leads to upper bounds in terms of the relative entropy of entanglement. For the lower bounds we combine point-to-point quantum protocols with classical network algorithms. Depending on the type of routing (single or multiple), optimal strategies corresponds to finding the widest path or the maximum flow in the quantum network. Our theory can also be extended to simultaneous quantum communication between multiple senders and receivers.
We prove that quantum thermal Gaussian input states minimize the output entropy of the multi-mode quantum Gaussian attenuators and amplifiers that are entanglement breaking and of the multi-mode quantum Gaussian phase contravariant channels among all the input states with an given entropy. This is the first time that this property is proven for a multi-mode channel without restrictions on the input states. A striking consequence of this result is a new lower bound on the output entropy of all the multi-mode quantum Gaussian attenuators and amplifiers in terms of the input entropy. We apply this bound to determine new upper bounds to the communication rates in two different scenarios. The first is classical communication to two receivers with the quantum degraded Gaussian broadcast channel. The second is the simultaneous classical communication, quantum communication and entanglement generation or the simultaneous public classical communication, private classical communication, and quantum key distribution with the Gaussian quantum-limited attenuator.
In this thesis we study the information transmission through Gaussian quantum channels. Gaussian quantum channels model physical communication links, such as free space communication or optical fibers and therefore, may be considered as the most relevant quantum channels. One of the central characteristics of any communication channel is its capacity. In this work we are interested in the classical capacity, which is the maximal number of bits that can be reliably transmitted per channel use. An important lower bound on the classical capacity is given by the Gaussian capacity, which is the maximal transmission rate with the restriction that only Gaussian encodings are allowed: input messages are encoded in so-called Gaussian states for which the mean field amplitudes are Gaussian distributed. We focus in this work mainly on the Gaussian capacity for the following reasons. First, Gaussian encodings are easily accessible experimentally. Second, the difficulty of studying the classical capacity, which arises due to an optimization problem in an infinite dimensional Hilbert space, is greatly reduced when considering only Gaussian input encodings. Third, the Gaussian capacity is conjectured to coincide with the classical capacity, even though this longstanding conjecture is unsolved until today. We start with the investigation of the capacities of the single-mode Gaussian channel. We show that the most general case can be reduced to a simple, fiducial Gaussian channel which depends only on three parameters: its transmissivity (or gain), the added noise variance and the squeezing of the noise. Above a certain input energy threshold, the optimal input variances are given by a quantum water-filling solution, which implies that the optimal modulated output state is a thermal state. This is a quantum extension (or generalization) of the well-known classical water-filling solution for parallel Gaussian channels. Below the energy threshold the solution is given by a transcendental equation and only the less noisy quadrature is modulated. We characterize in detail the dependence of the Gaussian capacity on its channel parameters. In particular, we show that the Gaussian capacity is a non-monotonous function of the noise squeezing and analytically specify the regions where it exhibits one maximum, a maximum and a minimum, a saddle point or no extrema. Then, we investigate the case of n-mode channels with noise correlations (i.e. memory), where we focus in particular on the classical additive noise channel. We consider memory models for which the noise correlations can be unraveled by a passive symplectic transformation. Therefore, we can simplify the problem to the study of the Gaussian capacity in an uncorrelated basis, which corresponds to the Gaussian capacity of n single-mode channels with a common input energy constraint. Above an input energy threshold the solutions is given by a global quantum water-filling solution, which implies that all modulated single-mode output states are thermal states with the same temperature. Below the threshold the channels are divided into three sets: i) those that are excluded from information transmission, ii) those for which only the less noisy quadrature is modulated, and iii) those for which the quantum water-filling solution is satisfied. As an example we consider a Gauss-Markov correlated noise, which in the uncorrelated basis corresponds to a collection of single-mode classical additive noise channels. When rotating the collection of optimal single-mode input states back to the original, correlated basis the optimal multi-mode input state becomes a highly entangled state. We then compare the performance of the optimal input state with a simple coherent state encoding and conclude that one gains up to 10% by using the optimal encoding. Since the preparation of the optimal input state may be very challenging we consider sub-optimal Gaussian-matrix product states (GMPS) as input states as well. GMPS have a known experimental setup and, though being heavily entangled, can be generated sequentially. We demonstrate that for the Markovian correlated noise as well as for a non-Markovian noise model in a wide range of channel parameters, a nearest-neighbor correlated GMPS achieves more than 99.9% of the Gaussian capacity. At last, we introduce a new noise model for which the GMPS is the exact optimal input state. Since GMPS are known to be ground states of quadratic Hamiltonians this suggests a starting point to develop links between optimization problems of quantum communication and many body physics.