{"title":"Entanglement-Assisted Covert Communication via Qubit Depolarizing Channels","authors":"Elyakim Zlotnick;Boulat A. Bash;Uzi Pereg","doi":"10.1109/TIT.2025.3546191","DOIUrl":null,"url":null,"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 <inline-formula> <tex-math>$O(\\sqrt {n})$ </tex-math></inline-formula> information bits can be reliably and covertly transmitted in <italic>n</i> channel uses without entanglement assistance. However, Gagatsos et al. (2020) showed that entanglement assistance can increase this scaling to <inline-formula> <tex-math>$O(\\sqrt {n}\\log {n})$ </tex-math></inline-formula> for continuous-variable bosonic channels. Here, we present a finite-dimensional parallel, and show that <inline-formula> <tex-math>$O(\\sqrt {n}\\log {n})$ </tex-math></inline-formula> covert bits can be transmitted reliably over <italic>n</i> uses of a qubit depolarizing channel. The coding scheme employs “weakly” entangled states such that their squared amplitude scales as <inline-formula> <tex-math>$O\\left ({{{\\scriptstyle \\text {}^{\\scriptstyle 1}}\\hspace {-0.224em}/\\hspace {-0.112em}{\\scriptstyle \\sqrt {n}}}}\\right)$ </tex-math></inline-formula>.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 5","pages":"3693-3706"},"PeriodicalIF":2.2000,"publicationDate":"2025-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10906331","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Information Theory","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10906331/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0
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(\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\left ({{{\scriptstyle \text {}^{\scriptstyle 1}}\hspace {-0.224em}/\hspace {-0.112em}{\scriptstyle \sqrt {n}}}}\right)$ .
期刊介绍:
The IEEE Transactions on Information Theory is a journal that publishes theoretical and experimental papers concerned with the transmission, processing, and utilization of information. The boundaries of acceptable subject matter are intentionally not sharply delimited. Rather, it is hoped that as the focus of research activity changes, a flexible policy will permit this Transactions to follow suit. Current appropriate topics are best reflected by recent Tables of Contents; they are summarized in the titles of editorial areas that appear on the inside front cover.