Reliability of majority voting based VLSI fault-tolerant circuits
IEEE Transactions on Very Large Scale Integration (VLSI) Systems - Special issue on low-power design
On a New Boolean Function with Applications
IEEE Transactions on Computers
Transformation rules for designing CNOT-based quantum circuits
Proceedings of the 39th annual Design Automation Conference
Reversible logic circuit synthesis
Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
Synthesis of Multipurpose Reversible Logic Gates
DSD '02 Proceedings of the Euromicro Symposium on Digital Systems Design
Regular Realization of Symmetric Functions Using Reversible Logic
DSD '01 Proceedings of the Euromicro Symposium on Digital Systems Design
Novel methods for reversible logic synthesis and their application to quantum computing
Novel methods for reversible logic synthesis and their application to quantum computing
Quantum logic synthesis by symbolic reachability analysis
Proceedings of the 41st annual Design Automation Conference
Bi-Direction Synthesis for Reversible Circuits
ISVLSI '05 Proceedings of the IEEE Computer Society Annual Symposium on VLSI: New Frontiers in VLSI Design
Realization and synthesis of reversible functions
Theoretical Computer Science
Group theory based synthesis of binary reversible circuits
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Ultra-area-efficient reversible multiplier
Microelectronics Journal
| Hi-index | 5.23 |
Reversible logic plays an important role in the synthesis of circuits for quantum computing. In this paper, we introduce families of reversible gates based on the majority Boolean function (MBF) and we prove their properties in reversible circuit synthesis. These gates can be used to synthesize reversible circuits of minimum "scratchpad register width" for arbitrary reversible functions. We show that, given a MBF f with 2k + 1 inputs, f can be implemented by a reversible logic gate with 2k + 1 inputs and 2k + 1 outputs, i.e., without any constant inputs. We also demonstrate new gates from this family with very efficient quantum realizations for majority-based applications. They can be used to synthesize any reversible function of the same width in conjunction with inverters and Feynman (2-qubit controlled-NOT) gates. The gate universality problem is formulated in terms of elementary group theory and solved using the algebraic software GAP.