Boolean quantum logic operations
Keywords:
квантові обчислення, логічні операції, булева алгебраAbstract
The paper proposes generalization of Boolean logic operations intended for quantum computing. It is shown that the basic set of Boolean one-qubit operations contains 6 ones and has 2 variants of sets of 4 operations. 9 unary quantum operations are proposed in addition to 7 classical ones (equivalence, OR, XOR, AND, NOR, NAND, implication). As a result, a complete set of 16 one-qubit operations was obtained, which provides 164 = 65 thousand 536 binary (two-qubit) logical operations that corresponds to the number of base states of a 16-qubit quantum processor. Large number of operations will allow increase performance of computing in digital simulators of quantum processors from the viewpoint of computing parallelism and reducing the program cod.
References
Wolf E.L. Quantum Nanoelectronics: An Introduction to Electronic Nanotechnology and Quantum Computing. – Wiley. – 2009. – 472 р.
Voitovych I.D., Korsunskyi V.M. Perspectyvy kvantovykh obchyslen z vykorystanniam nadprovidnosti // Matematychni mashyny i systemy. – 2008. – No. 4. – P. 23–56
Budnyk M.M., Bauzha O.S., Voitovych I.D., Korsunskyi V.M. Vstup do kvantovykh obchyslen ta kvantovykh kompiuteriv: navchalnyi posibnyk. – Kyiv: Interservis, 2014. – 95 p.
