Efficient optimization of the quantum relative entropy

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.

arXiv comment14 pages, v2: minor updates

References in corpus (10)

• Quantifying Entanglement
• A complete family of separability criteria
• Quantum conditional mutual information and approximate Markov chains
• Quantum channels and their entropic characteristics
• Information-capacity description of spin-chain correlations
• Semidefinite approximations of the matrix logarithm
• Approximate Degradable Quantum Channels
• Quantum Conditional Mutual Information, Reconstructed States, and State Redistribution
• Squashed entanglement, k-extendibility, quantum Markov chains, and recovery maps
• Efficient Approximation of Quantum Channel Capacities

Cited by in corpus (40)

• Efficiently computable bounds for magic state distillation
• Semidefinite approximations of the matrix logarithm
• Semidefinite programming relaxations for quantum correlations
• Security of quantum key distribution from generalised entropy accumulation
• Non-asymptotic entanglement distillation
• Entanglement cost and quantum channel simulation
• Entropy of a quantum channel
• Resource speed limits: Maximal rate of resource variation
• Semidefinite programming converse bounds for quantum communication
• On Composite Quantum Hypothesis Testing
• Computing Quantum Channel Capacities
• Disentanglement Cost of Quantum States
• Generic nonadditivity of quantum capacity in simple channels
• Semi-definite programming and quantum information
• Approximate reversal of quantum Gaussian dynamics
• Non-Markovian Memory Strength Bounds Quantum Process Recoverability
• Performance enhancements for a generic conic interior point algorithm
• The platypus of the quantum channel zoo
• Bounding quantum capacities via partial orders and complementarity
• Geometric Rényi Divergence and its Applications in Quantum Channel Capacities
• A nonstabilizerness monotone from stabilizerness asymmetry
• Entanglement monogamy via multivariate trace inequalities
• Bayesian inversion and the Tomita-Takesaki modular group
• Experimental certification of more than one bit of quantum randomness in the two inputs and two outputs scenario
• Hierarchy of correlation quantifiers comparable to negativity
• Quantifying the unextendibility of entanglement
• Long-Step Path-Following Algorithm for Quantum Information Theory: Some Numerical Aspects and Applications
• Efficient Computation of the Quantum Rate-Distortion Function
• Upper Bounds on the Distillable Randomness of Bipartite Quantum States
• Upper bounds for relative entropy of entanglement based on active learning
• Optimising the relative entropy under semidefinite constraints
• Information-theoretic aspects of the generalized amplitude damping channel
• Five Starter Pieces: Quantum Information Science via Semi-definite Programs
• Certifying optimality for convex quantum channel optimization problems
• Primal-Dual Interior-Point Methods for Domain-Driven Formulations
• The Role of Entanglement in Quantum Communication, and Analysis of the Detection Loophole
• Uhlmann's theorem for relative entropies
• Bounding conditional entropy of bipartite states with Bell operators
• Detecting Entanglement by Pure Bosonic Extension
• Weighted theta functions for non-commutative graphs