Certifying optimality for convex quantum channel optimization problems
arXiv:1810.13295 · doi:10.22331/q-2021-05-01-448
Abstract
We identify necessary and sufficient conditions for a quantum channel to be optimal for any convex optimization problem in which the optimization is taken over the set of all quantum channels of a fixed size. Optimality conditions for convex optimization problems over the set of all quantum measurements of a given system having a fixed number of measurement outcomes are obtained as a special case. In the case of linear objective functions for measurement optimization problems, our conditions reduce to the well-known Holevo-Yuen-Kennedy-Lax measurement optimality conditions. We illustrate how our conditions can be applied to various state transformation problems having non-linear objective functions based on the fidelity, trace distance, and quantum relative entropy.
29 pages
References in corpus (6)
- From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups
- Semidefinite approximations of the matrix logarithm
- On Variational Expressions for Quantum Relative Entropies
- Efficient optimization of the quantum relative entropy
- The Fidelity of Recovery is Multiplicative
- Operational meaning of quantum measures of recovery