Long-Step Path-Following Algorithm for Quantum Information Theory: Some Numerical Aspects and Applications
arXiv:1906.00037 · doi:10.3934/naco.2021017
Abstract
We consider some important computational aspects of the long-step path-following algorithm developed in our previous work and show that a broad class of complicated optimization problems arising in quantum information theory can be solved using this approach. In particular, we consider one difficult and important optimization problem in quantum key distribution and show that our method can solve problems of this type much faster in comparison with (very few) available options.
arXiv comment26 pages; added a new appendix A; added more details in eq.(58), eq.(60), eq.(75) - eq.(90); other small improvements
References in corpus (8)
- The Security of Practical Quantum Key Distribution
- Secure Quantum Key Distribution
- Numerical approach for unstructured quantum key distribution
- Reliable numerical key rates for quantum key distribution
- Semidefinite approximations of the matrix logarithm
- Efficient optimization of the quantum relative entropy
- Newton Sketch: A Linear-time Optimization Algorithm with Linear-Quadratic Convergence
- Invariant semidefinite programs