量子通信中计算可达信息的迭代方法
Iterative procedure for computing accessible information in quantum communication
摘要：
我们提出了一个迭代算法，找到最佳的测量提取可访问的信息在任何量子通信的情况下。最大化是通过一个最陡的上升方法向极值点，以下的梯度上坡足够小的步骤。我们将其应用到一个简单的ad-hoc例子，以及一个问题的安全性的关系的断层扫描协议的量子密钥分发。
英文摘要：
We present an iterative algorithm that finds the optimal measurement for extracting the accessible information in any quantum communication scenario. The maximization is achieved by a steepest-ascent approach toward the extremal point, following the gradient uphill in sufficiently small steps. We apply it to a simple ad-hoc example, as well as to a problem with a bearing on the security of a tomographic protocol for quantum key distribution.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
