Visible to the public Capacity Theorems for Covert Bosonic Channels

TitleCapacity Theorems for Covert Bosonic Channels
Publication TypeConference Paper
Year of Publication2021
AuthorsBullock, Michael S., Gagatsos, Christos N., Bash, Boulat A.
Conference Name2020 IEEE Information Theory Workshop (ITW)
Keywordschannel capacity, composability, compositionality, Conferences, covert channels, Information theory, pubcrawl, Quantum entanglement, Receivers, reliability theory, resilience, Resiliency, Scalability
AbstractWe study quantum-secure covert-communication over lossy thermal-noise bosonic channels, the quantum mechanical model for many practical channels. We derive the expressions for the covert capacity of these channels: Lno-EA, when Alice and Bob share only a classical secret, and LEA, when they benefit from entanglement assistance. Entanglement assistance alters the fundamental scaling law for covert communication. Instead of Lno-EA$\surd$n-rno-EA(n), rno-EA(n) = o($\surd$n), entanglement assistance allows LEA$\surd$n log n - rEA(n), rEA(n) = o($\surd$n log n), covert bits to be transmitted reliably over n channel uses. However, noise in entanglement storage erases the log n gain from our achievability; work on the matching converse is ongoing.
DOI10.1109/ITW46852.2021.9457618
Citation Keybullock_capacity_2021