Про молекулярно-кластерні логічні стани і матричні представлення сталих і балансних булевих функцій
Representing a bonding manifold of a molecule or molecular cluster by a graph given by a set of vertices associated with atoms and a set of edges imitating bonds, the bonding edge encoding formalism is defined on n-tuples qubits in terms of the NOT logic gate acting on the "non-bonded" str...
Збережено в:
| Видавець: | Publishing house "Academperiodika" |
|---|---|
| Дата: | 2022 |
| Автор: | |
| Формат: | Стаття |
| Мова: | English |
| Опубліковано: |
Publishing house "Academperiodika"
2022
|
| Теми: | |
| Онлайн доступ: | https://ujp.bitp.kiev.ua/index.php/ujp/article/view/2022061 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
Репозиторії
Ukrainian Journal of Physics| Резюме: | Representing a bonding manifold of a molecule or molecular cluster by a graph given by a set of vertices associated with atoms and a set of edges imitating bonds, the bonding edge encoding formalism is defined on n-tuples qubits in terms of the NOT logic gate acting on the "non-bonded" string. This formalism is illustrated by the simplest diatomic and triatomic molecules whose adjacency matrices generate different quadratic Boolean functions, among which the balanced function appears. In this regard, we review the Deutsch–Jozsa quantum algorithm, well-known in quantum computing, that discriminates between the balanced and constant Boolean functions. A novel matrix representation of the constant-balancedquantum oracle within this algorithm is elaborated. The proposed approach is generalized to distinguish between constant and evenly balanced Boolean functions. |
|---|