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

Allerton Conference on Communication, Control, and Computing

Superadditivity of quantum channel coding rate with finite blocklength quantum measurements

Hye Won Chung, Lizhong Zheng

Published Oct 1, 2013• 2 citations
Publisher

Abstract

This paper investigates the superadditivity of the maximum achievable information rate in a quantum channel. The superadditivity is a phenomenon that the maximum accessible information per channel strictly increases as the number of quantum states jointly measured increases. We give an explanation of this phenomenon by comparing the quantum channel with the classical discrete memoryless channel (DMC) under the concatenated codes, and give a lower bound on the maximum accessible information per channel at a finite length of quantum measurements in terms of V , which is the quantum version of channel dispersion, and C, the capacity of the quantum channel.

DOI
10.1109/allerton.2013.6736608

Related papers

Superadditivity of quantum channel coding rate with finite blocklength quantum measurements

Hye Won Chung, Saikat Guha, Lizhong Zheng

We investigate superadditivity in the maximum achievable rate of reliable classical communication over a quantum channel. The maximum number of classical information bits extracted per use of the quantum channel strictly increases as the number of channel outputs jointly measured at the receiver increases. This phenomenon is called superadditivity. We provide an explanation of this phenomenon by comparing a quantum channel with a classical discrete memoryless channel (DMC) under concatenated codes. We also give a lower bound on the maximum accessible information per channel use at a finite length of quantum measurements in terms of V, which is the quantum version of channel dispersion, and C, the classical capacity of the quantum channel.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2014•5 citations

Superadditivity of Quantum Channel Coding Rate With Finite Blocklength Joint Measurements

Hye Won Chung, Saikat Guha, Lizhong Zheng

The maximum rate at which classical information can be reliably transmitted per use of a quantum channel strictly increases in general with N , the number of channel outputs that are detected jointly by the quantum joint-detection receiver (JDR). This phenomenon is known as superadditivity of the maximum achievable information rate over a quantum channel. We study this phenomenon for a pure-state classical-quantum channel and provide a lower bound on C[subscript N]/N, the maximum information rate when the JDR is restricted to making joint measurements over no more than N quantum channel outputs, while allowing arbitrary classical error correction. We also show the appearance of a superadditivity phenomenon-of mathematical resemblance to the aforesaid problem-in the channel capacity of a classical discrete memoryless channel when a concatenated coding scheme is employed, and the inner decoder is forced to make hard decisions on N-length inner codewords. Using this correspondence, we develop a unifying framework for the above two notions of superadditivity, and show that for our lower bound to C[subscript N]/N to be equal to a given fraction of the asymptotic capacity C of the respective channel, N must be proportional to V/C², where V is the respective channel dispersion quantity.

•Aug 1, 2016•10 citations

Superadditivity for Entanglement-Assisted Communication

Hao-Chung Cheng, Mario Berta

The entanglement-assisted capacity of a quantum channel admits an additive single-letter characterization, implying that joint encodings across channel uses cannot increase the ultimate communication rate. Here, we show that this additive picture does not extend to communication reliability. Specifically, we prove that the Petz-Rényi channel information can be strictly superadditive for every $α\in[1/2,1)$, yielding a genuine multi-copy enhancement of the entanglement-assisted random-coding error exponent, even though the entanglement-assisted capacity remains additive. We establish this phenomenon analytically already for measurement channels, which are entanglement-breaking and have additive unassisted capacity. Remarkably, this strict superadditivity is witnessed by a separable, classically correlated two-copy channel-input marginal, demonstrating that no entanglement between the transmitted systems is required. Our results show that, although correlations across channel uses cannot increase the ultimate rate of entanglement-assisted communication, they can enhance its reliability.

quant-pharXiv:2607.15151•Jul 17, 2026•2 citations

Superadditivity of Quantum Channel Coding Rate With Finite Blocklength Joint Measurements

Hye Won Chung, Saikat Guha, Lizhong Zheng

The maximum rate at which classical information can be reliably transmitted per use of a quantum channel strictly increases in general with N , the number of channel outputs that are detected jointly by the quantum joint-detection receiver (JDR). This phenomenon is known as superadditivity of the maximum achievable information rate over a quantum channel. We study this phenomenon for a pure-state classical-quantum channel and provide a lower bound on CN/N, the maximum information rate when the JDR is restricted to making joint measurements over no more than N quantum channel outputs, while allowing arbitrary classical error correction. We also show the appearance of a superadditivity phenomenon-of mathematical resemblance to the aforesaid problem-in the channel capacity of a classical discrete memoryless channel when a concatenated coding scheme is employed, and the inner decoder is forced to make hard decisions on N -length inner codewords. Using this correspondence, we develop a unifying framework for the above two notions of superadditivity, and show that for our lower bound to CN/N to be equal to a given fraction of the asymptotic capacity C of the respective channel, N must be proportional to V/C2, where V is the respective channel dispersion quantity.

arXiv:1310.3793•IEEE Transactions on Information Theory•Aug 2, 2016•10 citations

Quantum channels showing superadditivity in classical capacity

Masahide Sasaki, Kentaro Kato, Masayuki Izutsu +1 more

We consider a channel coding for sending classical information through a quantum channel with a given ensemble of quantum states (letter states). As is well known, it is generically possible in a quantum channel that the transmittable information in block coding of length $n$ can exceed $n$ times the maximum amount that can be sent without any coding scheme. This so-called superadditivity in classical capacity of a quantum channel is a distinct feature that cannot be found in a classical memoryless channel. In this paper, a practical model of channel coding that shows this property is presented. It consists of a simple code-word selection and the optimum decoding of the code words minimizing the average error probability. At first, optimization of decoding strategy is discussed. Then the channel coding that shows the superadditivity in classical capacity is demonstrated.

arXiv:quant-ph/9801012•Physical Review A•Jul 1, 1998•134 citations

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
This paper investigates the superadditivity of the maximum achievable information rate in a quantum channel. The superadditivity is a phenomenon that the maximum accessible information per channel strictly increases as the number of quantum states jointly measured increases. We give an explanation of this phenomenon by comparing the quantum channel with the classical discrete memoryless channel (DMC) under the concatenated codes, and give a lower bound on the maximum accessible information per channel at a finite length of quantum measurements in terms of V , which is the quantum version of channel dispersion, and C, the capacity of the quantum channel.
We investigate superadditivity in the maximum achievable rate of reliable classical communication over a quantum channel. The maximum number of classical information bits extracted per use of the quantum channel strictly increases as the number of channel outputs jointly measured at the receiver increases. This phenomenon is called superadditivity. We provide an explanation of this phenomenon by comparing a quantum channel with a classical discrete memoryless channel (DMC) under concatenated codes. We also give a lower bound on the maximum accessible information per channel use at a finite length of quantum measurements in terms of V, which is the quantum version of channel dispersion, and C, the classical capacity of the quantum channel.
The maximum rate at which classical information can be reliably transmitted per use of a quantum channel strictly increases in general with N , the number of channel outputs that are detected jointly by the quantum joint-detection receiver (JDR). This phenomenon is known as superadditivity of the maximum achievable information rate over a quantum channel. We study this phenomenon for a pure-state classical-quantum channel and provide a lower bound on C[subscript N]/N, the maximum information rate when the JDR is restricted to making joint measurements over no more than N quantum channel outputs, while allowing arbitrary classical error correction. We also show the appearance of a superadditivity phenomenon-of mathematical resemblance to the aforesaid problem-in the channel capacity of a classical discrete memoryless channel when a concatenated coding scheme is employed, and the inner decoder is forced to make hard decisions on N-length inner codewords. Using this correspondence, we develop a unifying framework for the above two notions of superadditivity, and show that for our lower bound to C[subscript N]/N to be equal to a given fraction of the asymptotic capacity C of the respective channel, N must be proportional to V/C², where V is the respective channel dispersion quantity.
The entanglement-assisted capacity of a quantum channel admits an additive single-letter characterization, implying that joint encodings across channel uses cannot increase the ultimate communication rate. Here, we show that this additive picture does not extend to communication reliability. Specifically, we prove that the Petz-Rényi channel information can be strictly superadditive for every α∈[1/2,1)α\in[1/2,1)α∈[1/2,1), yielding a genuine multi-copy enhancement of the entanglement-assisted random-coding error exponent, even though the entanglement-assisted capacity remains additive. We establish this phenomenon analytically already for measurement channels, which are entanglement-breaking and have additive unassisted capacity. Remarkably, this strict superadditivity is witnessed by a separable, classically correlated two-copy channel-input marginal, demonstrating that no entanglement between the transmitted systems is required. Our results show that, although correlations across channel uses cannot increase the ultimate rate of entanglement-assisted communication, they can enhance its reliability.
The maximum rate at which classical information can be reliably transmitted per use of a quantum channel strictly increases in general with N , the number of channel outputs that are detected jointly by the quantum joint-detection receiver (JDR). This phenomenon is known as superadditivity of the maximum achievable information rate over a quantum channel. We study this phenomenon for a pure-state classical-quantum channel and provide a lower bound on CN/N, the maximum information rate when the JDR is restricted to making joint measurements over no more than N quantum channel outputs, while allowing arbitrary classical error correction. We also show the appearance of a superadditivity phenomenon-of mathematical resemblance to the aforesaid problem-in the channel capacity of a classical discrete memoryless channel when a concatenated coding scheme is employed, and the inner decoder is forced to make hard decisions on N -length inner codewords. Using this correspondence, we develop a unifying framework for the above two notions of superadditivity, and show that for our lower bound to CN/N to be equal to a given fraction of the asymptotic capacity C of the respective channel, N must be proportional to V/C2, where V is the respective channel dispersion quantity.
We consider a channel coding for sending classical information through a quantum channel with a given ensemble of quantum states (letter states). As is well known, it is generically possible in a quantum channel that the transmittable information in block coding of length nnn can exceed nnn times the maximum amount that can be sent without any coding scheme. This so-called superadditivity in classical capacity of a quantum channel is a distinct feature that cannot be found in a classical memoryless channel. In this paper, a practical model of channel coding that shows this property is presented. It consists of a simple code-word selection and the optimum decoding of the code words minimizing the average error probability. At first, optimization of decoding strategy is discussed. Then the channel coding that shows the superadditivity in classical capacity is demonstrated.
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.