De Vos, Alexis; De Beule, Jan; Storme, Leo Computing with the square root of NOT. (English) Zbl 1198.94207 Serdica J. Comput. 3, No. 4, 359-370 (2009). Summary: 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. MSC: 94C99 Circuits, networks 65Y05 Parallel numerical computation Keywords:reversible computing; square root of NOT; discrete group PDFBibTeX XMLCite \textit{A. De Vos} et al., Serdica J. Comput. 3, No. 4, 359--370 (2009; Zbl 1198.94207) Full Text: EuDML