Please use this identifier to cite or link to this item:
https://doi.org/10.1103/PhysRevA.71.054303
Title: | Iterative procedure for computing accessible information in quantum communication | Authors: | Aeháček, J. Englert, B.-G. Kaszlikowski, D. |
Issue Date: | May-2005 | 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 | URI: | http://scholarbank.nus.edu.sg/handle/10635/97011 | ISSN: | 10502947 | DOI: | 10.1103/PhysRevA.71.054303 |
Appears in Collections: | Staff Publications |
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.