A Novel Classifying Algorithm for Reversible Circuit Synthesis

Quantum machines are powerful computation machines capable of parallel computation. A great deal of research has therefore focused on algorithms based on the properties of quantum physics, including superposition and entanglement. However, these techniques face significant difficulties when dealing with reversible circuit synthesis, in which the functions, computation and storage increase by factorial as the number of input bits is increased. The most efficient methods of dealing with reversible circuit synthesis are currently limited to 5 bit inputs. However, this research proposes a novel concept which reduces the number of input functions by classification. It is based on the relationship between a hypercube and gates. The algorithm is able to classify functions with the same properties into an isomorphic class, and is able to do this for any input bits. This not only efficiently reduces the output functions, but also speeds up the synthesis algorithm.