Please use this identifier to cite or link to this item:
|Title:||Iterative procedure for computing accessible information in quantum communication|
|Citation:||Aeháček, J., Englert, B.-G., Kaszlikowski, D. (2005-05). Iterative procedure for computing accessible information in quantum communication. Physical Review A - Atomic, Molecular, and Optical Physics 71 (5) : -. ScholarBank@NUS Repository. https://doi.org/10.1103/PhysRevA.71.054303|
|Abstract:||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. © 2005 The American Physical Society.|
|Source Title:||Physical Review A - Atomic, Molecular, and Optical Physics|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jun 14, 2018
WEB OF SCIENCETM
checked on May 7, 2018
checked on May 25, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.