2025/11/22 by Zixin Huang, Mark M. Wilde, Huang, Zixin +1
Computer Science · Mathematics · Physics and Astronomy · #FOS: Computer and information sciences #FOS: Mathematics #FOS: Physical sciences #Information Theory (cs.IT) #Mathematical Physics (math-ph) #Optimization and Control (math.OC) #Quantum Information and Cryptography #Quantum Physics (quant-ph) #Quantum many-body systems #Statistical Mechanics and Entropy #cs.IT #math-ph #math.IT #math.MP #math.OC #quant-ph
paper · pdf · doi:10.48550/arxiv.2511.17976
v2: 39 pages, 1 figure
openalex publication_date 2025/11/22 · openalex created_date 2025/11/27 · openalex updated_date 2026/07/28 · arxiv created 2026/07/30 · arxiv updated 2026/07/31
The measured relative entropy and measured Rényi relative entropy are quantifiers of the distinguishability of two quantum states ρ and σ. They are defined as the maximum classical relative entropy or Rényi relative entropy realizable by performing a measurement on ρ and σ, and they have interpretations in terms of asymptotic quantum hypothesis testing. Crucially, they can be rewritten in terms of variational formulas involving the optimization of a concave or convex objective function over the set of positive definite operators. In this paper, we establish foundational properties of these objective functions by analyzing their matrix gradients and Hessian superoperators; namely, we prove that these objective functions are β-smooth and γ-strongly convex / concave, where β and γ depend on the max-relative entropies of ρ and σ. A practical consequence of these properties is that we can conduct Nesterov accelerated projected gradient descent / ascent, a well known classical optimization technique, to calculate the measured relative entropy and measured Rényi relative entropy to arbitrary precision. These algorithms are generally more memory efficient than our previous algorithms based on semi-definite optimization [Huang and Wilde, arXiv:2406.19060], and for well conditioned states ρ and σ, these algorithms are notably faster.