AI 中文总结
研究具有通用消息集的量子多址接入信道上的隐蔽通信，通过分析全量子MAC等，证明实现正隐蔽速率的可行性，建立可达速率区域，确定隐蔽容量，给出可应用的MAC例子，实现经典与量子MAC上的正速率隐蔽通信。
AI 中文摘要
我们研究了具有通用消息集的量子多址接入信道（MAC）上的隐蔽经典通信。具体而言，我们考虑具有任意消息集和任意数量发射机的全量子MAC。我们证明了在此信道上实现正隐蔽速率的可行性，并建立了通用的单次和渐近可达速率区域。对于具有通用消息集的经典 - 量子MAC，当发射机限于确定性编码时，我们确定了隐蔽容量。我们的结果在特殊情况下恢复了关于具有通用消息集的经典MAC上的经典通信、具有两个发射机的经典信道上经典消息的隐蔽通信以及量子MAC上经典通信的已知结果。我们提供了三个MAC的例子，我们的结果可直接或间接应用于这些例子以实现正隐蔽速率。我们首先研究了具有辅助者的有限维MAC上的隐蔽通信。然后分析了具有辅助者的经典高斯MAC并推导其隐蔽容量。最后，我们将分析扩展到具有辅助者的单模玻色子MAC，并表明在此设置中也可实现正隐蔽速率。据我们所知，这是第一项在经典和量子MAC上都实现正速率隐蔽通信的工作。
英文摘要
We study covert classical communication over quantum multiple-access channels (MACs) with general message sets. Specifically, we consider a fully quantum MAC with arbitrary message sets and an arbitrary number of transmitters. We demonstrate the feasibility of achieving a positive covert rate over this channel and establish general one-shot and asymptotic achievable rate regions. For classical-quantum MACs with general message sets, we establish the covert capacity, when the transmitters are restricted to deterministic encoding. Our result recovers, as a special case, known results for classical communication over classical MACs with general message sets, covert communication of a classical message over a classical channel with two transmitters, and classical communication over quantum MACs. We provide three examples of MACs to which our results can be applied, either directly or indirectly, to achieve positive covert rates. Specifically, we first study covert communication over a finite-dimensional MAC with a helper. We then analyze a classical Gaussian MAC with a helper and derive its covert capacity. Finally, we extend the analysis to a single-mode bosonic MAC with a helper and show that positive covert rates can also be achieved in this setting. To the best of our knowledge, this is the first work to achieve positive-rate covert communication over both classical and quantum MACs.
Comments30 pages, two-column, accepted to IEEE Transactions on Information Theory, part of the results was presented at the 2025 IEEE International Symposium on Information Theory
