Covert Quantum Communication Over Optical Channels
Abstract: We explore covert communication of qubits over the lossy thermal-noise bosonic channel, which is a quantum-mechanical model of many practical channels, including optical. Covert communication ensures that an adversary is unable to detect the presence of transmissions, which are concealed in channel noise. We show a \emph{square root law} (SRL) for quantum covert communication similar to that for classical: $\propto\sqrt{n}$ qubits can be transmitted covertly and reliably over $n$ uses of an optical channel. Our achievability proof uses photonic dual-rail qubit encoding, which has been proposed for long-range repeater-based quantum communication and entanglement distribution. Our converse employs prior covert signal power limit results and adapts well-known methods to upper bound quantum capacity of optical channels. Finally, we believe that the gap between our lower and upper bounds for the number of reliable covert qubits can be mitigated by improving the quantum error correction codes and quantum channel capacity bounds.
- B. A. Bash, D. Goeckel, S. Guha, and D. Towsley, “Hiding information in noise: Fundamental limits of covert wireless communication,” \JournalTitleIEEE Commun. Mag. 53 (2015).
- B. A. Bash, D. Goeckel, and D. Towsley, “Limits of reliable communication with low probability of detection on AWGN channels,” \JournalTitleIEEE J. Sel. Areas Commun. 31, 1921–1930 (2013).
- M. R. Bloch, “Covert communication over noisy channels: A resolvability perspective,” \JournalTitleIEEE Trans. Inf. Theory 62, 2334–2354 (2016).
- L. Wang, G. W. Wornell, and L. Zheng, “Fundamental limits of communication with low probability of detection,” \JournalTitleIEEE Trans. Inf. Theory 62, 3493–3503 (2016).
- B. A. Bash, A. H. Gheorghe, M. Patel, et al., “Quantum-secure covert communication on bosonic channels,” \JournalTitleNat. Commun. 6 (2015).
- M. S. Bullock, C. N. Gagatsos, S. Guha, and B. A. Bash, “Fundamental limits of quantum-secure covert communication over bosonic channels,” \JournalTitleIEEE J. Sel. Areas Commun. 38, 471–482 (2020).
- C. N. Gagatsos, M. S. Bullock, and B. A. Bash, “Covert capacity of bosonic channels,” \JournalTitleIEEE J. Sel. Areas Inf. Theory 1, 555–567 (2020).
- A. Sheikholeslami, B. A. Bash, D. Towsley, et al., “Covert communication over classical-quantum channels,” in Proc. IEEE Int. Symp. Inform. Theory (ISIT), (Barcelona, Spain, 2016).
- M. S. Bullock, A. Sheikholeslami, M. Tahmasbi, et al., “Covert Communication over Classical-Quantum Channels,” arXiv:1601.06826v7 [quant-ph] (2023).
- S. Takeda, T. Mizuta, M. Fuwa, et al., “Deterministic quantum teleportation of photonic quantum bits by a hybrid technique,” \JournalTitleNature 500, 315–318 (2013).
- S. Guha, H. Krovi, C. A. Fuchs, et al., “Rate-loss analysis of an efficient quantum repeater architecture,” \JournalTitlePhys. Rev. A 92, 022357 (2015).
- P. Dhara, D. Englund, and S. Guha, “Entangling quantum memories via heralded photonic bell measurement,” arXiv:2303.03453 [quant-ph] (2023).
- J. M. Arrazola and V. Scarani, “Covert Quantum Communication,” \JournalTitlePhys. Rev. Lett. 117, 250503 (2016).
- M. Tahmasbi and M. R. Bloch, “Framework for covert and secret key expansion over classical-quantum channels,” \JournalTitlePhys. Rev. A 99, 052329 (2019).
- M. Tahmasbi and M. R. Bloch, “Toward undetectable quantum key distribution over bosonic channels,” \JournalTitleIEEE J. Sel. Areas Inf. Theory 1, 585–598 (2020).
- M. Tahmasbi and M. R. Bloch, “Covert and secret key expansion over quantum channels under collective attacks,” \JournalTitleIEEE Trans. Inf. Theory 66, 7113–7131 (2020).
- E. Knill, R. Laflamme, and G. J. Milburn, “A scheme for efficient quantum computation with linear optics,” \JournalTitleNature 409, 46–52 (2001).
- A. S. Holevo, “Entanglement-breaking channels in infinite dimensions,” \JournalTitleProblems of Information Transmission 44, 171–184 (2008).
- C. Weedbrook, S. Pirandola, R. García-Patrón, et al., “Gaussian quantum information,” \JournalTitleRev. Mod. Phys. 84, 621–669 (2012).
- K. Temme, M. J. Kastoryano, M. Ruskai, et al., “The χ2superscript𝜒2\chi^{2}italic_χ start_POSTSUPERSCRIPT 2 end_POSTSUPERSCRIPT-divergence and mixing times of quantum Markov processes,” \JournalTitleJ. Math. Phys. 51, 122201 (2010).
- S. Kumar, R. Calderbank, and H. D. Pfister, “Reed-muller codes achieve capacity on the quantum erasure channel,” in 2016 Proc. IEEE Int. Symp. Inform. Theory, (2016), pp. 1750–1754.
- S. Khatri, K. Sharma, and M. M. Wilde, “Information-theoretic aspects of the generalized amplitude-damping channel,” \JournalTitlePhys. Rev. A 102, 012401 (2020).
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.