Skip to main content
SpringerLink
Log in

Inner bounds via simultaneous decoding in quantum network information theory

  • Published:
Sādhanā Aims and scope Submit manuscript

Abstract

We prove new inner bounds for several multiterminal channels with classical inputs and quantum outputs. Our inner bounds are all proved in the one-shot setting and are natural analogues of the best classical inner bounds for the respective channels. For some of these channels, similar quantum inner bounds were unknown even in the asymptotic independent and identically distributed setting. We prove our inner bounds by appealing to a new classical–quantum joint typicality lemma established in a companion paper. This lemma allows us to lift to the quantum setting many inner bound proofs for classical multiterminal channels that use intersections and unions of typical sets.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Figure 1
Figure 2
Figure 3
Figure 4

We’re sorry, something doesn't seem to be working properly.

Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Notes

  1. Journal version of [9].

References

  1. Sen P 2018 A one shot quantum joint typicality lemma. Available at arXiv: 1806.07278

    Google Scholar 

  2. El Gamal A and Kim Y 2012 Network information theory. Cambridge University Press

    Google Scholar 

  3. Fawzi O, Hayden P, Savov I, Sen P and Wilde 2012 Classical communication over a quantum interference channel. IEEE Transactions on Information Theory 58: 3670–3691

    Article  MathSciNet  Google Scholar 

  4. Sen P 2012 Achieving the Han–Kobayashi inner bound for the quantum interference channel. In: Proceedings of the IEEE International Symposium on Information Theory (ISIT), pp. 736–740, full version at arXiv: 1109.0802.

  5. Qi H, Wang Q and Wilde M 2018 Applications of position-based coding to classical communication over quantum channels. Journal of Physics A: Mathematical and Theoretical 51: 444002:1–444002:42

  6. Winter A 2001 The capacity of the quantum multiple-access channel. IEEE Transactions on Information Theory 47: 3059–3065

    Article  MathSciNet  Google Scholar 

  7. Han T and Kobayashi K 1981 A new achievable rate region for the interference channel. IEEE Transactions on Information Theory 27: 49–60

    Article  MathSciNet  Google Scholar 

  8. Hirche C, Morgan C and Wilde M 2016 Polar codes in network quantum information theory. IEEE Transactions on Information Theory 62: 915–924

    Article  MathSciNet  Google Scholar 

  9. Sen P 2018 Inner bounds via simultaneous decoding in quantum network information theory. Available at arXiv: 1806.07276

  10. Marton K 1979 A coding theorem for the discrete memoryless broadcast channel. IEEE Transactions on Information Theory 25: 306–311

    Article  MathSciNet  Google Scholar 

  11. Chong H, Motani M, Garg H and El Gamal H 2008 On the Han–Kobayashi region for the interference channel. IEEE Transactions on Information Theory 54: 3188–3195

  12. Winter A 1999 Coding theorem and strong converse for quantum channels. IEEE Transactions on Information Theory 45:2481–2485

    Article  MathSciNet  Google Scholar 

  13. Ogawa T and Nagaoka H 2002 A new proof of the channel coding theorem via hypothesis testing in quantum information theory. In: Proceedings of the IEEE International Symposium on Information Theory (ISIT), pp. 73–73, full version at arXiv:quant-ph/0208139

  14. Wang L and Renner R 2012 One-shot classical-quantum capacity and hypothesis testing. Physical Review Letters 108: 2005:1–2005:5

  15. Buscemi F and Datta N 2010 The quantum capacity of channels with arbitrarily correlated noise. IEEE Transactions on Information Theory 56: 1447–1460

    Article  MathSciNet  Google Scholar 

  16. Brandão F and Datta N 2011 One-shot rates for entanglement manipulation under non-entangling maps. IEEE Transactions on Information Theory 57: 1754–1760

    Article  MathSciNet  Google Scholar 

  17. Datta N 2009 Min- and max-relative entropies and a new entanglement monotone. IEEE Transactions on Information Theory 55: 2816–2826

    Article  MathSciNet  Google Scholar 

  18. Anshu A, Jain R and Warsi N 2019 Building blocks for communication over noisy quantum networks. IEEE Transactions on Information Theory 65: 1287–1306

    Article  MathSciNet  Google Scholar 

  19. Radhakrishnan J, Sen P and Warsi N 2016 One shot Marton inner bound for classical quantum broadcast channel. IEEE Transactions on Information Theory 62: 2836–2848

    Article  MathSciNet  Google Scholar 

  20. Belavkin V 1975 Optimal multiple quantum statistical hypothesis testing. Stochastics 1: 315–345

    Article  MathSciNet  Google Scholar 

  21. Belavkin V 1975 Radiotekhnika i Electronika 20: 1177–1185 English translation: “Optimal distinction of non-orthogonal quantum signals”. Radio Engineering and Electronic Physics 20: 39–47

  22. Hayashi M and Nagaoka H 2003 General formulas for capacity of classical–quantum channels. IEEE Transactions on Information Theory 49: 1753–1768

  23. Liu J, Cuff P and Verdú S 2015 One-shot mutual covering lemma and Marton’s inner bound with a common message. In: Proceedings of the IEEE International Symposium on Information Theory (ISIT), pp. 1457–1461, full version at arXiv: 1504.04092

  24. Cover T 1972 Broadcast channels. IEEE Transactions on Information Theory 18: 2–14

    Article  MathSciNet  Google Scholar 

  25. Bergmans P 1973 Random coding theorem for broadcast channels with degraded components. IEEE Transactions on Information Theory 19: 197–207

    Article  MathSciNet  Google Scholar 

  26. Savov I and Wilde M 2015 Classical codes for quantum broadcast channels. IEEE Transactions on Information Theory 61: 1–12

    Article  MathSciNet  Google Scholar 

  27. Hirche C and Morgan C 2015 An improved rate region for the classical–quantum broadcast channel. In: Proceedings of the IEEE International Symposium on Information Theory (ISIT), pp. 2782–2786, full version at arXiv: 1501.07417

  28. Anshu A, Jain R and Warsi N 2019 On the near-optimality of one-shot classical communication over quantum channels. Journal of Mathematical Physics 60: 012204:1–012204:19

  29. Ding D, Gharibyan H, Hayden P and Walter M 2020 A quantum multiparty packing lemma and the relay channel. IEEE Transactions on Information Theory 66: 3500–3519

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

I thank Professors Patrick Hayden, David Ding and Hrant Gharibyan for useful discussions, and Dr. Mark Wilde for pointers to important references. I am grateful to the anonymous referees of an earlier version of the paper, whose comments helped greatly in improving the presentation.

Author information

Authors and Affiliations

  1. School of Technology and Computer Science, Tata Institute of Fundamental Research, Mumbai, 400005, India

    Pranab Sen

Authors
  1. Pranab Sen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Pranab Sen.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Sen, P. Inner bounds via simultaneous decoding in quantum network information theory. Sādhanā 46, 18 (2021). https://doi.org/10.1007/s12046-020-01517-9

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s12046-020-01517-9

Keywords

Search

Navigation