Abstract
We consider entanglement-assisted communication over the qubit depolarizing channel under the security requirement of covert communication, where the transmission itself must be concealed from detection by an adversary. Previous work showed that O(√ n) information bits can be reliably and covertly transmitted in n channel uses without entanglement assistance. However, Gagatsos et al. (2020) showed that entanglement assistance can increase this scaling to O(√ n log n) for continuous-variable bosonic channels. Here, we present a finite-dimensional parallel, and show that O(√ n log n) covert bits can be transmitted reliably over n uses of a qubit depolarizing channel. The coding scheme employs 'weakly' entangled states such that the squared amplitude scales as O(1/√ n).
Original language | English |
---|---|
Journal | IEEE Transactions on Information Theory |
DOIs | |
State | Accepted/In press - 2025 |
Keywords
- Quantum communication
- covert communication
- entanglement assistance
- square-root law violation
All Science Journal Classification (ASJC) codes
- Information Systems
- Computer Science Applications
- Library and Information Sciences