

















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.
| Subjects: | Quantum Physics (quant-ph); Information Theory (cs.IT) |
| Cite as: | arXiv:2503.21002 [quant-ph] |
| (or arXiv:2503.21002v5 [quant-ph] for this version) | |
| https://doi.org/10.48550/arXiv.2503.21002 arXiv-issued DOI via DataCite |
|
| Related DOI: | https://doi.org/10.1109/TIT.2026.3689208
DOI(s) linking to related resources |
From: Uzi Pereg [view email]
[v1]
Wed, 26 Mar 2025 21:34:18 UTC (40 KB)
[v2]
Sat, 1 Nov 2025 11:49:58 UTC (46 KB)
[v3]
Wed, 7 Jan 2026 18:02:05 UTC (56 KB)
[v4]
Tue, 20 Jan 2026 12:35:25 UTC (57 KB)
[v5]
Tue, 26 May 2026 10:36:22 UTC (69 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。