|
| related topics |
| {bell, inequality, local} |
| {alice, bob, state} |
| {key, protocol, security} |
| {algorithm, log, probability} |
| {state, phys, rev} |
| {photon, photons, single} |
| {trap, ion, state} |
| {theory, mechanics, state} |
| {cos, sin, state} |
|
Experimental requirements for quantum communication complexity protocols
Ernesto F. Galvao
abstract: I present a simple two-party quantum communication complexity protocol with
higher success rate than the best possible classical protocol for the same
task. The quantum protocol is shown to be equivalent to a quantum non-locality
test, except that it is not necessary to close the locality loophole. I derive
bounds for the detector efficiency and background count rates necessary for an
experimental implementation and show that they are close to what can be
currently achieved using ion trap technology. I also analyze the requirements
for a three-party protocol and show that they are less demanding than those for
the two-party protocol. The results can be interpreted as sufficient
experimental conditions for quantum non-locality tests using two or three
entangled qubits.
- oai_identifier:
- oai:arXiv.org:quant-ph/0009014
- categories:
- quant-ph
- comments:
- 14 pages, 1 eps figure
- arxiv_id:
- quant-ph/0009014
- created:
- 2000-09-04
Full article ▸
|
|
| related documents |
| 0109008v3 |
| 0104133v7 |
| 0007006v3 |
| 9905084v1 |
| 0501039v1 |
| 0703179v2 |
| 9901074v1 |
| 0108084v2 |
| 0103068v1 |
| 0107045v2 |
| 0607059v2 |
| 0104110v1 |
| 0310042v2 |
| 0502082v3 |
| 0108141v1 |
| 0511163v2 |
| 0311125v1 |
| 0302196v1 |
| 0011083v2 |
| 0504150v2 |
| 0512025v1 |
| 0502067v1 |
| 0702155v3 |
| 0304141v3 |
| 0102060v1 |
|