TY - JOUR
N2 - First sections of the paper contain some considerations relevant to the reversibility of quantum gates. The Solovay-Kitayev theorem shows that using proper set of quantum gates one can build a quantum version of the nondeterministic Turing machine. On the other hand the Gottesmann-Knill theorem shows the possibility to simulate the quantum machine consisting of only Clifford/Pauli group of gates. This paper presents also an original method of designing the reversible functions. This method is intended for the most popular gate set with three types of gates CNT (Control, NOT and Toffoli). The presented algorithm leads to cascade with minimal number CNT gates. This solution is called optimal reversible circuits. The paper is organized as follows. Section 5 recalls basic concepts of reversible logic. Section 6 contain short description of CNT set of the reversible gates. In Section 7 is presented form of result of designing as the cascade of gates. Section 8 describes the algorithm and section 9 simple example.
L1 - http://www.czasopisma.pan.pl/Content/131813/32-4638-Skorupski-sk.pdf
L2 - http://www.czasopisma.pan.pl/Content/131813
PY - 2024
IS - No 2
EP - 508
DO - 10.24425/ijet.2024.149572
KW - reversible logic
KW - reversible circuits
KW - reversible gate
KW - CNT set of the gates
A1 - Skorupski, Andrzej
A1 - Romaniuk, Ryszard
PB - Polish Academy of Sciences Committee of Electronics and Telecommunications
VL - vol. 70
DA - 25.06.2024
T1 - Designing of Reversible Functions in Classical and Quantum Domains
SP - 501
UR - http://www.czasopisma.pan.pl/dlibra/publication/edition/131813
T2 - International Journal of Electronics and Telecommunications
ER -