From Classical to Quantum Channels: Achieving Positive Covert Rates
Abstract
In this paper, we study the conditions under which covert communication at positive rates is feasible over discrete memoryless classical, classical-quantum, and quantum channels. For classical point-to-point channels, we show that if the dimension of the channel input probability simplex exceeds that of the channel output probability simplex, equivalently, if the input alphabet has larger cardinality than the output alphabet, then positive covert rates are achievable for certain classes of Discrete Memoryless Channels (DMCs). We further show that allowing the innocent symbol (i.e., the symbol transmitted in the no-communication mode) to be chosen appropriately can enlarge the class of DMCs for which positive covert rates are achievable. We also study covert communication over classical Multiple-Access Channels (MACs), where the additional transmitter effectively enlarges the set of available channel input pairs, and we show that the conditions required to satisfy the covertness constraint are less restrictive for MACs than for point-to-point channels. We extend these results to classical-quantum DMCs by showing that if the dimension of the input probability simplex exceeds the affine dimension of the set of output states that can be induced at the channel output, then positive covert rates are achievable for certain classes of classical-quantum DMCs. Finally, for quantum channels, we show that if the innocent state (i.e., the state transmitted in the no-communication mode) is mixed, then the covertness constraint can always be satisfied by a non-trivial input ensemble. Consequently, positive covert rates are achievable whenever the legitimate receiver can distinguish at least two states in a suitable such ensemble.
Related
- Classical communication over quantum channels: does entanglement help in nature?
- Classical Commitment over Quantum Channels with Limited Entanglement Assistance
- Superadditivity of classical communication over quantum channels via random and deterministic permutations
- From Symmetry to Secrecy: Covariant Classical--Quantum Wiretap Channels
- Unlocking Exponential and Unbounded Robust Gains in Shannon Capacity of Classical Multiple Access Channels with Causal CSIT via Quantum Entanglement Assistance
BibTeX
@misc{zivarifard2026from,
title = {{From Classical to Quantum Channels: Achieving Positive Covert Rates}},
author = {Hassan ZivariFard and Xiaodong Wang and Alexei Ashikhmin},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.36162},
eprint = {2609.36162},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.36162},
}
RIS
TY - UNPB
TI - From Classical to Quantum Channels: Achieving Positive Covert Rates
AU - Hassan ZivariFard
AU - Xiaodong Wang
AU - Alexei Ashikhmin
PY - 2026
DA - 2026/09/28
PB - arXiv
DO - 10.48550/arxiv.2609.36162
UR - https://arxiv.org/abs/2609.36162
AB - In this paper, we study the conditions under which covert communication at positive rates is feasible over discrete memoryless classical, classical-quantum, and quantum channels. For classical point-to-point channels, we show that if the dimension of the channel input probability simplex exceeds that of the channel output probability simplex, equivalently, if the input alphabet has larger cardinality than the output alphabet, then positive covert rates are achievable for certain classes of Discrete Memoryless Channels (DMCs). We further show that allowing the innocent symbol (i.e., the symbol transmitted in the no-communication mode) to be chosen appropriately can enlarge the class of DMCs for which positive covert rates are achievable. We also study covert communication over classical Multiple-Access Channels (MACs), where the additional transmitter effectively enlarges the set of available channel input pairs, and we show that the conditions required to satisfy the covertness constraint are less restrictive for MACs than for point-to-point channels. We extend these results to classical-quantum DMCs by showing that if the dimension of the input probability simplex exceeds the affine dimension of the set of output states that can be induced at the channel output, then positive covert rates are achievable for certain classes of classical-quantum DMCs. Finally, for quantum channels, we show that if the innocent state (i.e., the state transmitted in the no-communication mode) is mixed, then the covertness constraint can always be satisfied by a non-trivial input ensemble. Consequently, positive covert rates are achievable whenever the legitimate receiver can distinguish at least two states in a suitable such ensemble.
ER -