|
| related topics |
| {key, protocol, security} |
| {algorithm, log, probability} |
| {alice, bob, state} |
| {photon, photons, single} |
| {state, phys, rev} |
| {qubit, qubits, gate} |
| {bell, inequality, local} |
| {force, casimir, field} |
| {trap, ion, state} |
|
A feasible quantum communication complexity protocol
Ernesto F. Galvao
abstract: I show that a simple multi-party communication task can be performed more
efficiently with quantum communication than with classical communication, even
with low detection efficiency $\eta$. The task is a communication complexity
problem in which distant parties need to compute a function of the distributed
inputs, while minimizing the amount of communication between them. A realistic
quantum optical setup is suggested that can demonstrate a five-party quantum
protocol with higher-than-classical performance, provided $\eta>0.33$ .
- oai_identifier:
- oai:arXiv.org:quant-ph/0106121
- categories:
- quant-ph
- comments:
- 8 pages, LaTeX, no figures. v2: included analysis of other
experimental losses, 3 more refs., other minor changes
- doi:
- 10.1103/PhysRevA.65.012318
- arxiv_id:
- quant-ph/0106121
- journal_ref:
- Phys. Rev. A 65, 012318 (2002)
- created:
- 2001-06-21
- updated:
- 2001-10-01
Full article ▸
|
|
| related documents |
| 0303184v1 |
| 0610096v2 |
| 0509211v1 |
| 0611145v1 |
| 0612052v2 |
| 0508156v3 |
| 0206066v1 |
| 0608156v1 |
| 0303074v1 |
| 0511163v2 |
| 0207108v1 |
| 0208112v1 |
| 0402099v1 |
| 0209148v1 |
| 0112079v1 |
| 0405111v2 |
| 0001046v1 |
| 0302196v1 |
| 0308016v1 |
| 0609160v1 |
| 9801022v1 |
| 0509189v2 |
| 0609166v1 |
| 0112111v1 |
| 0406179v1 |
|