Simulating entanglement in classical computing for cryptographic applications
Subhash C. Kak · Cryptologia · 2015
This article 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, the author proves a theorem that gives the function of the entangled state. A useful generalization beyond this research will be the implementation of quantum states with arbitrary probability amplitude functions.