Entanglement-Assisted Bosonic MAC: Achievable Rates and Covert Communication

• URL: http://arxiv.org/abs/2601.21869v1
• Date: Thu, 29 Jan 2026 15:37:51 GMT
• Title: Entanglement-Assisted Bosonic MAC: Achievable Rates and Covert Communication
• Authors: Yu-Chen Shen, Matthieu R. Bloch,
• Abstract summary: We consider the problem of covert communication over the entanglement-assisted (EA) bosonic multiple access channel (MAC)<n>We derive a closed-form achievable rate region for the general EA bosonic MAC using high-order phase-shift keying (PSK) modulation.<n>Our analysis reveals that the joint covertness constraint imposes a linear trade-off between the senders throughput.
• Score: 13.757786051136897
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We consider the problem of covert communication over the entanglement-assisted (EA) bosonic multiple access channel (MAC). We derive a closed-form achievable rate region for the general EA bosonic MAC using high-order phase-shift keying (PSK) modulation. Specifically, we demonstrate that in the low-photon regime the capacity region collapses into a rectangle, asymptotically matching the point-to-point capacity as multi-user interference vanishes. We also characterize an achievable covert throughput region, showing that entanglement assistance enables an aggregate throughput scaling of \(O(\sqrt{n} \log n)\) covert bits with the block length $n$ for both senders, surpassing the square-root law as in the point-to-point case. Our analysis reveals that the joint covertness constraint imposes a linear trade-off between the senders throughput.

Related papers

• Generalizing GNNs with Tokenized Mixture of Experts [75.8310720413187]
  We show that improving stability requires reducing reliance on shift-sensitive features, leaving an irreducible worst-case generalization floor.<n>We propose STEM-GNN, a pretrain-then-finetune framework with a mixture-of-experts encoder for diverse computation paths.<n>Across nine node, link, and graph benchmarks, STEM-GNN achieves a stronger three-way balance, improving robustness to degree/homophily shifts and to feature/edge corruptions while remaining competitive on clean graphs.
  arXiv  Detail & Related papers  (2026-02-09T22:48:30Z)
• Rethinking Multi-Condition DiTs: Eliminating Redundant Attention via Position-Alignment and Keyword-Scoping [61.459927600301654]
  Multi-condition control is bottlenecked by the conventional concatenate-and-attend'' strategy.<n>Our analysis reveals that much of this cross-modal interaction is spatially or semantically redundant.<n>We propose Position-aligned and Keyword-scoped Attention (PKA), a highly efficient framework designed to eliminate these redundancies.
  arXiv  Detail & Related papers  (2026-02-06T16:39:10Z)
• Fundamental Limitations of QAOA on Constrained Problems and a Route to Exponential Enhancement [0.2578242050187029]
  We study fundamental limitations of the generic Quantum Approximate Optimization Algorithm (QAOA) on constrained problems.<n>We present a provable route to exponential improvements via constraint embedding.<n>Thanks to the problem algorithm co design in the kernel construction, the techniques and guarantees extend beyond permutations to a broad class of NP-Hard constrained optimization problems.
  arXiv  Detail & Related papers  (2025-11-21T14:04:01Z)
• Scalable Fluxonium-Transmon Architecture for Error Corrected Quantum Processors [0.0]
  We propose a hybrid quantum computing architecture composed of alternating fluxonium and transmon qubits.<n>We show that this system offers excellent scaling properties, characterized by engineered zero $ZZ$-crosstalk in the idle regime.<n>For the implementation of error correcting codes, our approach can leverage the long coherence times and large non-linearities of fluxoniums as data qubits.
  arXiv  Detail & Related papers  (2025-08-12T18:20:05Z)
• Flagged Extensions and Numerical Simulations for Quantum Channel Capacity: Bridging Theory and Computation [0.0]
  I will investigate the capacities of noisy quantum channels through a combined analytical and numerical approach.<n>I introduce novel flagged extension techniques that embed a channel into a higher-dimensional space.<n>My results refine previous bounds and clarify noise thresholds beyond which quantum transmission vanishes.
  arXiv  Detail & Related papers  (2025-06-03T22:21:08Z)
• Continuous K-Max Bandits [54.21533414838677]
  We study the $K$-Max multi-armed bandits problem with continuous outcome distributions and weak value-index feedback.<n>This setting captures critical applications in recommendation systems, distributed computing, server scheduling, etc.<n>Our key contribution is the computationally efficient algorithm DCK-UCB, which combines adaptive discretization with bias-corrected confidence bounds.
  arXiv  Detail & Related papers  (2025-02-19T06:37:37Z)
• Rethinking Transformer-Based Blind-Spot Network for Self-Supervised Image Denoising [94.09442506816724]
  Blind-spot networks (BSN) have been prevalent neural architectures in self-supervised image denoising (SSID)<n>We build a Transformer-based Blind-Spot Network (TBSN) which shows strong local fitting and global perspective abilities.
  arXiv  Detail & Related papers  (2024-04-11T15:39:10Z)
• Quantum Broadcast Channel Simulation via Multipartite Convex Splitting [25.103483428654375]
  Communication cost of quantum broadcast channel simulation is characterized by an efficiently computable single-letter formula. New one-shot achievability result for multipartite quantum state splitting via multipartite convex splitting is presented.
  arXiv  Detail & Related papers  (2023-04-24T12:48:17Z)
• 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)
• Computable limits of optical multiple-access communications [1.14219428942199]
  Communication rates over quantum channels can be boosted by entanglement. Superadditivity refers to the capacity improvement from entangling inputs across multiple channel uses. We show that entanglement-assisted capacity of a single-sender and single-receiver channel is additive.
  arXiv  Detail & Related papers  (2021-10-04T19:27:59Z)
• Low-Latency Federated Learning over Wireless Channels with Differential Privacy [142.5983499872664]
  In federated learning (FL), model training is distributed over clients and local models are aggregated by a central server. In this paper, we aim to minimize FL training delay over wireless channels, constrained by overall training performance as well as each client's differential privacy (DP) requirement.
  arXiv  Detail & Related papers  (2021-06-20T13:51:18Z)

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.