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

Communication over Random-Parameter Quantum Channels with Parameter Estimation

Uzi Pereg

Published Jan 1, 2020• 0 citations
OpenAlex

Related papers

Communication over a quantum channel with feedback

John E. Kaufmann

•Dec 1, 1980•1 citation

Joint Quantum Communication and Sensing

Shiyuan Wang, Tuna Erdoğan, Uzi Pereg +1 more

To capture the problem of joint communication and sensing in the quantum regime, we consider the problem of reliably communicating over a Classical-Quantum (c-q) channel that depends on a random parameter while simultaneously estimating the random parameter at the transmitter through a noisy feedback channel. Specifically, for non-adaptive estimation strategies, we obtain an exact characterization of the optimal tradeoffs between the rate of communication and the error exponent of parameter estimation. As in the classical setting, the tradeoff is governed by the empirical distribution of the codewords, which simultaneously controls the rate of reliable communication and the error exponent.

IEEE Information Theory Workshop (ITW)•Nov 1, 2022•8 citations

Multi-channel quantum parameter estimation

Liying Bao, Bo Qi, Yabo Wang +2 more

Science China Information Sciences•Jun 16, 2022•8 citations

Superadditivity of classical communication over quantum channels via random and deterministic permutations

Benjamin Lovitz, Peixue Wu

Since Hastings' proof of superadditivity of classical communication over quantum channels, considerable effort has been devoted to finding a structural explanation of this phenomenon that was originally established by concentration of measure for Haar random unitaries. The main observation of this work is that Haar randomness can be replaced by random permutations without changing the limiting geometry responsible for nonadditivity. This replacement turns a continuous problem over unitary matrices into a discrete combinatorial problem over zero--one permutation matrices, and thereby opens a path toward derandomization. The theorem of Bordenave and Collins shows that random permutations have the required limiting behavior and the algorithm of O'Donnell and Wu then provides a deterministic asymptotic construction, running in polynomial time in the size when the channel parameters and accuracy are fixed. Thus the random construction can be derandomized in an asymptotic algorithmic sense. Finally, a quantitative random permutation estimate by Chen, Garza-Vargas, Tropp and van Handel gives a fully numerical estimate: there exists a tuple of 57,836,025 permutations acting on a set of size \[ N \le 5.422\times 10^{116216}\] such that the associated finite dimensional channel exhibits nonadditivity. This enormous value remains an obstacle to a practical construction.

quant-pharXiv:2608.25961•Aug 27, 2026•6 citations

Communication Over Quantum Channels With Parameter Estimation

Uzi Pereg

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.

arXiv:2001.00836•IEEE Transactions on Information Theory•Jun 1, 2020•30 citations

Simultaneous Communication and Parameter Estimation of Pauli Channels

Junaid ur Rehman, Hyundong Shin

We propose a scheme for simultaneous classical communication and parameter estimation of generalized Pauli channels. This framework relies on the facts that i) under certain conditions, Pauli channels act as classical symmetric channel, and ii) a recently proposed parameter estimation method of Pauli channels can be executed while satisfying the conditions of i). The performance of the parameter estimation part in this simultaneous scheme relies on the symbol error rate of the communication module. This reliance gives rise to a natural tradeoff between the communication rate and the performance of parameter estimation in this simultaneous scheme. We exemplify our protocol by utilizing repetition codes for communication and the aforementioned parameter estimation scheme for the characterization of the channel at hand. We explore the tradeoff behavior between the communication rate and the performance of parameter estimation in the numerical examples. Our proposal paves the way for practical methods in simultaneous communication and channel estimation over unknown quantum channels.

International Conference on Communications•May 16, 2022•3 citations
To capture the problem of joint communication and sensing in the quantum regime, we consider the problem of reliably communicating over a Classical-Quantum (c-q) channel that depends on a random parameter while simultaneously estimating the random parameter at the transmitter through a noisy feedback channel. Specifically, for non-adaptive estimation strategies, we obtain an exact characterization of the optimal tradeoffs between the rate of communication and the error exponent of parameter estimation. As in the classical setting, the tradeoff is governed by the empirical distribution of the codewords, which simultaneously controls the rate of reliable communication and the error exponent.
Since Hastings' proof of superadditivity of classical communication over quantum channels, considerable effort has been devoted to finding a structural explanation of this phenomenon that was originally established by concentration of measure for Haar random unitaries. The main observation of this work is that Haar randomness can be replaced by random permutations without changing the limiting geometry responsible for nonadditivity. This replacement turns a continuous problem over unitary matrices into a discrete combinatorial problem over zero--one permutation matrices, and thereby opens a path toward derandomization. The theorem of Bordenave and Collins shows that random permutations have the required limiting behavior and the algorithm of O'Donnell and Wu then provides a deterministic asymptotic construction, running in polynomial time in the size when the channel parameters and accuracy are fixed. Thus the random construction can be derandomized in an asymptotic algorithmic sense. Finally, a quantitative random permutation estimate by Chen, Garza-Vargas, Tropp and van Handel gives a fully numerical estimate: there exists a tuple of 57,836,025 permutations acting on a set of size N≤5.422×10116216 N \le 5.422\times 10^{116216}N≤5.422×10116216 such that the associated finite dimensional channel exhibits nonadditivity. This enormous value remains an obstacle to a practical construction.
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.
We propose a scheme for simultaneous classical communication and parameter estimation of generalized Pauli channels. This framework relies on the facts that i) under certain conditions, Pauli channels act as classical symmetric channel, and ii) a recently proposed parameter estimation method of Pauli channels can be executed while satisfying the conditions of i). The performance of the parameter estimation part in this simultaneous scheme relies on the symbol error rate of the communication module. This reliance gives rise to a natural tradeoff between the communication rate and the performance of parameter estimation in this simultaneous scheme. We exemplify our protocol by utilizing repetition codes for communication and the aforementioned parameter estimation scheme for the characterization of the channel at hand. We explore the tradeoff behavior between the communication rate and the performance of parameter estimation in the numerical examples. Our proposal paves the way for practical methods in simultaneous communication and channel estimation over unknown quantum channels.