1301.1994 (Subhash Kak)

Simulating Entanglement in Classical Computing    [PDF]

Subhash Kak

This note shows how quantum entanglement may be simulated in classical computing. The simulated entanglement protocol is implemented using oblivious transfer in the simplest case and other many-to-one mappings in more general cases. For the case where the mapping is of order k, we prove a theorem that gives us the function of the entangled state. A useful generalization beyond this research will be the implementation of quantum states with arbitrary probability amplitude functions.

View original: http://arxiv.org/abs/1301.1994