Abstract
We consider the compound memoryless quantum multiple-access channel (QMAC) with two sending terminals. In this model, the transmission is governed by the memoryless extensions of a completely positive and trace preserving map which can be any element of a prescribed set of possible maps. We study a communication scenario, where one of the senders aims for transmission of classical messages, while the other sender sends quantum information. Combining powerful universal random coding results for classical and quantum information transmission over point-to-point channels, we establish universal codes for the mentioned two-sender task. Conversely, we prove that the two-dimensional rate region achievable with these codes is optimal. In consequence, we obtain a multi-letter characterization of the capacity region of each compound QMAC for the considered transmission task.
Similar content being viewed by others
References
Ahlswede, R., Wolfowitz, J.: The structure of capacity functions for compound channels. In: Proceedings if the International Symposium on Probability and Information Theory at McMaster University, pp. 12–54 (1969). Z. f. Wahrscheinlichkeitstheorie verw. Gebiete 44, 159–175 (1978)
Ahlswede, R.: Elimination of correlation in random codes for arbitrarily varying channels. Z. f. Wahrscheinlichkeitstheorie verw. Gebiete 44, 159–175 (1978)
Ahlswede, R.: Multi-way communication channels. In: Proceedings of the 2nd International Symposium on Information Theory, pp. 23–52 (1973)
Ahlswede, R., Cai, N.: Arbitrarily varying multiple-access channels, part I - Ericson’s symmetrizability is adequate, Gubner’s conjecture is true. IEEE Trans. Inf. Theory 45, 742–749 (1999)
Ahlswede, R.: Transmitting and Gaining Data–Rudolf Ahlswede’s Lectures on Information Theory 2. Springer, New York (2015)
Alicki, R., Fannes, M.: Continuity of quantum conditional information. J. Phys. A. Math. Gen. 37, L55–L57 (2004)
Bennett, C.H., Shor, P.W., Smolin, J.A., Thapliyal, A.V.: Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem. IEEE Trans. Inf. Theory 48, 2637–2655 (2002)
Bjelaković, I., Boche, H.: Classical capacities of compound and averaged quantum channels. IEEE Trans. Inf. Theory 55, 3360–3374 (2009)
Bjelaković, I., Boche, H., Janßen, G., Nötzel, J.: Arbitrarily Varying and Compound Classical-Quantum Channels and a Note on Quantum Zero-Error Capacities. Information Theory, Combinatorics, and Search Theory. In: Memory of Rudolf Ahlswede, Aydinian, H., Cicalese, F., Deppe, C. (eds.) LNCS, vol. 7777, pp. 247–283. Springer, New York (2013)
Bjelakovic, I., Boche, H., Nötzel, J.: Quantum capacity of a class of compound channels. Phys. Rev. A 78, 042331 (2008)
Bjelakovic, I., Boche, H., Nötzel, J.: Entanglement transmission and generation under channel uncertainty: universal quantum channel coding. Commun. Math. Phys. 292, 55–97 (2009)
Bjelakovic, I., Boche, H., Sommerfeld, J.: Secrecy results for compound wiretap channels. Probl. Inf. Trans. 49, 73–98 (2013)
Boche, H., Cai, M., Deppe, C.: Secrecy capacities of compound quantum wiretap channels and applications. Phys. Rev. A 89, 052320 (2014)
Boche, H., Janßen, G., Saeedinaeeni, S.: Simultaneous transmission of classical and quantum information under channel uncertainty and jamming attacks. J. Math. Phys. 60, 022204 (2019)
Csiszár, I., Körner, J.: Information Theory -Coding Theorems for Discrete Memoryless Systems, 2nd edn. Cambridge University Press, Cambridge (2011)
Datta, N., Hsieh, M.-H.: Universal coding for transmission of private information. J. Math. Phys. 51, 122202 (2010)
Devetak, I., Shor, P.W.: The capacity of a quantum channel for simultaneous transmission of classical and quantum information. Commun. Math. Phys. 256, 287–303 (2005)
Devetak, I.: The private classical capacity and the quantum capacity of a quantum channel. IEEE Trans. Inf. Theory 51, 44–55 (2005)
Dueck, G.: Maximal error regions are strictly smaller than average error regions for multi-user channels. Probl. Control Inf. Theory 7, 11–19 (1978)
Dynes, J.F., et al.: Ultra-high bandwidth quantum secured data transmission. Sci. Rep. 6, 35149 (2016)
Gross, D., Audenaert, K., Eisert, J.: Evenly distributed unitaries: on the structure of unitary designs. J. Math. Phys. 48, 052105 (2007)
Hayashi, M.: Universal coding for classical-quantum channel. Commun. Math. Phys. 289, 1087–1098 (2009)
Hayashi, M., Nagaoka, H.: General formulas for capacity of classical-quantum channels. IEEE Trans. Inf. Theory 49, 1753–1768 (2003)
Hayden, P., Horodecki, M., Winter, A., Yard, J.: A decoupling approach to the quantum capacity. Open Syst. Inf. Dyn. 15, 7–19 (2008)
Hirche, C., Morgan, C., Wilde, M.M.: Polar codes in network quantum information theory. IEEE Trans. Inf. Theory 62(2), 915–924 (2016)
Holevo, A.: The capacity of quantum communication channel with general signal states. IEEE Trans. Inf. Theory 44, 269–272 (1998)
Horodecki, M., Oppenheim, J., Winter, A.: Quantum state merging and negative information. Commun. Math. Phys. 269, 107–136 (2007)
Hsieh, M.-H., Wilde, M.M.: Entanglement-assisted communication of classical and quantum information. IEEE Trans. Inf. Theory 56, 4682–4704 (2010)
Jahn, J.-H.: Coding of arbitrarily varying multiuser channels. IEEE Trans. Inf. Theory 27, 212–226 (1981)
Liao, H.J.: Multiple Access Channels. University of Hawaii, Honolulu, Dept. of Electrical Engineering, Phd. Thesis (1972)
Klesse, R.: Approximate quantum error correction, random codes, and quantum channel capacity. Phys. Rev. A 75, 062315 (2007)
Mosonyi, M., Datta, N.: Generalized relative entropies and the capacity of classical-quantum channels. J. Math. Phys. 50, 072104 (2009)
Mosonyi, M.: Coding theorems for compound problems via quantum Rényi divergences. IEEE Trans. Inf. Theory 61, 2997–3012 (2015)
Schumacher, B., Westmoreland, M.D.: Sending classical information via noisy quantum channel. Phys. Rev. A 56, 131–138 (1997)
Winter, A.: Coding theorem and strong converse for quantum channels. IEEE Trans. Inf. Theory 45, 2481–2485 (1999)
Winter, A.: The capacity of the quantum multiple-acess channel. IEEE Trans. Inf. Theory 47, 3059–3065 (2001)
Winter, A.: Tight uniform continuity bounds for quantum entropies: conditional entropy, relative entropy distance and energy constraints. Commun. Math. Phys. 347, 291–313 (2016)
Yard, J., Devetak, I., Hayden, P.: Capacity theorems for quantum multiple access channels. In: Proceedings of International Symposium on Information Theory, pp. 884–888 (2005)
Yard, J., Devetak, I., Hayden, P.: Capacity theorems for quantum multiple-access channels: classical–quantum and quantum–quantum capacity regions. IEEE Trans. Inf. Theory 54, 3091–3113 (2008)
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
H. Boche is partly supported by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy EXC-2111 390814868 and the Gottfried Wilhelm Leibniz Prize of the DFG under Grant BO 1734/20-1. G. Janßen is partly supported by the Bundesministerium für Bildung und Forschung (BMBF, German Federal Ministry of Education and Research) project QuaDiQua under grant 16KIS0948. S. Saeedinaeeni is partly supported by the BMBF project Q.Link.X under grant16KIS0858. Parts of the present work were presented at the VDETUM QuaDiQua project meeting at the Walter Schottky Institute, TU Munich (December 2018).
Appendices
Auxiliary results
For the convenience of the reader, some auxiliary standard results used in the text are collected.
Lemma 3
(Gentle measurement lemma [35]) Let \(\rho \in \mathcal {S}(\mathcal {K})\), \(E \in \mathcal {L}(\mathcal {H})\), \(0 \le E \le \mathbb {1}_{\mathcal {H}}\). It holds
Lemma 4
[39] Let \(\Psi , \rho , \sigma \in \mathcal {S}(\mathcal {K})\) be states, where \(\Psi \) is pure. Then
Lemma 5
[39] Let \(\Psi \in \mathcal {S}(\mathcal {K}_A), \rho \in \mathcal {S}(\mathcal {K}_B), \sigma \in \mathcal {S}(\mathcal {K}_{A} \otimes \mathcal {K}_B)\) Then
Lemma 6
[6, 37] Let \(\rho , \sigma \in \mathcal {S}(\mathcal {K}_{A} \otimes \mathcal {K}_B)\), \(\Vert \rho - \sigma \Vert _1 \le \epsilon \le 1\). Then
where \(h(x) = - x \log x - (1-x) \log (1-x)\), \(s \in (0,1)\) is the binary Shannon entropy.
Convexity of the capacity formula
In this appendix, we show that the functional expressions in Theorem 3 do not need further convexification. Following the arguments given in [39] for the case of a perfectly known QMAC, we show that for given \(\mathfrak {M}\subset \mathcal {C}(\mathcal {H}_A \otimes \mathcal {H}_B, \mathcal {H}_C)\), the set
is convex, i.e. we show
Lemma 7
Let \(\mathfrak {M}\in \mathcal {C}(\mathcal {H}_A \otimes \mathcal {H}_B, \mathcal {H}_C)\). It holds
Proof
We have to show that for each \(\lambda \in (0,1)\), and any two rate pairs \((R_1^{(i)},R_2^{(i)}) \in \hat{C}_1(\mathfrak {M})\), \(i = 1,2\), the their convex combination \((\overline{R}_1, \overline{R}_2)\) with \(\overline{R}_j^{(i)} = \lambda R_j^{(1)} + (1- \lambda ) R_j^{(2)}\) for \(i = 1,2\) is also a member of \(\hat{C}_1(\mathfrak {M})\). Assume
for some \(l_i, p_i, V_i, \Psi _i\), i.e. with effective states
according to (3), the equations
are fulfilled. Fix \(\delta > 0\), and let \(k,n \in \mathbb {N}\), \(0< k < n\) such that
Set \(t_1 := k l_2\), \(t_2 := (n-k) l_1\). With
which is unitarily equivalent to
we have
where the second and third equalities above are by additivity of the quantum mutual information evaluated on product states, and the inequality is by (62). Consequently, we have
In a similar manner, also the inequality
is verified. By (72) and (73),
Since \(\delta > 0\) can be chosen arbitrarily, the claim of the lemma follows. \(\square \)
Rights and permissions
About this article
Cite this article
Boche, H., Janßen, G. & Saeedinaeeni, S. Universal random codes: capacity regions of the compound quantum multiple-access channel with one classical and one quantum sender. Quantum Inf Process 18, 246 (2019). https://doi.org/10.1007/s11128-019-2358-7
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s11128-019-2358-7