Minimal universal library for n×n reversible circuits

Authors:
Guowu Yang;Xiaoyu Song;Marek A. Perkowski;William N. N. Hung;Chang-Jun Seo
Affiliations:
University of Electronic Science and Technology of China, Sichuan, China;Department ECE, Portland State University, OR, USA;Department ECE, Portland State University, OR, USA;Department ECE, Portland State University, OR, USA;Department of EIRE, Inje University, Republic of Korea
Venue:
Computers & Mathematics with Applications
Year:
2008

Citing 3
Cited 0

Algebraic Characterization of Reversible Logic Gates

Theory of Computing Systems
Logical reversibility of computation

IBM Journal of Research and Development
Synthesis of reversible logic circuits

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Quantified Score

Hi-index	0.09

Visualization

Abstract

Reversible logic plays an important role in quantum computing. Several papers have been recently published on universality of sets of reversible gates. However, a fundamental unsolved problem remains: ''what is the minimum set of gates that are universal forn-qubit circuits without ancillae bits''. We present a library of 2 gates which is sufficient to realize all reversible circuits of n variables. It is a minimal library of gates for binary reversible logic circuits. We also analyze the complexity of the syntheses.