Efficient optimization of the quantum relative entropy
From MaRDI portal
Publication:4639620
convex optimizationvon Neumann entropyquantum relative entropyentanglement measuresquantum capacityquantum conditional mutual information
Measures of information, entropy (94A17) Coding theorems (Shannon theory) (94A24) Quantum coherence, entanglement, quantum correlations (81P40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Channel models (including quantum) in information and communication theory (94A40)
Abstract: Many quantum information measures can be written as an optimization of the quantum relative entropy between sets of states. For example, the relative entropy of entanglement of a state is the minimum relative entropy to the set of separable states. The various capacities of quantum channels can also be written in this way. We propose a unified framework to numerically compute these quantities using off-the-shelf semidefinite programming solvers, exploiting the approximation method proposed in [Fawzi, Saunderson, Parrilo, Semidefinite approximations of the matrix logarithm, arXiv:1705.00812]. As a notable application, this method allows us to provide numerical counterexamples for a proposed lower bound on the quantum conditional mutual information in terms of the relative entropy of recovery.
Recommendations
Cites work
- Approximate Degradable Quantum Channels
- Classical deterministic complexity of Edmonds' Problem and quantum entanglement
- Efficient Approximation of Quantum Channel Capacities
- Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem
- Lieb's concavity theorem, matrix geometric means, and semidefinite optimization
- On the semidefinite representation of real functions applied to symmetric matrices
- Quantifying Entanglement
- Quantum conditional mutual information and approximate Markov chains
- Relative entropy optimization and its applications
- SUFFICIENCY OF CHANNELS OVER VON NEUMANN ALGEBRAS
- Squashed entanglement, \(\mathbf {k}\)-extendibility, quantum Markov chains, and recovery maps
- The capacity of a quantum channel for simultaneous transmission of classical and quantum information
Cited in
(17)- Semi-definite programming and quantum information
- New additivity properties of the relative entropy of entanglement and its generalizations
- Entanglement diagnostics for efficient VQA optimization
- Semidefinite approximations of the matrix logarithm
- Quantum conditional relative entropy and quasi-factorization of the relative entropy
- Geometric Rényi divergence and its applications in quantum channel capacities
- Squashed entanglement, \(\mathbf {k}\)-extendibility, quantum Markov chains, and recovery maps
- Primal-dual interior-point methods for domain-driven formulations
- Optimal Self-Concordant Barriers for Quantum Relative Entropies
- Performance enhancements for a generic conic interior point algorithm
- Recovery map stability for the data processing inequality
- Entanglement monogamy via multivariate trace inequalities
- Long-step path-following algorithm for quantum information theory: some numerical aspects and applications
- On composite quantum hypothesis testing
- Shannon’s information theory 70 years on: applications in classical and quantum physics
- Relative entropy optimization and its applications
- Optimal quantum networks and one-shot entropies
This page was built for publication: Efficient optimization of the quantum relative entropy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4639620)
