A transformation based algorithm for reversible logic synthesis
Proceedings of the 40th annual Design Automation Conference
An arbitrary twoqubit computation In 23 elementary gates or less
Proceedings of the 40th annual Design Automation Conference
Majority-based reversible logic gates
Theoretical Computer Science
Fast synthesis of exact minimal reversible circuits using group theory
Proceedings of the 2005 Asia and South Pacific Design Automation Conference
Algebraic Characterization of Reversible Logic Gates
Theory of Computing Systems
Synthesis of reversible logic circuits
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Efficient approaches for designing reversible Binary Coded Decimal adders
Microelectronics Journal
Transistor realization of reversible "ZS" series gates and reversible array multiplier
Microelectronics Journal
| Hi-index | 0.00 |
Quantum computing is one of the most promising emerging technologies of the future. Reversible circuits are an important class of Quantum circuits. In this paper, we investigate the problem of optimally synthesizing four-qubit reversible circuits. We present an enhanced bi-directional synthesis approach. Due to the super-exponential increase on the memory requirement, all the existing methods can only perform four steps for the CNP (Control-Not gate, NOT gate, and Peres gate) library. Our novel method can achieve 12 steps. As a result, we augment the number of circuits that can be optimally synthesized by over 5*10驴 times. Moreover, our approach is faster than the existing approaches by orders of magnitude. The promising experimental results demonstrate the effectiveness of our approach.