Modeling and Processing Using Reversible Conservative Noisy Elementary Cellular Automata Circuits and their M-Ary Quantum Computing
Anas N. Al‐Rabadi · Intelligent Automation & Soft Computing · 2008
Abstract Modeling noisy discrete systems utilizing conservative reversible elementary cellular automata (CRECA) is introduced. Reversibility in the ECA evolution rule and reversibility in the ECA circuit implementation are both achieved using a new Swap-based algorithm called Swap-based CRECA (SCRECA). The new method results in adding variable redundancy to counteract the effect of noise. The problem of obtaining a reversible map from an irreversible map is important because quantum circuits are inherently reversible and thus does not consume power, while irreversible circuits (due to either an irreversible mapping or to noise within a reversible mapping) cannot exist in the quantum domain and its circuits consume power. Since noise is an integral part of any real process and since the reduction of power consumption is a main requirement for the circuit design of future technologies such as in quantum computing (QC), the main features of several future technologies will include reversibility, and thus the...