Reversible logic synthesis with Fredkin and Peres gates
Authors:
Open Access
- 1 March 2008
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM Journal on Emerging Technologies in Computing Systems
- Vol. 4 (1) , 1-19
Abstract
Reversible logic has applications in low-power computing and quantum computing. Most reversible logic synthesis methods are tied to particular gate types, and cannot synthesize large functions. This article extends RMRLS, a reversible logic synthesis tool, to include additional gate types. While classic RMRLS can synthesize functions using NOT, CNOT, and n -bit Toffoli gates, our work details the inclusion of n -bit Fredkin and Peres gates. We find that these additional gates reduce the average gate count for three-variable functions from 6.10 to 4.56, and improve the synthesis results of many larger functions, both in terms of gate count and quantum cost.Keywords
Funding Information
- Division of Computing and Communication Foundations (CCF-0429745)
This publication has 18 references indexed in Scilit:
- Reversible Cascades With Minimal GarbageIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2004
- A transformation based algorithm for reversible logic synthesis2003
- Synthesis of reversible logic circuitsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2003
- Five two-bit quantum gates are sufficient to implement the quantum Fredkin gatePhysical Review A, 1996
- Elementary gates for quantum computationPhysical Review A, 1995
- Proposal for an implementation of reversible gates in c-MOSInternational Journal of Electronics, 1994
- Reversible optical computing circuitsOptics Letters, 1987
- Reversible logic and quantum computersPhysical Review A, 1985
- Conservative logicInternational Journal of Theoretical Physics, 1982
- Reversible computing1980