Iterative procedure for computing accessible information in quantum communication

Journal Article · Sun May 15 00:00:00 EDT 2005 · Physical Review. A

DOI:https://doi.org/10.1103/PhysRevA.71.054303· OSTI ID:20717826

Rehacek, Jaroslav ^[1]; Englert, Berthold-Georg; Kaszlikowski, Dagomir ^[2]

---

1. Department of Optics, Palacky University, 17. listopadu 50, 772 00 Olomouc (Czech Republic)
2. Department of Physics, National University of Singapore, Singapore 117542 (Singapore)

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.

• OSTI ID: 20717826
• Journal Information: Physical Review. A, Vol. 71, Issue 5; Other Information: DOI: 10.1103/PhysRevA.71.054303; (c) 2005 The American Physical Society; Country of input: International Atomic Energy Agency (IAEA); ISSN 1050-2947
• Country of Publication: United States
• Language: English

Related Subjects

74 ATOMIC AND MOLECULAR PHYSICS
ALGORITHMS
DATA TRANSMISSION
DISTRIBUTION
INFORMATION THEORY
ITERATIVE METHODS
QUANTUM COMPUTERS
SECRECY PROTECTION