Interior point methods for structured quantum relative entropy optimization problems
From MaRDI portal
Cites work
- ``Cone-free primal-dual path-following and potential-reduction polynomial time interior-point methods
- A Bregman proximal perspective on classical and quantum Blahut-Arimoto algorithms
- A homogeneous interior-point algorithm for nonsymmetric convex conic optimization
- A matrix convexity approach to some celebrated quantum inequalities
- A primal-dual interior-point algorithm for nonsymmetric exponential-cone optimization
- Alfonso: Matlab Package for Nonsymmetric Conic Optimization
- Algorithm 875
- Bregman Divergence Based Em Algorithm and its Application to Classical and Quantum Rate Distortion Theory
- Computing Quantum Channel Capacities
- Conic Optimization with Spectral Functions on Euclidean Jordan Algebras
- Convex Analysis
- Different quantum f-divergences and the reversibility of quantum operations
- Discrete-phase-randomized coherent state source and its application in quantum key distribution
- Distillation of secret key and entanglement from quantum states
- Domain-Driven Solver (DDS) Version 2.0: a MATLAB-based Software Package for Convex Optimization Problems in Domain-Driven Form
- Efficient optimization of the quantum relative entropy
- Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem
- Entropy constraints for ground energy optimization
- Exploiting sparsity in primal-dual interior-point methods for semidefinite programming
- Generalization of primal-dual interior-point methods to convex optimization problems in conic form
- Generating random density matrices
- Generating random quantum channels
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- Introduction to matrix analysis and applications
- Lectures on convex optimization
- Long-step path-following algorithm for quantum information theory: some numerical aspects and applications
- Matrix monotonicity and self-concordance: how to handle quantum entropy in optimization problems
- On Deriving the Inverse of a Sum of Matrices
- Optimal Self-Concordant Barriers for Quantum Relative Entropies
- Performance enhancements for a generic conic interior point algorithm
- Quantum Hamiltonian Complexity
- Quantum information theory
- Quantum Rate Distortion, Reverse Shannon Theorems, and Source-Channel Separation
- Quantum Rate-Distortion Coding With Auxiliary Resources
- Quasi-entropies for finite quantum systems
- Self-concordance and matrix monotonicity with applications to quantum entanglement problems
- Semidefinite approximations of the matrix logarithm
- The capacity of a quantum channel for simultaneous transmission of classical and quantum information
- The Private Classical Capacity and Quantum Capacity of a Quantum Channel
- The structure of degradable quantum channels
- The theory of quantum information
- Towards non-symmetric conic optimization
This page was built for publication: Interior point methods for structured quantum relative entropy optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7312751)
