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

arXiv:quant-ph/9801007 · Physical Review A

Realization of a collective decoding of code-word states

Masahide Sasaki, Tsuyoshi Sasaki-Usuda, Masayuki Izutsu, Osamu Hirota

Published Jul 1, 1998• 24 citations
arXivHTMLPDF

Abstract

A physical model for the optimum collective decoding that attains the minimum average error probability in distinguishing code-word states is presented. This model is based on a cavity QED technique which is available at present. It will open a possibility for a quantum decoder that realizes the superadditivity in classical capacity of quantum channel which was demonstrated in M. Sasaki, preceeding paper, Phys. Rev. A 58, 146 (1998).

DOI
10.1103/physreva.58.159

Related papers

Experimental proposal for achieving superadditive communication capacities with a binary quantum alphabet

J. R. Buck, S. J. van Enk, Christopher A. Fuchs

We demonstrate superadditivity in the communication capacity of a binary alphabet consisting of two nonorthogonal quantum states. For this scheme, collective decoding is performed two transmissions at a time. This improves upon the previous schemes of Sasaki et al. [Phys. Rev. A 58, 146 (1998)] where superadditivity was not achieved until a decoding of three or more transmissions at a time. This places superadditivity within the regime of a near-term laboratory demonstration. We propose an experimental test based upon an alphabet of low photon-number coherent states where the signal decoding is done with atomic state measurements on a single atom in a high-finesse optical cavity.

arXiv:quant-ph/9903039•Physical Review A•Feb 16, 2000•32 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

Implementation of generalized quantum measurements: Superadditive quantum coding, accessible information extraction, and classical capacity limit

Masahiro Takeoka, Mikio Fujiwara, Jun Mizuno +1 more

Quantum-information theory predicts that when the transmission resource is doubled in quantum channels, the amount of information transmitted can be increased more than twice by quantum-channel coding technique, whereas the increase is at most twice in classical information theory. This remarkable feature, the superadditive quantum-coding gain, can be implemented by appropriate choices of code words and corresponding quantum decoding which requires a collective quantum measurement. Recently, an experimental demonstration was reported [M. Fujiwara et al., Phys. Rev. Lett. 90, 167906 (2003)]. The purpose of this paper is to describe our experiment in detail. Particularly, a design strategy of quantum-collective decoding in physical quantum circuits is emphasized. We also address the practical implication of the gain on communication performance by introducing the quantum-classical hybrid coding scheme. We show how the superadditive quantum-coding gain, even in a small code length, can boost the communication performance of conventional coding techniques.

arXiv:quant-ph/0306034•Physical Review A•May 26, 2004•24 citations

Quantum reading capacity

Stefano Pirandola, Cosmo Lupo, Vittorio Giovannetti +2 more

The readout of a classical memory can be modelled as a problem of quantum channel discrimination, where a decoder retrieves information by distinguishing the different quantum channels encoded in each cell of the memory (Pirandola 2011 Phys. Rev. Lett. 106 090504). In the case of optical memories, such as CDs and DVDs, this discrimination involves lossy bosonic channels and can be remarkably boosted by the use of nonclassical light (quantum reading). Here we generalize these concepts by extending the model of memory from single-cell to multi-cell encoding. In general, information is stored in a block of cells by using a channel-codeword, i.e. a sequence of channels chosen according to a classical code. Correspondingly, the readout of data is realized by a process of 'parallel' channel discrimination, where the entire block of cells is probed simultaneously and decoded via an optimal collective measurement. In the limit of a large block we define the quantum reading capacity of the memory, quantifying the maximum number of readable bits per cell. This notion of capacity is nontrivial when we suitably constrain the physical resources of the decoder. For optical memories (encoding bosonic channels), such a constraint is energetic and corresponds to fixing the mean total number of photons per cell. In this case, we are able to prove a separation between the quantum reading capacity and the maximum information rate achievable by classical transmitters, i.e. arbitrary classical mixtures of coherent states. In fact, we can easily construct nonclassical transmitters that are able to outperform any classical transmitter, thus showing that the advantages of quantum reading persist in the optimal multi-cell scenario.

arXiv:1107.3500•New Journal of Physics•Nov 11, 2011•72 citations

Classical Capacity and Entanglement Cost of the Amplitude Damping Channel

Ziao Tang, Chengkai Zhu, Ge Bai +1 more

Determining a noisy quantum channel's classical capacity and entanglement cost generally requires regularization over many channel uses. We remove both regularizations for every qubit-to-qubit channel admitting a pure output. For each such channel, Holevo information, channel entanglement of formation, and parallel entanglement cost are additive with those of any finite-dimensional partner channel. This class includes all qubit-to-qubit channels of Kraus rank at most two. For the amplitude damping channel with damping probability $p$, the unassisted classical capacity equals the known single-use Holevo information, attained by a binary pure-state ensemble with collective decoding, and the entanglement cost is $h_2((1+\sqrt p)/2)$ ebits per use. The common mechanism is a support criterion for strong superadditivity of entanglement of formation: one marginal has no support on the sector in which both local systems are orthogonal to fixed distinguished vectors. We prove this criterion in arbitrary finite dimensions using a triangular block-matrix entropy inequality and decompositions preserving two expectations. For amplitude damping, we also derive an exact finite-block Holevo deficit, identify the unique optimal average input for $p<1$, and construct a binary Kraus representation attaining the uniform formation bound.

quant-pharXiv:2609.28592•Sep 24, 2026•3 citations

A SCHEME FOR QUANTUM DENSE CODING IN CAVITY QED

Changlin Zou, Zhuo‐Liang Cao

Quantum mechanics allows one to encode the information in the superposition of a quantum state which embodies the nature of quantum nonlocality. Here we propose a realizable physical scheme for a multiparticle quantum dense coding (QDC) between two users in cavity quantum electrodynamics (QED). We also discuss the feasibility of our scheme within current technology.

International Journal of Modern Physics B•Dec 30, 2011•1 citation
A physical model for the optimum collective decoding that attains the minimum average error probability in distinguishing code-word states is presented. This model is based on a cavity QED technique which is available at present. It will open a possibility for a quantum decoder that realizes the superadditivity in classical capacity of quantum channel which was demonstrated in M. Sasaki, preceeding paper, Phys. Rev. A 58, 146 (1998).
We demonstrate superadditivity in the communication capacity of a binary alphabet consisting of two nonorthogonal quantum states. For this scheme, collective decoding is performed two transmissions at a time. This improves upon the previous schemes of Sasaki et al. [Phys. Rev. A 58, 146 (1998)] where superadditivity was not achieved until a decoding of three or more transmissions at a time. This places superadditivity within the regime of a near-term laboratory demonstration. We propose an experimental test based upon an alphabet of low photon-number coherent states where the signal decoding is done with atomic state measurements on a single atom in a high-finesse optical cavity.
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.
Quantum-information theory predicts that when the transmission resource is doubled in quantum channels, the amount of information transmitted can be increased more than twice by quantum-channel coding technique, whereas the increase is at most twice in classical information theory. This remarkable feature, the superadditive quantum-coding gain, can be implemented by appropriate choices of code words and corresponding quantum decoding which requires a collective quantum measurement. Recently, an experimental demonstration was reported [M. Fujiwara et al., Phys. Rev. Lett. 90, 167906 (2003)]. The purpose of this paper is to describe our experiment in detail. Particularly, a design strategy of quantum-collective decoding in physical quantum circuits is emphasized. We also address the practical implication of the gain on communication performance by introducing the quantum-classical hybrid coding scheme. We show how the superadditive quantum-coding gain, even in a small code length, can boost the communication performance of conventional coding techniques.
The readout of a classical memory can be modelled as a problem of quantum channel discrimination, where a decoder retrieves information by distinguishing the different quantum channels encoded in each cell of the memory (Pirandola 2011 Phys. Rev. Lett. 106 090504). In the case of optical memories, such as CDs and DVDs, this discrimination involves lossy bosonic channels and can be remarkably boosted by the use of nonclassical light (quantum reading). Here we generalize these concepts by extending the model of memory from single-cell to multi-cell encoding. In general, information is stored in a block of cells by using a channel-codeword, i.e. a sequence of channels chosen according to a classical code. Correspondingly, the readout of data is realized by a process of 'parallel' channel discrimination, where the entire block of cells is probed simultaneously and decoded via an optimal collective measurement. In the limit of a large block we define the quantum reading capacity of the memory, quantifying the maximum number of readable bits per cell. This notion of capacity is nontrivial when we suitably constrain the physical resources of the decoder. For optical memories (encoding bosonic channels), such a constraint is energetic and corresponds to fixing the mean total number of photons per cell. In this case, we are able to prove a separation between the quantum reading capacity and the maximum information rate achievable by classical transmitters, i.e. arbitrary classical mixtures of coherent states. In fact, we can easily construct nonclassical transmitters that are able to outperform any classical transmitter, thus showing that the advantages of quantum reading persist in the optimal multi-cell scenario.
Determining a noisy quantum channel's classical capacity and entanglement cost generally requires regularization over many channel uses. We remove both regularizations for every qubit-to-qubit channel admitting a pure output. For each such channel, Holevo information, channel entanglement of formation, and parallel entanglement cost are additive with those of any finite-dimensional partner channel. This class includes all qubit-to-qubit channels of Kraus rank at most two. For the amplitude damping channel with damping probability ppp, the unassisted classical capacity equals the known single-use Holevo information, attained by a binary pure-state ensemble with collective decoding, and the entanglement cost is h2((1+p)/2)h_2((1+\sqrt p)/2)h2​((1+p​)/2) ebits per use. The common mechanism is a support criterion for strong superadditivity of entanglement of formation: one marginal has no support on the sector in which both local systems are orthogonal to fixed distinguished vectors. We prove this criterion in arbitrary finite dimensions using a triangular block-matrix entropy inequality and decompositions preserving two expectations. For amplitude damping, we also derive an exact finite-block Holevo deficit, identify the unique optimal average input for p<1p<1p<1, and construct a binary Kraus representation attaining the uniform formation bound.