Share Email Print

Proceedings Paper

Matrix optimizations for quantum communications
Author(s): John M. Myers; Hao Ming Shen; Tai Tsun Wu
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 12 May 2006
PDF: 13 pages
Proc. SPIE 6244, Quantum Information and Computation IV, 62440K (12 May 2006); doi: 10.1117/12.665948
Show Author Affiliations
John M. Myers, Harvard Univ. (United States)
Hao Ming Shen, Harvard Univ. (United States)
Tai Tsun Wu, Harvard Univ. (United States)

Published in SPIE Proceedings Vol. 6244:
Quantum Information and Computation IV
Eric J. Donkor; Andrew R. Pirich; Howard E. Brandt, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?