Iterative procedure for computing accessible information in quantum communication

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.

REVTeX, 4 pages, 1 figure, 1 table

References in corpus (2)

• Tomographic Quantum Cryptography
• Quantum Cryptography: Security Criteria Reexamined

Cited by in corpus (7)

• Informational power of quantum measurements
• How well can you know the edge of a quantum pyramid?
• Residual and Destroyed Accessible Information after Measurements
• SOMIM: An open-source program code for the numerical Search for Optimal Measurements by an Iterative Method
• Riemannian optimization on the simplex of positive definite matrices
• Maximal Information Leakage from Quantum Encoding of Classical Data
• SeCQC: An open-source program code for the numerical Search for the classical Capacity of Quantum Channels