An Algorithm for Fast Multiplication of Pauli Numbers

被引：0
|
作者：
A. Cariow
G. Cariowa
机构：
[1] West Pomeranian University of Technology,
[2] Szczecin Faculty of Computer Science and Information Technology,undefined
来源：
Advances in Applied Clifford Algebras | 2015年 / 25卷
关键词：
Pauli numbers; multiplication of Pauli numbers; fast algorithm; matrix notation;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
In this paper we introduce an efficient algorithm for the multiplication of Pauli numbers. The direct multiplication of two Pauli numbers requires 64 real multiplications and 56 real additions. More effective solutions still do not exist. We show how to compute a product of the Pauli numbers with 24 conventional multiplications, 8 multiplications by 1/2 and 56 real additions.
引用
收藏
页码：53 / 63
页数：10
相关论文
共 50 条
12345