A transformation based algorithm for reversible logic synthesis
Proceedings of the 40th annual Design Automation Conference
On figures of merit in reversible and quantum logic designs
Quantum Information Processing
Exact multiple-control toffoli network synthesis with SAT techniques
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Reversible circuit synthesis using a cycle-based approach
ACM Journal on Emerging Technologies in Computing Systems (JETC)
Reversible Computing: Fundamentals, Quantum Computing, and Applications
Reversible Computing: Fundamentals, Quantum Computing, and Applications
Synthesis of reversible logic circuits
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Reversible cascades with minimal garbage
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
An Algorithm for Synthesis of Reversible Logic Circuits
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Exact Synthesis of Toffoli Gate Circuits with Negative Control Lines
ISMVL '12 Proceedings of the 2012 IEEE 42nd International Symposium on Multiple-Valued Logic
Comparing CMOS-Based and NEMS-Based adiabatic logic circuits
RC'13 Proceedings of the 5th international conference on Reversible Computation
White dots do matter: rewriting reversible logic circuits
RC'13 Proceedings of the 5th international conference on Reversible Computation
Hi-index | 0.89 |
We present tighter upper bounds on the number of Toffoli gates needed in reversible circuits. Both multiple controlled Toffoli gates and mixed polarity Toffoli gates have been considered for this purpose. The calculation of the bounds is based on a synthesis approach based on Young subgroups that results in circuits using a more generalized gate library. Starting from an upper bound for this library we derive new bounds which improve the existing bound by around 77%.