Weak Locking Capacity of Quantum Channels Can be Much Larger Than Private Capacity
- 361 Downloads
We show that it is possible for the so-called weak locking capacity of a quantum channel (Guha et al. in Phys Rev X 4:011016, 2014) to be much larger than its private capacity. Both reflect different ways of capturing the notion of reliable communication via a quantum system while leaking almost no information to an eavesdropper; the difference is that the latter imposes an intrinsically quantum security criterion whereas the former requires only a weaker, classical condition. The channels for which this separation is most straightforward to establish are the complementary channels of classical-quantum (cq-)channels and, hence, a subclass of Hadamard channels. We also prove that certain symmetric channels (related to photon number splitting) have positive weak locking capacity in the presence of a vanishingly small pre-shared secret, whereas their private capacity is zero. These findings are powerful illustrations of the difference between two apparently natural notions of privacy in quantum systems, relevant also to quantum key distribution: the older, naïve one based on accessible information, contrasting with the new, composable one embracing the quantum nature of the eavesdropper’s information. Assuming an additivity conjecture for constrained minimum output Rényi entropies, the techniques of the first part demonstrate a single-letter formula for the weak locking capacity of complements to cq-channels, coinciding with a general upper bound of Guha et al. for these channels. Furthermore, still assuming this additivity conjecture, this upper bound is given an operational interpretation for general channels as the maximum weak locking capacity of the channel activated by a suitable noiseless channel.
KeywordsQuantum channel Private capacity Quantum key distribution Accessible information Composability Locking capacity
I thank Mark Wilde for enlightening discussions on information locking, for introducing me to locking capacities and for first raising the problem of separating the private capacity from the weak locking capacity. The keen interest he and Saikat Guha took in this project helped immensely to develop the ideas of the present paper. This research was supported by the European Commission (STREP “RAQUEL”), the European Research Council (Advanced Grant “IRQUAT”) and the Spanish MINECO (project FIS2008-01236) with FEDER funds. Part of this work was done during the program “Mathematical Challenges in Quantum Information” (MQI), 27/8-20/12/2013, at the Isaac Newton Institute in Cambridge, whose hospitality during the semester is gratefully acknowledged.
- 2.S. Arimoto, Information measures and capacity of order \(\alpha \) for discrete memoryless channels, in: Topics in Information Theory—2nd Colloquium, Colloq. Math. Soc. J. Bolyai 16, pp. 41–52, I. Csiszár and P. Elias (eds.), North Holland, Amsterdam, 1977Google Scholar
- 6.M. Christandl, A. Ekert, M. Horodecki, P. Horodecki, J. Oppenheim, R. Renner, Unifying Classical and Quantum Key Distillation, in: Proc. TCC 2007, LNCS 4392, pp. 456–478, Springer Verlag, Berlin, 2007; arXiv:quant-ph/0608199
- 7.I. Damgaard, S. Fehr, R. Renner, L. Salvail, C. Schaffner, A Tight High-Order Entropic Quantum Uncertainty Relation with Applications, in: Proc. CRYPTO 2007, LNCS 4622, pp. 360–378, Springer Verlag, Berlin, 2007; arXiv:quant-ph/0612014
- 11.O. Fawzi, P. Hayden, P. Sen, From Low-Distortion Norm Embeddings to Explicit Uncertainty Relations and Efficient Information Locking, J. ACM 60(6), article no. 44, 2013Google Scholar
- 12.S. Guha, P. Hayden, H. Krovi, S. Lloyd, C. Lupo, J.H. Shapiro, M. Takeoka, M.M. Wilde, Quantum enigma machines and the locking capacity of a quantum channel. Phys. Rev. X 4, 011016 (2014)Google Scholar
- 14.A.S. Holevo, Bounds for the quantity of information transmitted by a quantum communication channel. Probl. Inf. Transm. 9(3), 177–183 (1973)Google Scholar
- 23.S. Lloyd, Quantum enigma machines, arXiv:1307.0380 [quant-ph], 2013
- 28.R. Renner, Security of Quantum Key Distribution, PhD thesis, ETH Zürich, 2005. arXiv:quant-ph/0512258
- 29.R. Renner and S. Wolf, Smooth Rényi entropy and applications, in: Proc. ISIT 2004, p. 232, 2004Google Scholar
- 34.M. Tomamichel, A Framework for Non-Asymptotic Quantum Information Theory, PhD thesis, ETH Zürich, 2012. arXiv:1203.2142 [quant-ph]
- 35.S. P. Vadhan, Pseudorandomness, draft, 2013. http://people.seas.harvard.edu/~salil/pseudorandomness/