Logical Structures Underlying Quantum Computing

被引:5
|
作者
Holik, Federico [1 ]
Sergioli, Giuseppe [2 ]
Freytes, Hector [2 ]
Plastino, Angel [1 ]
机构
[1] Univ Nacl La Plata, CONICET, CCT, Inst Fis,IFLP, CC 727, RA-1900 La Plata, Buenos Aires, Argentina
[2] Univ Cagliari, Dipartimento Pedagogia, Psicol, Filosofia, Via Is Mirrionis 1, I-09123 Cagliari, Italy
来源
ENTROPY | 2019年 / 21卷 / 01期
关键词
quantum computing; non-kolmogorovian probability; quantum computational gates;
D O I
10.3390/e21010077
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
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.
引用
收藏
页数:13
相关论文
共 50 条