Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Information-theoretic aspects of optical communications

Ligong Wang

Published Jan 1, 2011• 2 citations
Publisher

Abstract

This dissertation studies several information-theoretic aspects of optical communications.The first aspect it studies is the one-shot classical capacity of a quantum communication channel.It proves new upper and lower bounds on the amount of classical information that can be transmitted through a single use of a quantum channel, under a constraint on the average error probability.The bounds are expressed using a quantity defined via quantum hypothesis testing.Combined with the Quantum Stein's Lemma, these bounds provide a conceptually simple proof for the Holevo-Schumacher-Westmoreland Theorem for the classical capacity of a memoryless quantum channel.Further, they also give a general capacity formula that is valid for any, not necessarily memoryless, quantum channel.The second topic studied in this dissertation is the capacity of a continuous-time peak-limited Poisson channel with spurious counts in the output.It is shown that, if the positions of the spurious counts are known noncausally to the encoder but not to the decoder, then the capacity of this channel equals the capacity of the same channel but with no spurious counts, regardless of whether the spurious counts are random or are chosen by a malicious adversary.On the other hand, if the positions of the spurious counts are known only causally to the encoder but not to the decoder, then such information does not help to increase the capacity of this channel.Next, a rate-distortion problem for point processes is considered.In this problem, an encoder sees a point pattern on the interval [0, T ] and v vi Abstract describes it to a reconstructor using bits.Based on this description, the reconstructor produces a subset of [0, T ] of Lebesgue measure not exceeding DT for some D > 0 to cover all the points in the pattern.It is shown that, if the point pattern is the outcome of a homogeneous Poisson process of intensity λ, then, as T tends to infinity, the minimum number of bits per second needed for the encoder to describe the pattern is -λ log D. Further, any point pattern containing no more than λ points per second can be successfully described in this sense using -λ log D bits per second.A Wyner-Ziv version of this problem is also studied where some points in the pattern are known to the reconstructor.The last problem considered in this dissertation is the asymptotic capacity at low input powers of a discrete-time Poisson channel under average-power or average-and peak-power constraints.For a Poisson channel whose dark current is zero or decays to zero linearly with the allowed average input power E, capacity is shown to scale like E log 1E as E tends to zero.For a Poisson channel whose dark current is a nonzero constant, capacity is shown to scale, to within a constant, like E log log 1 E .

DOI
10.3929/ethz-a-006543410

Related papers

The Information-carrying capacity of certain quantum channels

Ciara Morgan

In this thesis we analyse the type of states and ensembles which achieve the capacity for certain quantum channels carrying classical information. We first concentrate on the product-state capacity of a particular quantum channel, that is, the capacity which is achieved by encoding the output states from a source into codewords comprised of states taken from ensembles of non-entangled states and sending them over copies of the quantum channel. Using the "single-letter" formula proved independently by Holevo and by Schumacher and Westmoreland we obtain the product-state capacity of the qubit quantum amplitude-damping channel, which is determined by a transcendental equation in a single real variable and can be solved numerically. We demonstrate that the product-state capacity of this channel can be achieved using a minimal ensemble of non-orthogonal pure states. Next we consider the classical capacity of two quantum channels with memory, namely a periodic channel with quantum depolarising channel branches and a convex combination of quantum channels. We prove that the classical capacity for each of the classical memory channels mentioned above is, in fact, equal to the respective product-state capacities. For those channels this means that the classical capacity is achieved without the use of entangled input-states. Next we introduce the channel coding theorem for memoryless quantum channels, providing a known proof by Winter for the strong converse of the theorem. We then consider the strong converse to the channel coding theorem for a periodic quantum channel.

arXiv:1007.2723•Irish Mathematical Society Bulletin•Jan 1, 2010•1 citation

Selected topics in information theoretic security and compression

Amine Laourine

The problems studied in this thesis fall within two different topics in network information theory. The first part of this dissertation will be about information theoretic security and the second about distributed source coding. In the following a brief description of these problems will be given. In information theoretic security, we look at two different types of timing channels and we quantify the maximum rate at which a transmitter can communicate information reliably to a legitimate receiver while keeping an eavesdropper in the dark. The first timing channel that we study is the Poisson channel which is used to model certain direct detection optical communication systems. To transmit a message on this channel, the transmitter encodes information by modulating the intensity of an optical signal while the legitimate receiver and the eavesdropper use the arrival moments of the individual photons to decide which message was transmitted. The second timing channel studied is the exponential server queue. Here the transmitter encodes a message using a chosen sequence of packets inter-arrival times and both the legitimate receiver and the eavesdropper use the corresponding inter-departures from their respective exponential server queues to decode the transmitted message. In distributed source coding, we consider a rate-distortion problem in which a decoder is interested in estimating two correlated Gaussian random variables with mean-square error distortion constraints on each of the reproductions. The variables to be estimated are the roots of a given Gauss-Markov tree and each encoder observes one of the leaves of that tree. We show that a simple compression architecture that performs separate lossy quantization followed by SlepianWolf binning is sum-rate optimal for this problem.

•May 27, 2012•0 citations

Classical Capacity of Single-Mode Bosonic Gaussian Channels

Gerardo Adesso, Ludovico Lami, Vittorio Giovannetti

The classical capacity of a noisy optical channel is the maximum rate at which information can be transmitted reliably, given a constraint on the mean input energy. For the ubiquitous bosonic Gaussian channels, which include standard models of loss and noise in fibre and free-space optical links, determining this rate requires addressing whether entanglement between channel uses or non-Gaussian signals can outperform Gaussian encodings. More precisely, the question is whether the energy-constrained Holevo information is additive across arbitrarily many channel uses and coincides with its Gaussian counterpart. We answer these fundamental questions in the affirmative for every single-mode bosonic Gaussian channel at every input energy. Namely, we prove that independently prepared Gaussian states with Gaussian-distributed random displacements achieve the capacity, including in the low-energy regime where squeezing the signals competes with encoding information in their displacement. Our proof connects an entanglement inequality to a sharp, additive lower bound on output entropy. We then characterise communication above capacity: under a strict total photon-number cutoff, the probability of correct decoding decreases exponentially with the number of channel uses, and we derive explicit bounds on the decay exponent. When only the mean photon number is constrained, a simple energy-rescaling formula determines exactly the entire asymptotic rate--error trade-off: the capacity at mean photon number $N$ and allowed average decoding error $ε$ equals the vanishing-error capacity at mean photon number $N/(1-ε)$. Together, these results identify the ultimate limits of classical communication for some of the most fundamental models of optical communication.

quant-pharXiv:2610.22308•Oct 16, 2026•1 citation

Extracting classical information from quantum states : fundamental limits, adaptive and finite-length measurements

Hye Won Chung

Motivated by the increasing demand for more powerful and efficient optical communication systems, quantum mechanics of information processing has become the key element in determining the fundamental limits of physical channels, and in designing quantum communication systems that approach those fundamental limits. To achieve higher data rates over quantum optical channels, we need to efficiently extract classical information from quantum states. However, peculiar properties of quantum states, such as the no-cloning theorem and the non-reversible measurement process, provide new challenges in the measurement of quantum states; in quantum information science, there is no concept analogous to sufficient statistics in classical information science. Therefore, to extract as much information as possible from quantum states, it is important to choose the right measurement process. In this thesis, we investigate the fundamental question of how to design the measurement process to efficiently extract information from quantum states. First, we consider adaptive measurement, with which we measure each received quantum state one at a time, and then update the next measurement process based on the previous observations. We show that for binary hypothesis testing between two ideal laser light pulses, if we update the adaptive measurement to maximize the communication efficiency at each instant, based on recursively updated knowledge of the receiver, then we can achieve the theoretical lower bound of the detection error probability. Using this viewpoint, we give a natural generalization of the adaptive measurement to general Mary hypothesis testing problems. We also analyze the information capacity with adaptive measurement, and compare the result with that for direct detection receivers and the ultimate capacity of quantum channels (the Holevo limit). We also investigate finite-blocklength joint receivers. The ultimate capacity of quantum channels is calculated under the assumption that an infinite number of quantum states can be collectively measured in one shot. However, this assumption becomes the primary barrier that prevents practical implementations of capacity-achieving joint detection receivers. The maximum number of classical information bits extracted per use of the quantum channel strictly increases with the number of channel outputs jointly measured at the receiver. This phenomenon is called strict superadditivity, and it has been thought of as a unique property that can be observed only in quantum channels, but not in classical discrete memoryless channels (DMCs). In this thesis, we introduce a new aspect of understanding strict superadditivity by comparing the performance of concatenated coding over quantum channels and classical DMCs, for a fixed inner code length. We show that the strict superadditivity in information rate occurs due to a loss of information from hard-decisions at the finite blocklength. We also find a lower bound on the maximum achievable information rate as a function of the length of the quantum measurement. The analysis and new insights into the measurement process of quantum states that we develop in this thesis can be used to improve not only current quantum optical communication systems, but also classical information processing, where the data is too big to be handled with sufficient statistics. Our work would help develop new concepts of efficient statistics that provide systematic ways to choose useful information among big data while discarding the rest.

•Jan 1, 2014•0 citations

INFORMATION TRANSMISSION THROUGH BOSONIC GAUSSIAN QUANTUM CHANNELS

Joachim Schäfer, Nicolas J. Cerf

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.

•Jan 1, 2013•2 citations

Semidefinite optimization for quantum information

Xin Wang

This thesis aims to improve our understanding of the structure of quantum entanglement and the limits of information processing with quantum systems. It presents new results relevant to three threads of quantum information: the theory of quantum entanglement, the communication capabilities of quantum channels, and the quantum zero-error information theory. \nIn the first part, we investigate the fundamental features of quantum entanglement and develop quantitative approaches to better exploit the power of entanglement. First, we introduce a computable and additive entanglement measure to quantify the amount of entanglement, which also plays an important role as the improved semidefinite programming (SDP) upper bound of distillable entanglement. Second, we show that the Rains bound is neither additive nor equal to the asymptotic relative entropy of entanglement. Third, we establish SDP lower bounds for the entanglement cost and demonstrate the irreversibility of asymptotic entanglement manipulation under positive-partial-transpose-preserving quantum operations, resolving a major open problem in quantum information theory. \nIn the second part, we develop a framework of semidefinite programs to evaluate the classical and quantum communication capabilities of quantum channels in both the non-asymptotic and asymptotic regimes. In particular, we establish the first general SDP strong converse bound on the classical capacity of an arbitrary quantum channel and give in particular the best known upper bound on the classical capacity of the amplitude damping channel. We further establish a finite resource analysis of classical communication over quantum erasure channels, including the first second-order expansion of classical capacity beyond entanglement-breaking channels. For quantum communication, we establish the best SDP-computable strong converse bound and refine it as the so-called max-Rains information. \nIn the third part, we investigate the quantum zero-error information theory. In contrast to the conventional Shannon theory, there is a very different-looking information theory when errors are required to be precisely zero, where the communication problem reduces to the analysis of the so-called confusability graph (noncommutative graph) of a classical channel (quantum channel). We develop an activated communication model and explore its novel properties. Notably, we separate the quantum Lovász number and the entanglement-assisted zero-error capacity, resolving an intriguing open problem in the area of zero-error information.

•Jan 1, 2018•7 citations
This dissertation studies several information-theoretic aspects of optical communications.The first aspect it studies is the one-shot classical capacity of a quantum communication channel.It proves new upper and lower bounds on the amount of classical information that can be transmitted through a single use of a quantum channel, under a constraint on the average error probability.The bounds are expressed using a quantity defined via quantum hypothesis testing.Combined with the Quantum Stein's Lemma, these bounds provide a conceptually simple proof for the Holevo-Schumacher-Westmoreland Theorem for the classical capacity of a memoryless quantum channel.Further, they also give a general capacity formula that is valid for any, not necessarily memoryless, quantum channel.The second topic studied in this dissertation is the capacity of a continuous-time peak-limited Poisson channel with spurious counts in the output.It is shown that, if the positions of the spurious counts are known noncausally to the encoder but not to the decoder, then the capacity of this channel equals the capacity of the same channel but with no spurious counts, regardless of whether the spurious counts are random or are chosen by a malicious adversary.On the other hand, if the positions of the spurious counts are known only causally to the encoder but not to the decoder, then such information does not help to increase the capacity of this channel.Next, a rate-distortion problem for point processes is considered.In this problem, an encoder sees a point pattern on the interval [0, T ] and v vi Abstract describes it to a reconstructor using bits.Based on this description, the reconstructor produces a subset of [0, T ] of Lebesgue measure not exceeding DT for some D > 0 to cover all the points in the pattern.It is shown that, if the point pattern is the outcome of a homogeneous Poisson process of intensity λ, then, as T tends to infinity, the minimum number of bits per second needed for the encoder to describe the pattern is -λ log D. Further, any point pattern containing no more than λ points per second can be successfully described in this sense using -λ log D bits per second.A Wyner-Ziv version of this problem is also studied where some points in the pattern are known to the reconstructor.The last problem considered in this dissertation is the asymptotic capacity at low input powers of a discrete-time Poisson channel under average-power or average-and peak-power constraints.For a Poisson channel whose dark current is zero or decays to zero linearly with the allowed average input power E, capacity is shown to scale like E log 1E as E tends to zero.For a Poisson channel whose dark current is a nonzero constant, capacity is shown to scale, to within a constant, like E log log 1 E .
In this thesis we analyse the type of states and ensembles which achieve the capacity for certain quantum channels carrying classical information. We first concentrate on the product-state capacity of a particular quantum channel, that is, the capacity which is achieved by encoding the output states from a source into codewords comprised of states taken from ensembles of non-entangled states and sending them over copies of the quantum channel. Using the "single-letter" formula proved independently by Holevo and by Schumacher and Westmoreland we obtain the product-state capacity of the qubit quantum amplitude-damping channel, which is determined by a transcendental equation in a single real variable and can be solved numerically. We demonstrate that the product-state capacity of this channel can be achieved using a minimal ensemble of non-orthogonal pure states. Next we consider the classical capacity of two quantum channels with memory, namely a periodic channel with quantum depolarising channel branches and a convex combination of quantum channels. We prove that the classical capacity for each of the classical memory channels mentioned above is, in fact, equal to the respective product-state capacities. For those channels this means that the classical capacity is achieved without the use of entangled input-states. Next we introduce the channel coding theorem for memoryless quantum channels, providing a known proof by Winter for the strong converse of the theorem. We then consider the strong converse to the channel coding theorem for a periodic quantum channel.
The problems studied in this thesis fall within two different topics in network information theory. The first part of this dissertation will be about information theoretic security and the second about distributed source coding. In the following a brief description of these problems will be given. In information theoretic security, we look at two different types of timing channels and we quantify the maximum rate at which a transmitter can communicate information reliably to a legitimate receiver while keeping an eavesdropper in the dark. The first timing channel that we study is the Poisson channel which is used to model certain direct detection optical communication systems. To transmit a message on this channel, the transmitter encodes information by modulating the intensity of an optical signal while the legitimate receiver and the eavesdropper use the arrival moments of the individual photons to decide which message was transmitted. The second timing channel studied is the exponential server queue. Here the transmitter encodes a message using a chosen sequence of packets inter-arrival times and both the legitimate receiver and the eavesdropper use the corresponding inter-departures from their respective exponential server queues to decode the transmitted message. In distributed source coding, we consider a rate-distortion problem in which a decoder is interested in estimating two correlated Gaussian random variables with mean-square error distortion constraints on each of the reproductions. The variables to be estimated are the roots of a given Gauss-Markov tree and each encoder observes one of the leaves of that tree. We show that a simple compression architecture that performs separate lossy quantization followed by SlepianWolf binning is sum-rate optimal for this problem.
The classical capacity of a noisy optical channel is the maximum rate at which information can be transmitted reliably, given a constraint on the mean input energy. For the ubiquitous bosonic Gaussian channels, which include standard models of loss and noise in fibre and free-space optical links, determining this rate requires addressing whether entanglement between channel uses or non-Gaussian signals can outperform Gaussian encodings. More precisely, the question is whether the energy-constrained Holevo information is additive across arbitrarily many channel uses and coincides with its Gaussian counterpart. We answer these fundamental questions in the affirmative for every single-mode bosonic Gaussian channel at every input energy. Namely, we prove that independently prepared Gaussian states with Gaussian-distributed random displacements achieve the capacity, including in the low-energy regime where squeezing the signals competes with encoding information in their displacement. Our proof connects an entanglement inequality to a sharp, additive lower bound on output entropy. We then characterise communication above capacity: under a strict total photon-number cutoff, the probability of correct decoding decreases exponentially with the number of channel uses, and we derive explicit bounds on the decay exponent. When only the mean photon number is constrained, a simple energy-rescaling formula determines exactly the entire asymptotic rate--error trade-off: the capacity at mean photon number NNN and allowed average decoding error εεε equals the vanishing-error capacity at mean photon number N/(1−ε)N/(1-ε)N/(1−ε). Together, these results identify the ultimate limits of classical communication for some of the most fundamental models of optical communication.
Motivated by the increasing demand for more powerful and efficient optical communication systems, quantum mechanics of information processing has become the key element in determining the fundamental limits of physical channels, and in designing quantum communication systems that approach those fundamental limits. To achieve higher data rates over quantum optical channels, we need to efficiently extract classical information from quantum states. However, peculiar properties of quantum states, such as the no-cloning theorem and the non-reversible measurement process, provide new challenges in the measurement of quantum states; in quantum information science, there is no concept analogous to sufficient statistics in classical information science. Therefore, to extract as much information as possible from quantum states, it is important to choose the right measurement process. In this thesis, we investigate the fundamental question of how to design the measurement process to efficiently extract information from quantum states. First, we consider adaptive measurement, with which we measure each received quantum state one at a time, and then update the next measurement process based on the previous observations. We show that for binary hypothesis testing between two ideal laser light pulses, if we update the adaptive measurement to maximize the communication efficiency at each instant, based on recursively updated knowledge of the receiver, then we can achieve the theoretical lower bound of the detection error probability. Using this viewpoint, we give a natural generalization of the adaptive measurement to general Mary hypothesis testing problems. We also analyze the information capacity with adaptive measurement, and compare the result with that for direct detection receivers and the ultimate capacity of quantum channels (the Holevo limit). We also investigate finite-blocklength joint receivers. The ultimate capacity of quantum channels is calculated under the assumption that an infinite number of quantum states can be collectively measured in one shot. However, this assumption becomes the primary barrier that prevents practical implementations of capacity-achieving joint detection receivers. The maximum number of classical information bits extracted per use of the quantum channel strictly increases with the number of channel outputs jointly measured at the receiver. This phenomenon is called strict superadditivity, and it has been thought of as a unique property that can be observed only in quantum channels, but not in classical discrete memoryless channels (DMCs). In this thesis, we introduce a new aspect of understanding strict superadditivity by comparing the performance of concatenated coding over quantum channels and classical DMCs, for a fixed inner code length. We show that the strict superadditivity in information rate occurs due to a loss of information from hard-decisions at the finite blocklength. We also find a lower bound on the maximum achievable information rate as a function of the length of the quantum measurement. The analysis and new insights into the measurement process of quantum states that we develop in this thesis can be used to improve not only current quantum optical communication systems, but also classical information processing, where the data is too big to be handled with sufficient statistics. Our work would help develop new concepts of efficient statistics that provide systematic ways to choose useful information among big data while discarding the rest.
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.
This thesis aims to improve our understanding of the structure of quantum entanglement and the limits of information processing with quantum systems. It presents new results relevant to three threads of quantum information: the theory of quantum entanglement, the communication capabilities of quantum channels, and the quantum zero-error information theory. \nIn the first part, we investigate the fundamental features of quantum entanglement and develop quantitative approaches to better exploit the power of entanglement. First, we introduce a computable and additive entanglement measure to quantify the amount of entanglement, which also plays an important role as the improved semidefinite programming (SDP) upper bound of distillable entanglement. Second, we show that the Rains bound is neither additive nor equal to the asymptotic relative entropy of entanglement. Third, we establish SDP lower bounds for the entanglement cost and demonstrate the irreversibility of asymptotic entanglement manipulation under positive-partial-transpose-preserving quantum operations, resolving a major open problem in quantum information theory. \nIn the second part, we develop a framework of semidefinite programs to evaluate the classical and quantum communication capabilities of quantum channels in both the non-asymptotic and asymptotic regimes. In particular, we establish the first general SDP strong converse bound on the classical capacity of an arbitrary quantum channel and give in particular the best known upper bound on the classical capacity of the amplitude damping channel. We further establish a finite resource analysis of classical communication over quantum erasure channels, including the first second-order expansion of classical capacity beyond entanglement-breaking channels. For quantum communication, we establish the best SDP-computable strong converse bound and refine it as the so-called max-Rains information. \nIn the third part, we investigate the quantum zero-error information theory. In contrast to the conventional Shannon theory, there is a very different-looking information theory when errors are required to be precisely zero, where the communication problem reduces to the analysis of the so-called confusability graph (noncommutative graph) of a classical channel (quantum channel). We develop an activated communication model and explore its novel properties. Notably, we separate the quantum Lovász number and the entanglement-assisted zero-error capacity, resolving an intriguing open problem in the area of zero-error information.