Synthesis of Quantum
Circuits vs. Synthesis
of Classical Reversible
Circuits
Alexis De Vos
Stijn De Baerdemacker
Yvan Van Rentergem
Series Editor: Mitchell A. ornton, Southern Methodist University
Synthesis of Quantum Circuits vs.
Synthesis of Classical Reversible Circuits
Alexis De Vos, Universiteit Gent
Stijn De Baerdemacker, Universiteit Gent
Yvan Van Rentergem, Universiteit Gent
At rst sight, quantum computing is completely dierent from classical computing. Nevertheless,
a link is provided by reversible computation.
Whereas an arbitrary quantum circuit, acting on w qubits, is described by an n × n
unitary matrix with n=2
w
, a reversible classical circuit, acting on w bits, is described by a 2
w
×
2
w
permutation matrix. e permutation matrices are studied in group theory of nite groups
(in particular the symmetric group S
n
); the unitary matrices are discussed in group theory of
continuous groups (a.k.a. Lie groups, in particular the unitary group U(n)).
Both the synthesis of a reversible logic circuit and the synthesis of a quantum logic
circuit take advantage of the decomposition of a matrix: the former of a permutation matrix, the
latter of a unitary matrix. In both cases the decomposition is into three matrices. In both cases
the decomposition is not unique.
Series ISSN: 1932-3166
About SYNTHESIS
This volume is a printed version of a work that appears in the Synthesis
Digital Library of Engineering and Computer Science. Synthesis
books provide concise, original presentations of important research and
development topics, published quickly, in digital and print formats.
store.morganclaypool.com
DE VOS • ET AL
SYNTHESIS OF QUANTUM CIRCUITS VS. SYNTHESIS OF CLASSICAL REVERSIBLE CIRCUITS MORGAN & CLAYPOOL