  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.
