TY - GEN
T1 - Covert communication over classical-quantum channels
AU - Sheikholeslami, Azadeh
AU - Bash, Boulat A.
AU - Towsley, Don
AU - Goeckel, Dennis
AU - Guha, Saikat
N1 - Publisher Copyright:
© 2016 IEEE.
PY - 2016/8/10
Y1 - 2016/8/10
N2 - Recently, the fundamental limits of covert, i.e., reliable-yet-undetectable, communication have been established for general memoryless channels and for lossy-noisy bosonic (quantum) channels with a quantum-limited adversary. The key import of these results was the square-root law (SRL) for covert communication, which states that O(√n) covert bits, but no more, can be reliably transmitted over n channel uses with O(√n) bits of secret pre-shared between communicating parties. Here we prove the achievability of the SRL for a general memoryless classical-quantum channel, showing that SRL covert communication is achievable over any quantum communication channel with a product-state transmission strategy. We leave open the converse, which, if proven, would show that even using entangled transmissions and entangling measurements, the SRL for covert communication cannot be surpassed over an arbitrary quantum channel.
AB - Recently, the fundamental limits of covert, i.e., reliable-yet-undetectable, communication have been established for general memoryless channels and for lossy-noisy bosonic (quantum) channels with a quantum-limited adversary. The key import of these results was the square-root law (SRL) for covert communication, which states that O(√n) covert bits, but no more, can be reliably transmitted over n channel uses with O(√n) bits of secret pre-shared between communicating parties. Here we prove the achievability of the SRL for a general memoryless classical-quantum channel, showing that SRL covert communication is achievable over any quantum communication channel with a product-state transmission strategy. We leave open the converse, which, if proven, would show that even using entangled transmissions and entangling measurements, the SRL for covert communication cannot be surpassed over an arbitrary quantum channel.
UR - http://www.scopus.com/inward/record.url?scp=84985898390&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84985898390&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2016.7541662
DO - 10.1109/ISIT.2016.7541662
M3 - Conference contribution
AN - SCOPUS:84985898390
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 2064
EP - 2068
BT - Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2016 IEEE International Symposium on Information Theory, ISIT 2016
Y2 - 10 July 2016 through 15 July 2016
ER -