Name
Abstract | ||
|---|---|---|
We show that from a communication-complexity perspective, the primitive called oblivious transfer--which was introduced in a cryptographic context--can be seen as the classical analogue to a quantum channel in the same sense as non-local boxes are of maximally entangled qubits. More explicitly, one realization of non-cryptographic oblivious transfer allows for the perfect simulation of sending one qubit and measuring it in an orthogonal basis. On the other hand, a qubit channel allows for realizing non-cryptographic oblivious transfer with probability roughly 85 %, whereas 75 % is the classical limit. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/s11047-012-9350-9 | Natural Computing |
Keywords | Field | DocType |
Classical teleportation,Quantum channel,Communication complexity,Oblivious transfer | Discrete mathematics,Quantum nonlocality,Classical limit,Communication complexity,Quantum teleportation,Quantum cryptography,Qubit,Quantum channel,Mathematics,Oblivious transfer | Journal |
Volume | Issue | ISSN |
12 | 1 | 1567-7818 |
Citations | PageRank | References |
3 | 0.64 | 3 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| N. Gisin | 1 | 109 | 19.98 |
| Sandu Popescu | 2 | 12 | 2.30 |
| Valerio Scarani | 3 | 28 | 6.00 |
| Stefan Wolf | 4 | 98 | 12.84 |
| Jürg Wullschleger | 5 | 256 | 15.70 |