Keyless Covert Communication Over Quantum MACs with General Message Sets

• URL: http://arxiv.org/abs/2607.08898v1
• Date: Thu, 09 Jul 2026 19:40:38 GMT
• Title: Keyless Covert Communication Over Quantum MACs with General Message Sets
• Abstract summary: We study covert classical communication over quantum multiple-access channels (MACs) with general message sets.<n>We demonstrate the feasibility of achieving a positive covert rate over this channel and establish general one-shot and achievable rate regions.<n>This is the first work to achieve positive-rate covert communication over both classical and quantum MACs.
• Score: 11.619051850120044
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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.

Related papers

• Quantum Advantage in Multiple Access Wiretap Channels with Entangled Transmitters [11.619051850120044]
  We investigate secure communication over a classical multiple-access wiretap channel (MAC-WTC)<n>Under the strict semantic security criterion, we derive an achievable rate region and a regularized expression for the secrecy capacity.<n>Our results demonstrate that entanglement strictly enlarges the secrecy capacity of MAC-WTC compared to sharing only classical correlated randomness.
  arXiv  Detail & Related papers  (2026-09-06T19:58:13Z)
• Simultaneous Classical and Quantum Communications: Recent Progress and Three Challenges [52.931372025288844]
  We explore novel protocols that enable simultaneous classical and quantum communications.<n>We extend quantum communication capabilities beyond traditional optical bands into the terahertz.<n>We identify open problems that must be addressed to facilitate practical implementation.
  arXiv  Detail & Related papers  (2025-12-11T00:27:08Z)
• Classical Feedback in a Quantum Network [14.303513951759818]
  An achievable rate region is derived using superposition block Markov coding and a quantum multiparty lemma.<n>As an example, we show that the quantum binary adder MAC can benefit from feedback.
  arXiv  Detail & Related papers  (2025-09-19T18:22:01Z)
• The Multiple-Access Channel with Entangled Transmitters [67.92544792239086]
  Communication over a classical multiple-access channel (MAC) with entanglement resources is considered.<n>We establish inner and outer bounds on the capacity region for the general MAC with entangled transmitters.<n>Using superdense coding, entanglement can double the conferencing rate.
  arXiv  Detail & Related papers  (2023-03-18T16:51:08Z)
• The Quantum Multiple-Access Channel with Cribbing Encoders [58.3253106667749]
  Communication over a quantum multiple-access channel (MAC) with cribbing encoders is considered.<n>Based on the no-cloning theorem, perfect cribbing is impossible.<n>A partial decode-forward region is derived for a quantum MAC with non-robust cribbing.
  arXiv  Detail & Related papers  (2021-11-30T17:31:48Z)
• Computation-aided classical-quantum multiple access to boost network communication speeds [61.12008553173672]
  We quantify achievable quantum communication rates of codes with computation property for a two-sender cq-MAC. We show that it achieves the maximum possible communication rate (the single-user capacity), which cannot be achieved with conventional design.
  arXiv  Detail & Related papers  (2021-05-30T11:19:47Z)
• Capacities of Gaussian Quantum Channels with Passive Environment Assistance [0.0]
  Passive environment assisted communication takes place via a quantum channel modeled as a unitary interaction between the information carrying system and an environment. We consider both quantum communication and classical communication with helper, as well as classical communication with free classical coordination between sender and helper.
  arXiv  Detail & Related papers  (2021-01-03T10:33:43Z)
• Secure Two-Party Quantum Computation Over Classical Channels [63.97763079214294]
  We consider the setting where the two parties (a classical Alice and a quantum Bob) can communicate only via a classical channel. We show that it is in general impossible to realize a two-party quantum functionality with black-box simulation in the case of malicious quantum adversaries. We provide a compiler that takes as input a classical proof of quantum knowledge (PoQK) protocol for a QMA relation R and outputs a zero-knowledge PoQK for R that can be verified by classical parties.
  arXiv  Detail & Related papers  (2020-10-15T17:55:31Z)
• Permutation Enhances Classical Communication Assisted by Entangled States [67.12391801199688]
  We show that the capacity satisfies the strong converse property and thus the formula serves as a sharp dividing line between achievable and unachievable rates of communication. As examples, we derive analytically the classical capacity of various quantum channels of interests.
  arXiv  Detail & Related papers  (2020-01-07T01:49:31Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.