[Wrong]Array Representation of Entanglement for Pseudo-Quantum Gate Computing on Conventional Digital Circuits
Preprints are manuscripts made publicly available before they have been submitted for formal peer review and publication. They might contain new research findings or data. Preprints can be a draft or final version of an author's research but must not have been accepted for publication at the time of submission.
[Note] Method in this article found as wrong and does not work.
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.