|
related topics |
{states, state, optimal} |
{alice, bob, state} |
{information, entropy, channel} |
{state, algorithm, problem} |
{key, protocol, security} |
{equation, function, exp} |
{time, wave, function} |
{vol, operators, histories} |
{measurement, state, measurements} |
{state, states, entangled} |
{energy, gaussian, time} |
|
Iterative procedure for computing accessible information in quantum
communication
Jaroslav Řeháček, Berthold-Georg Englert, Dagomir Kaszlikowski
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.
- oai_identifier:
- oai:arXiv.org:quant-ph/0408134
- categories:
- quant-ph
- comments:
- REVTeX, 4 pages, 1 figure, 1 table
- arxiv_id:
- quant-ph/0408134
- created:
- 2004-08-20
Full article ▸
|
|
related documents |
0702033v1 |
0602016v3 |
0407120v1 |
0612123v2 |
0406104v1 |
0604009v1 |
0406077v1 |
9812034v1 |
0307132v1 |
0405095v2 |
0205026v2 |
0107085v1 |
0408022v3 |
0503094v2 |
0205076v1 |
9803066v1 |
0701079v1 |
0402099v1 |
0210100v3 |
0309216v5 |
0501093v1 |
0112111v1 |
0403188v1 |
0412083v1 |
0303098v1 |
|