Simulating Entanglement in Classical Computing
Quantum Physics
2013-01-11 v1
Abstract
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.
Cite
@article{arxiv.1301.1994,
title = {Simulating Entanglement in Classical Computing},
author = {Subhash Kak},
journal= {arXiv preprint arXiv:1301.1994},
year = {2013}
}
Comments
7 pages, 2 figures