Paper
12 May 2006 Matrix optimizations for quantum communications
Author Affiliations +
Abstract
In the simplest problems of quantum communication, Alice transmits one of two quantum states, with equal probabilities, to Bob's receiver, modeled by a positive-operator-valued measure (POVM); one seeks the POVM that is optimal according to one or another criterion. We discuss four such criteria, the first three of which lead to distinctive types of POVM. By introducing a reciprocal basis for the state vectors, we shorten the derivations of known results for the two most popular criteria. A new optimization problem defined by a third criterion, intermediate between the first two, is formulated and solved. Then we turn to a fourth criterion, that of minimizing Bob's Renyi entropy for an arbitrary order α. Depending on the value of α and the separation of Alice's states, the POVM that minimizes Bob's entropy can be any of the preceding three types.
© (2006) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
John M. Myers, Hao Ming Shen, and Tai Tsun Wu "Matrix optimizations for quantum communications", Proc. SPIE 6244, Quantum Information and Computation IV, 62440K (12 May 2006); https://doi.org/10.1117/12.665948
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Quantum communications

Receivers

Quantum physics

Matrices

Probability theory

Vector spaces

Quantum mechanics

RELATED CONTENT


Back to Top