pith. sign in

arxiv: 2503.21002 · v5 · pith:TMQQ3KTTnew · submitted 2025-03-26 · 🪐 quant-ph · cs.IT· math.IT

Covert Entanglement Generation and Secrecy

classification 🪐 quant-ph cs.ITmath.IT
keywords covertentanglementsecrecygenerationcapacitychannelcommunicationinformation
0
0 comments X
read the original abstract

We determine the covert capacity for entanglement generation over a noisy quantum channel. While secrecy guarantees that the transmitted information remains inaccessible to an adversary, covert communication ensures that the transmission itself remains undetectable. The entanglement dimension follows a square root law (SRL) in the covert setting, i.e., $O(\sqrt{n})$ Einstein-Podolsky-Rosen (EPR) pairs can be distributed covertly and reliably over $n$ channel uses. We begin with covert communication of classical information under a secrecy constraint. We then leverage this result to construct a coding scheme for covert entanglement generation. Single-letter expressions are derived for the covert key-assisted and unassisted secrecy capacities, as well as for the covert entanglement-generation capacity.

This paper has not been read by Pith yet.

discussion (0)

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