Булеві квантові логічні операції
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 (equivalenc...
Збережено в:
| Дата: | 2023 |
|---|---|
| Автор: | |
| Формат: | Стаття |
| Мова: | Українська |
| Опубліковано: |
Інститут прикладних проблем механіки і математики ім. Я. С. Підстригача НАН України
2023
|
| Теми: | |
| Онлайн доступ: | https://www.fmmit.lviv.ua/index.php/fmmit/article/view/272 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| Назва журналу: | Physico-mathematical modeling and informational technologies |
| Завантажити файл: |  |
Репозитарії
Physico-mathematical modeling and informational technologies| Резюме: | 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. |
|---|