|
| related topics |
| {algorithm, log, probability} |
| {let, theorem, proof} |
| {key, protocol, security} |
| {alice, bob, state} |
| {bell, inequality, local} |
| {time, systems, information} |
| {entanglement, phys, rev} |
| {cos, sin, state} |
|
Communication Complexity Protocol for Q-trits
B. Tamir
abstract: Consider a function where its entries are distributed among many parties.
Suppose each party is allowed to transmit only a limited amount of information
to a net. One can use a classical protocol to guess the value of the global
function. Is there a quantum protocol improving the results of all classical
protocols? Brukner et. al. showed the deep connection between such problems and
the theory of Bell's inequalities. Here we generalize the theory to trits.
There the best classical protocol fails whereas the quantum protocol yields the
correct answer.
- oai_identifier:
- oai:arXiv.org:quant-ph/0608156
- categories:
- quant-ph
- comments:
- 8 pages
- arxiv_id:
- quant-ph/0608156
- created:
- 2006-08-21
Full article ▸
|
|
| related documents |
| 0209148v1 |
| 9702057v1 |
| 0005087v2 |
| 0507024v1 |
| 0606242v3 |
| 0612033v1 |
| 0105014v2 |
| 0502144v1 |
| 0209139v1 |
| 0104007v2 |
| 0002009v1 |
| 9908090v3 |
| 0406146v1 |
| 0001034v1 |
| 9811027v1 |
| 0703193v2 |
| 0507194v1 |
| 9912076v4 |
| 0007101v4 |
| 0209059v1 |
| 0202140v2 |
| 9706023v1 |
| 9704025v1 |
| 0406121v1 |
| 0206078v1 |
|