[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.

Arranging some magnets can intensify its magnetic field, as known as Halbach array. Magnets can be considered as a 3 dimensional array of magnetic dipoles. Optimizing these magnetic dipole directions, magnets can be more stronger. This article shows how to ditermine these directions, and how to magnetize ferromagnetic material with that directions.