Abstract
Reversible logic plays an important role in quantum computing. This article presents some novel results on synthesis of 3 × 3 reversible Boolean gates. We derive the relationship between reversible 3 × 3 gates and corresponding symmetric groups. By introducing a set of universal libraries, we show how to use group theory to synthesize any 3 × 3 reversible gate.
Acknowledgement
This work was supported by the National Natural Science Foundation of China under the 973 Research Project (No. 2004CB719406).