Array Representation of Entanglement for Pseudo-Quantum Gate Computing on Conventional Digital Circuits
Entanglement is important on quantum gate based computer.
Simple implementation of simulated entanglement on conventional digital circuits requires
spatial complexity O(2^N) where N is number of qubits.
In this article, array representation of entanglement which requires
spatial complexity O(N^2) is proposed for simulated quantum gate on conventional digital circuits.
Simulation shows proposed method can solve the problem which Deutsch-Jozsa algorithm solves.