Pith. sign in

REVIEW

Entanglement-Assisted Covert Communication via Qubit Depolarizing Channels

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2305.05477 v2 pith:M27XODOK submitted 2023-05-09 quant-ph cs.ITmath.IT

Entanglement-Assisted Covert Communication via Qubit Depolarizing Channels

classification quant-ph cs.ITmath.IT
keywords sqrtchannelcommunicationcovertdepolarizingqubitassistancebits
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We consider entanglement-assisted communication over the qubit depolarizing channel under the security requirement of covert communication, where not only the information is kept secret, but the transmission itself must be concealed from detection by an adversary. Previous work showed that $O(\sqrt{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(\sqrt{n}\log(n))$ for continuous-variable bosonic channels. Here, we present a finite-dimensional parallel, and show that $O(\sqrt{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 their squared amplitude scales as $O(1/\sqrt{n})$.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.