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:2001.00836 · IEEE Transactions on Information Theory

Communication Over Quantum Channels With Parameter Estimation

Uzi Pereg

Published Jun 1, 2020• 30 citations
arXivHTMLPDF

Abstract

Communication over a random-parameter quantum channel when the decoder is required to reconstruct the parameter sequence is considered. We study scenarios that include either strictly-causal, causal, or non-causal channel side information (CSI) available at the encoder, and also when CSI is not available. This model can be viewed as a form of quantum metrology, and as the quantum counterpart of the classical rate-and-state channel with state estimation at the decoder. Regularized formulas for the capacity-distortion regions are derived. In the special case of measurement channels, single-letter characterizations are derived for the strictly-causal and causal settings. Furthermore, in the more general case of entanglement-breaking channels, a single-letter characterization is derived when CSI is not available. As a consequence, we obtain regularized formulas for the capacity of random-parameter quantum channels with CSI, generalizing previous results by Bocheet al., 2016, on classical-quantum channels. Bosonic dirty paper coding is introduced as a consequence, where we demonstrate that the optimal coefficient is not necessarily that of minimum mean-square error estimation as in the classical setting.

DOI
10.1109/tit.2021.3123221

Related papers

Entanglement-Assisted Capacity of Quantum Channels with Side Information

Uzi Pereg

Entanglement-assisted communication over a random-parameter quantum channel with either causal or non-causal channel side information (CSI) at the encoder is considered.This describes a scenario where the quantum channel depends on the quantum state of the input environment.While Bob, the decoder, has no access to this state, Alice, the transmitter, performs a sequence of projective measurements on her environment to encode her message.Dupuis [10,9] established the entanglement-assisted capacity with non-causal CSI.Here, we establish characterization in the causal setting, and also give an alternative proof technique and further observations for the non-causal setting.

•Feb 26, 2020•6 citations

Entanglement-Assisted Capacity of Quantum Channels with Side Information

Uzi Pereg

Entanglement-assisted communication over a random-parameter quantum channel with either causal or non-causal channel side information (CSI) at the encoder is considered. This describes a scenario where the quantum channel depends on the quantum state of the input environment. While Bob, the decoder, has no access to this state, Alice, the transmitter, performs a sequence of projective measurements on her environment and encodes her message accordingly. Dupuis established the entanglement-assisted capacity with non-causal CSI. Here, we establish characterization in the causal setting, and also give an alternative proof technique and further observations for the non-causal setting.

arXiv:1909.09992•Sep 22, 2019•9 citations

Quantum Channel State Masking

Uzi Pereg

Communication over a quantum channel that depends on a quantum state is considered when the encoder has channel side information (CSI) and is required to mask information on the quantum channel state from the decoder. A full characterization is established for the entanglement-assisted masking equivocation region with a maximally correlated channel state, and a regularized formula is given for the quantum capacity-leakage function without assistance. For Hadamard channels without assistance, we derive single-letter inner and outer bounds, which coincide in the standard case of a channel that does not depend on a state.

•Jan 1, 2021•21 citations

Classical state masking over a quantum channel

Uzi Pereg, Christian Deppe, Holger Boche

Transmission of classical information over a quantum state-dependent channel is considered, when the encoder can measure channel side information (CSI) and is required to mask information on the quantum channel state from the decoder. In this quantum setting, it is essential to conceal the CSI measurement as well. A regularized formula is derived for the masking equivocation region, and a full characterization is established for a class of measurement channels.

arXiv:2109.12647•Physical Review A•Feb 28, 2022•8 citations

Quantum Channel State Masking

Uzi Pereg, Christian Deppe, Holger Boche

Communication over a quantum channel that depends on a quantum state is considered when the encoder has channel side information (CSI) and is required to mask information on the quantum channel state from the decoder. A full characterization is established for the entanglement-assisted masking equivocation region with a maximally correlated channel state, and a regularized formula is given for the quantum capacity-leakage function without assistance. For Hadamard channels without assistance, we derive single-letter inner and outer bounds, which coincide in the standard case of a channel that does not depend on a state.

arXiv:2006.05925•IEEE Information Theory Workshop (ITW)•Jan 13, 2021•1 citation

The classical-quantum channel with random state parameters known to the sender

Holger Boche, Ning Cai, Janis Nötzel

Abstract We study an analog of the well-known Gel’fand Pinsker channel which uses quantum states for the transmission of the data. We consider the case where both the sender’s inputs to the channel and the channel states are to be taken from a finite set (the cq-channel with state information at the sender). We distinguish between causal and non-causal channel state information input by the sender. The receiver remains ignorant, throughout. We give a single-letter description of the capacity in the first case. In the second case we present two different regularized expressions for the capacity. It is an astonishing and unexpected result of our work that a simple change from causal to non-causal channel state information by the encoder causes the complexity of a numerical computation of the capacity formula to change from trivial to seemingly difficult. Still, even the non-single letter formula allows one to draw nontrivial conclusions, for example regarding the continuity of the capacity with respect to changes in the system parameters. The direct parts of both coding theorems are based on a special class of positive operator valued measurements (POVMs) which are derived from orthogonal projections onto certain representations of the symmetric groups. This approach supports a reasoning that is inspired by the classical method of types. In combination with the non-commutative union bound these POVMs yield an elegant method of proof for the direct part of the coding theorem in the first case.

arXiv:1506.06479•Journal of Physics A Mathematical and Theoretical•Apr 5, 2016•17 citations
Communication over a random-parameter quantum channel when the decoder is required to reconstruct the parameter sequence is considered. We study scenarios that include either strictly-causal, causal, or non-causal channel side information (CSI) available at the encoder, and also when CSI is not available. This model can be viewed as a form of quantum metrology, and as the quantum counterpart of the classical rate-and-state channel with state estimation at the decoder. Regularized formulas for the capacity-distortion regions are derived. In the special case of measurement channels, single-letter characterizations are derived for the strictly-causal and causal settings. Furthermore, in the more general case of entanglement-breaking channels, a single-letter characterization is derived when CSI is not available. As a consequence, we obtain regularized formulas for the capacity of random-parameter quantum channels with CSI, generalizing previous results by Bocheet al., 2016, on classical-quantum channels. Bosonic dirty paper coding is introduced as a consequence, where we demonstrate that the optimal coefficient is not necessarily that of minimum mean-square error estimation as in the classical setting.
Entanglement-assisted communication over a random-parameter quantum channel with either causal or non-causal channel side information (CSI) at the encoder is considered.This describes a scenario where the quantum channel depends on the quantum state of the input environment.While Bob, the decoder, has no access to this state, Alice, the transmitter, performs a sequence of projective measurements on her environment to encode her message.Dupuis [10,9] established the entanglement-assisted capacity with non-causal CSI.Here, we establish characterization in the causal setting, and also give an alternative proof technique and further observations for the non-causal setting.
Entanglement-assisted communication over a random-parameter quantum channel with either causal or non-causal channel side information (CSI) at the encoder is considered. This describes a scenario where the quantum channel depends on the quantum state of the input environment. While Bob, the decoder, has no access to this state, Alice, the transmitter, performs a sequence of projective measurements on her environment and encodes her message accordingly. Dupuis established the entanglement-assisted capacity with non-causal CSI. Here, we establish characterization in the causal setting, and also give an alternative proof technique and further observations for the non-causal setting.
Communication over a quantum channel that depends on a quantum state is considered when the encoder has channel side information (CSI) and is required to mask information on the quantum channel state from the decoder. A full characterization is established for the entanglement-assisted masking equivocation region with a maximally correlated channel state, and a regularized formula is given for the quantum capacity-leakage function without assistance. For Hadamard channels without assistance, we derive single-letter inner and outer bounds, which coincide in the standard case of a channel that does not depend on a state.
Communication over a quantum channel that depends on a quantum state is considered when the encoder has channel side information (CSI) and is required to mask information on the quantum channel state from the decoder. A full characterization is established for the entanglement-assisted masking equivocation region with a maximally correlated channel state, and a regularized formula is given for the quantum capacity-leakage function without assistance. For Hadamard channels without assistance, we derive single-letter inner and outer bounds, which coincide in the standard case of a channel that does not depend on a state.
Abstract We study an analog of the well-known Gel’fand Pinsker channel which uses quantum states for the transmission of the data. We consider the case where both the sender’s inputs to the channel and the channel states are to be taken from a finite set (the cq-channel with state information at the sender). We distinguish between causal and non-causal channel state information input by the sender. The receiver remains ignorant, throughout. We give a single-letter description of the capacity in the first case. In the second case we present two different regularized expressions for the capacity. It is an astonishing and unexpected result of our work that a simple change from causal to non-causal channel state information by the encoder causes the complexity of a numerical computation of the capacity formula to change from trivial to seemingly difficult. Still, even the non-single letter formula allows one to draw nontrivial conclusions, for example regarding the continuity of the capacity with respect to changes in the system parameters. The direct parts of both coding theorems are based on a special class of positive operator valued measurements (POVMs) which are derived from orthogonal projections onto certain representations of the symmetric groups. This approach supports a reasoning that is inspired by the classical method of types. In combination with the non-commutative union bound these POVMs yield an elegant method of proof for the direct part of the coding theorem in the first case.