Oblivious transfer and quantum channels as communication resources

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.

[1]  A. Winter,et al.  Implications of superstrong non-locality for cryptography , 2005, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[2]  Stefan Wolf,et al.  Oblivious Transfer Is Symmetric , 2006, EUROCRYPT.

[3]  E. Specker.  DIE LOGIK NICHT GLEICHZEITIG ENTSC HEIDBARER AUSSAGEN , 1960 .

[4]  Charles H. Bennett,et al.  Teleporting an unknown quantum state via dual classical and EPR channels , 1993 .

[5]  A. Gleason.  Measures on the Closed Subspaces of a Hilbert Space , 1957 .

[6]  D. Bacon,et al.  Communication cost of simulating Bell correlations. , 2003, Physical review letters.

[7]  Stephen Wiesner,et al.  Conjugate coding , 1983, SIGA.

[8]  F. Gonseth,et al.  DIE LOGIK NICHT GLEICHZEITIG ENTSCHEIDBARER AUSSAGEN , 1990 .

[9]  N J Cerf,et al.  Simulating maximal quantum entanglement without communication. , 2005, Physical review letters.

[10]  Michael O. Rabin,et al.  How To Exchange Secrets with Oblivious Transfer , 2005, IACR Cryptol. ePrint Arch..

[11]  Andreas J. Winter,et al.  A Resource Framework for Quantum Shannon Theory , 2008, IEEE Transactions on Information Theory.

[12]  S. Popescu,et al.  Quantum nonlocality as an axiom , 1994 .

[13]  N. Bohr.  II - Can Quantum-Mechanical Description of Physical Reality be Considered Complete? , 1935 .

[14]  Aram W. Harrow,et al.  A family of quantum protocols , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[15]  Charles H. Bennett,et al.  Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels. , 1993, Physical review letters.

[16]  R. Mcweeny.  On the Einstein-Podolsky-Rosen Paradox , 2000 .

[17]  J. Jauch,et al.  CAN HIDDEN VARIABLES BE EXCLUDED IN QUANTUM MECHANICS , 1963 .

[18]  J. Neumann.  Mathematische grundlagen der Quantenmechanik , 1935 .

[19]  Cerf,et al.  Classical teleportation of a quantum Bit , 2000, Physical review letters.

[20]  Andris Ambainis,et al.  Dense quantum coding and a lower bound for 1-way quantum automata , 1998, STOC '99.

[21]  E. Specker,et al.  The Problem of Hidden Variables in Quantum Mechanics , 1967 .