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.
@article{arxiv.1906.00037,
title = {Long-Step Path-Following Algorithm for Quantum Information Theory: Some Numerical Aspects and Applications},
author = {Leonid Faybusovich and Cunlu Zhou},
journal= {arXiv preprint arXiv:1906.00037},
year = {2025}
}
Comments
26 pages; added a new appendix A; added more details in eq.(58), eq.(60), eq.(75) - eq.(90); other small improvements