A unified approach to quantum computation and classical reversible computation

Abstract

The design of a quantum computer and the design of a classical computer can be based on quite similar circuit designs. The former is based on the subgroup structure of the infinite group of unitary matrices, whereas the latter is based on the subgroup structure of the finite group of permutation matrices. Because these two groups display similarities as well as differences, the corresponding circuit designs are comparable but not identical