Entanglement-Assisted Bosonic MAC: Achievable Rates and Covert Communication
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866918313515286528 |
|---|---|
| author | Shen, Yu-Chen Bloch, Matthieu R. |
| author_facet | Shen, Yu-Chen Bloch, Matthieu R. |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_21869 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Entanglement-Assisted Bosonic MAC: Achievable Rates and Covert Communication Shen, Yu-Chen Bloch, Matthieu R. Quantum Physics Information Theory 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. |
| title | Entanglement-Assisted Bosonic MAC: Achievable Rates and Covert Communication |
| topic | Quantum Physics Information Theory |
| url | https://arxiv.org/abs/2601.21869 |