Logical structures underlying quantum computing

F Holik, G Sergioli, H Freytes, A Plastino - Entropy, 2019 - mdpi.com
F Holik, G Sergioli, H Freytes, A Plastino
Entropy, 2019mdpi.com
… We outline an algebraic axiomatization of these structures. … In this paper, we focus on
the following problem: the characterization of the logical and algebraic structures underlying
quantum algorithms. The characterization of these structures is of fundamental importance
for understanding the peculiarities of quantum computation. …
In this work we advance a generalization of quantum computational logics capable of dealing with some important examples of quantum algorithms. We outline an algebraic axiomatization of these structures.
MDPI
顯示最佳搜尋結果。 查看所有結果