|
|
|
|
| LEADER |
01405nam a2200217Ia 4500 |
| 001 |
10.3934-naco.2021017 |
| 008 |
220425s2022 CNT 000 0 und d |
| 020 |
|
|
|a 21553289 (ISSN)
|
| 245 |
1 |
0 |
|a LONG-STEP PATH-FOLLOWING ALGORITHM FOR QUANTUM INFORMATION THEORY: SOME NUMERICAL ASPECTS AND APPLICATIONS
|
| 260 |
|
0 |
|b American Institute of Mathematical Sciences
|c 2022
|
| 856 |
|
|
|z View Fulltext in Publisher
|u https://doi.org/10.3934/naco.2021017
|
| 520 |
3 |
|
|a 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 optimization problem involving the quantum relative entropy in quantum key distribution and show that our method can solve problems of this type much faster in comparison with (very few) available options. © 2022, American Institute of Mathematical Sciences. All rights reserved.
|
| 650 |
0 |
4 |
|a long-step path-following algorithm
|
| 650 |
0 |
4 |
|a matrix monotone functions
|
| 650 |
0 |
4 |
|a quantum information theory
|
| 650 |
0 |
4 |
|a quantum key distribution
|
| 650 |
0 |
4 |
|a quantum relative entropy
|
| 650 |
0 |
4 |
|a self-concordant functions
|
| 700 |
1 |
|
|a Faybusovich, L.
|e author
|
| 700 |
1 |
|
|a Zhou, C.
|e author
|
| 773 |
|
|
|t Numerical Algebra, Control and Optimization
|
