On convex optimization problems in quantum information theory
From MaRDI portal
Abstract: Convex optimization problems arise naturally in quantum information theory, often in terms of minimizing a convex function over a convex subset of the space of hermitian matrices. In most cases, finding exact solutions to these problems is usually impossible. As inspired by earlier investigations into the relative entropy of entanglement [Phys. Rev. A 78 032310 (2008)], we introduce a general method to solve the converse problem rather than find explicit solutions. That is, given a matrix in a convex set, we determine a family of convex functions that are minimized at this point. This method allows us find explicit formulae for the relative entropy of entanglement and the Rains bound, two well-known upper bounds on the distillable entanglement, and yields interesting information about these quantities, such as the fact that they coincide in the case where at least one subsystem of a multipartite state is a qubit.
Recommendations
- Quantum error correction via convex optimization
- Convex geometry of quantum resource quantification
- Some applications of hypercontractive inequalities in quantum information theory
- scientific article; zbMATH DE number 3516928
- A solution of Gaussian optimizer conjecture for quantum channels
- Gaussian optimizers for entropic inequalities in quantum information
- Gaussian optimizers and the additivity problem in quantum information theory
- Gradient flows for optimization in quantum information and quantum dynamics: foundations and applications
- Information complexity of mixed-integer convex optimization
- Semidefinite Programming Converse Bounds for Quantum Communication
Cited in
(18)- New additivity properties of the relative entropy of entanglement and its generalizations
- Maximizing concave piecewise affine functions on the unitary group
- On the energy-constrained diamond norm and its application in quantum information theory
- Quantum convex support
- Closest separable state when measured by a quasi-relative entropy
- Optimal Self-Concordant Barriers for Quantum Relative Entropies
- Entanglement of four-qubit rank-2 mixed states
- Strong convexity of sandwiched entropies and related optimization problems
- Entanglement manipulation beyond local operations and classical communication
- Long-step path-following algorithm for quantum information theory: some numerical aspects and applications
- Efficient optimization of the quantum relative entropy
- REE from EOF
- Self-concordance and matrix monotonicity with applications to quantum entanglement problems
- Additivity of quantum relative entropies as a single-copy criterion
- On the quantum Gaussian optimizers conjecture in the case $ q=p$
- Relative entropy optimization and its applications
- Convex geometry of quantum resource quantification
- On directional derivatives of trace functionals of the form \(A \mapsto \mathrm{Tr}({Pf}(A))\)
This page was built for publication: On convex optimization problems in quantum information theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2939851)
