Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published December 2017 | Submitted
Journal Article Open

On Variational Expressions for Quantum Relative Entropies

Abstract

Distance measures between quantum states like the trace distance and the fidelity can naturally be defined by optimizing a classical distance measure over all measurement statistics that can be obtained from the respective quantum states. In contrast, Petz showed that the measured relative entropy, defined as a maximization of the Kullback–Leibler divergence over projective measurement statistics, is strictly smaller than Umegaki's quantum relative entropy whenever the states do not commute. We extend this result in two ways. First, we show that Petz' conclusion remains true if we allow general positive operator-valued measures. Second, we extend the result to Rényi relative entropies and show that for non-commuting states the sandwiched Rényi relative entropy is strictly larger than the measured Rényi relative entropy for α∈(1/2,∞) and strictly smaller for α∈[0,1/2). The latter statement provides counterexamples for the data processing inequality of the sandwiched Rényi relative entropy for α<1/2. Our main tool is a new variational expression for the measured Rényi relative entropy, which we further exploit to show that certain lower bounds on quantum conditional mutual information are superadditive.

Additional Information

© 2017 Springer Science+Business Media B.V. Received: 14 February 2017; Revised: 22 August 2017; Accepted: 23 August 2017; Published online: 7 September 2017. We acknowledge discussions with Fernando Brandão, Douglas Farenick and Hamza Fawzi. MB acknowledges funding by the SNSF through a fellowship, funding by the Institute for Quantum Information and Matter (IQIM), an NSF Physics Frontiers Center (NFS Grant PHY-1125565) with support of the Gordon and Betty Moore Foundation (GBMF-12500028), and funding support form the ARO grant for Research on Quantum Algorithms at the IQIM (W911NF-12-1-0521). Most of this work was done while OF was also with the Department of Computing and Mathematical Sciences, California Institute of Technology. MT would like to thank the IQIM at CalTech and John Preskill for his hospitality during the time most of the technical aspects of this project were completed. He is funded by an ARC Discovery Early Career Researcher Award fellowship (Grant No. DE160100821).

Attached Files

Submitted - 1512.02615v1.pdf

Files

1512.02615v1.pdf
Files (272.8 kB)
Name Size Download all
md5:bf1de4a5daae675564fd88dedcd36f06
272.8 kB Preview Download

Additional details

Created:
August 21, 2023
Modified:
October 23, 2023