Simulating Entanglement in Classical Computing

TL;DR

This paper demonstrates how quantum entanglement can be simulated using classical computing techniques, employing oblivious transfer and mappings to replicate entangled states and their properties.

Contribution

It introduces a novel classical simulation protocol for quantum entanglement using oblivious transfer and provides a theorem characterizing the entangled states for various mappings.

Findings

Simulation of entanglement using classical mappings

Theorem describing entangled state functions for order k mappings

Potential for implementing quantum states with arbitrary amplitudes

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.