Optimising the relative entropy under semi definite constraints -- A new tool for estimating key rates in QKD
Abstract: Finding the minimal relative entropy of two quantum states under semi definite constraints is a pivotal problem located at the mathematical core of various applications in quantum information theory. In this work, we provide a method that addresses this optimisation. Our primordial motivation stems form the essential task of estimating secret key rates for QKD from the measurement statistics of a real device. Further applications include the computation of channel capacities, the estimation of entanglement measures from experimental data and many more. For all those tasks it is highly relevant to provide both, provable upper and lower bounds. An efficient method for this is the central result of this work. We build on a recently introduced integral representation of quantum relative entropy by P.E. Frenkel and provide reliable bounds as a sequence of semi definite programs (SDPs). Our approach ensures provable quadratic order convergence, while also maintaining resource efficiency in terms of SDP matrix dimensions. Additionally, we can provide gap estimates to the optimum at each iteration stage.
- P. E. Frenkel, Integral formula for quantum relative entropy implies data processing inequality, Quantum 7, 1102 (2023).
- C. H. Bennett and G. Brassard, Quantum cryptography: Public key distribution and coin tossing, Theoretical computer science 560, 7 (2014).
- R. Renner, Security of quantum key distribution (2006), arXiv:quant-ph/0512258 [quant-ph] .
- C. Portmann and R. Renner, Security in quantum cryptography, Reviews of Modern Physics 94, 10.1103/revmodphys.94.025008 (2022).
- F. Dupuis, O. Fawzi, and R. Renner, Entropy accumulation, Communications in Mathematical Physics 379, 867 (2020).
- T. Metger and R. Renner, Security of quantum key distribution from generalised entropy accumulation, Nature Communications 14, 5272 (2023).
- M. Christandl, R. König, and R. Renner, Postselection technique for quantum channels with applications to quantum cryptography, Physical review letters 102, 020504 (2009a).
- G. Senno, T. Strohm, and A. Acín, Quantifying the intrinsic randomness of quantum measurements, Physical Review Letters 131, 10.1103/physrevlett.131.130202 (2023).
- A. Winick, N. Lütkenhaus, and P. J. Coles, Reliable numerical key rates for quantum key distribution, Quantum 2, 77 (2018).
- H. Fawzi and O. Fawzi, Efficient optimization of the quantum relative entropy, Journal of Physics A: Mathematical and Theoretical 51, 154003 (2018).
- H. Fawzi, J. Saunderson, and P. A. Parrilo, Semidefinite approximations of the matrix logarithm, Foundations of Computational Mathematics 19, 259–296 (2018).
- P. Brown, H. Fawzi, and O. Fawzi, Device-independent lower bounds on the conditional von neumann entropy (2023), arXiv:2106.13692 [quant-ph] .
- A. Jenčová, Recoverability of quantum channels via hypothesis testing (2023), arXiv:2303.11707 [quant-ph] .
- F. Hiai and D. Petz, The proper formula for relative entropy and its asymptotics in quantum probability, Communications in mathematical physics 143, 99 (1991).
- B. Augustino, Quantum algorithms for symmetric cones (2023).
- I. Devetak and A. Winter, Distillation of secret key and entanglement from quantum states, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 461, 207 (2005).
- M. Tomamichel, R. Colbeck, and R. Renner, A fully quantum asymptotic equipartition property, IEEE Transactions on Information Theory 55, 5840–5847 (2009).
- R. Renner and J. I. Cirac, de finetti representation theorem for infinite-dimensional quantum systems and applications to quantum cryptography, Physical Review Letters 102, 10.1103/physrevlett.102.110504 (2009).
- M. Christandl, R. König, and R. Renner, Postselection technique for quantum channels with applications to quantum cryptography, Physical review letters 102, 020504 (2009b).
- R. Arnon-Friedman and R. Renner, de finetti reductions for correlations, Journal of Mathematical Physics 56, 052203 (2015).
- M. Tomamichel, Quantum Information Processing with Finite Resources (Springer International Publishing, 2016).
- P. J. Coles, E. M. Metodiev, and N. Lütkenhaus, Numerical approach for unstructured quantum key distribution, Nature communications 7, 11712 (2016).
- R. Konig, R. Renner, and C. Schaffner, The operational meaning of min- and max-entropy, IEEE Transactions on Information Theory 55, 4337 (2009).
- G. Koßmann, R. Schwonnek, and J. Steinberg, Hierarchies for semidefinite optimization in 𝒞⋆superscript𝒞⋆\mathcal{C}^{\star}caligraphic_C start_POSTSUPERSCRIPT ⋆ end_POSTSUPERSCRIPT-algebras (2023), arXiv:2309.13966 [math.OC] .
- A. C. Doherty, P. A. Parrilo, and F. M. Spedalieri, Detecting multipartite entanglement, Physical Review A 71, 10.1103/physreva.71.032333 (2005).
- M. Hayashi, Optimal sequence of quantum measurements in the sense of stein s lemma in quantum hypothesis testing, Journal of Physics A: Mathematical and General 35, 10759–10773 (2002).
- C. Hirche, C. Rouzé, and D. S. Franca, Quantum differential privacy: An information theory perspective (2023), arXiv:2202.10717 [quant-ph] .
- N. Sharma and N. A. Warsi, Fundamental bound on the reliability of quantum information transmission, Physical Review Letters 110, 10.1103/physrevlett.110.080501 (2013).
- M. Piani, Relative entropy of entanglement and restricted measurements, Physical Review Letters 103, 10.1103/physrevlett.103.160504 (2009).
- M. Berta and M. Tomamichel, Entanglement monogamy via multivariate trace inequalities (2023), arXiv:2304.14878 [quant-ph] .
- L. Gurvits, Quantum matching theory (with new complexity theoretic, combinatorial and topological insights on the nature of the quantum entanglement) (2002), arXiv:quant-ph/0201022 [quant-ph] .
- M. Horodecki, P. Horodecki, and R. Horodecki, Separability of mixed states: necessary and sufficient conditions, Physics Letters A 223, 1–8 (1996).
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.