Reversible Computing Square Root of NOT Discrete Group
Issue Date:
2009
Publisher:
Institute of Mathematics and Informatics Bulgarian Academy of Sciences
Citation:
Serdica Journal of Computing, Vol. 3, No 4, (2009), 359p-370p
Abstract:
To the two classical reversible 1-bit logic gates, i.e. the identity
gate (a.k.a. the follower) and the NOT gate (a.k.a. the inverter), we add an
extra gate, the square root of NOT. Similarly, we add to the 24 classical reversible 2-bit circuits, both the square root of NOT and the controlled square
root of NOT. This leads to a new kind of calculus, situated between classical
reversible computing and quantum computing.