Reversible Majority Voter Based on Fredkin Gates
Sergey Feofentovich Tyurin · 2020
As known Q-bits, Q-bytes, Quantum computing, Reversible calculations have recently become the perspective IT technologies. In such area, special elements are used, for example, Feynman gates, Toffoli gates, Fredkin gates etc. However, quantum calculations requires the solving a lot of problems of data representation. Nonetheless, reversible approach can be successfully used in binary case for the design of checkable and energy-efficient ("green") circuits. In such direction, so-called "adiabatic" and "billiard" logic is of most interest. However, binary reversible "billiard" gates have more inputs and outputs than usual gates, they have "trash" outputs. At the same time, the reliability problems of such circuits have not yet been fully resolved. The article discusses the question of tripling Fredkin’s circuits. The author develops and studies Reversible Majority Voter based on Fredkin’s gates. The analysis of three channels requires six additional bits, and the circuit has five Fredkin elements and five garbage outputs.