Abstract
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.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
R. Abłamowicz (ed.), Clifford Algebras – Applications to Mathematics, Physics, and Engineering. PIM 34, Birkhauser, Basel 2004.
Labunets V.: Clifford algebras as unified language for image processing and pattern recognition. Computational Noncommutative Algebra and Applications. NATO Science Series II: Mathematics, Physics and Chemistry, volume 136, 97–225 (2004)
J. Mennesson, Ch. Saint–Jean, L. Mascarilla, A phase correlation for color images using Clifford algebra. Applied Geometric Algebras in Computer Science and Engineering 9 (2010), 1–4.
T. Batard, M. Berthier, and C. Saint–Jean. Clifford Fourier transform for color image processing. In E. Bayro–Corrochano and G. Scheuermann Eds, editors, Geometric Algebra Computing in Engineering and Computer Science. chapter 8, Springer Verlag 2010, pages 135–161.
D. Hildenbrand , D. Fontijne , C. Perwass and L. Dorst, Geometric Algebra and its Application to Computer Graphics. Tutorial 3, in Proc. of 25th Annual Conference of the European Association for Computer Graphics, “Interacting with Virtual Worlds”, Grenoble, France, INRIA and Eurographics Association, ISSN 1017–4656.
Ebling J, Scheuermann G: Clifford Fourier transform on vector fields. IEEE Transactions on Visualization and Computer Graphics 11, 469–479 (2005)
R. Wareham, J. Cameron, and J. Lasenby, Applications of Conformal Geometric Algebra in Computer Vision and Graphics. H. Li, P. J. Olver and G. Sommer (Eds.), IWMM 2004, LNCS 3519, (2005) 329–349.
S. Karmakar, B. S. Rajan, Multigroup Decodable STBCs From Clifford Algebras. IEEE Transactions on Information Theory, vol. 55 No. 1 (2009), 223–231.
M.Ye. Ilchenko, T.N. Narytnik, & R.M. Didkovsky, Clifford algebra in multipleaccess noise–signal communication systems. Telecommunications and Radio Engineering, 72 (18) (2013), 1651–1663.
E. Malekian, A. Zakerolhosseini and A. Mashatan, QTRU: QuaternionicVersion of the NTRUPublic–Key Cryptosystems. The ISC Int’l Journal of Information Security, vol. 3, No 1 (2011), 29–42.
Silvestrov V.V.: Number Systems. Soros Educational Journal No 8, 121–127 (1998)
O. M. Makarov, An algorithm for the multiplication of two quaternions. Zh. Vychisl. Mat. Mat. Fiz. 17 6 (1977), 1574–1575.
A. Cariow, G. Cariowa, Algorithm for multiplying two octonions. Radioelectronics and Communications Systems (Allerton Press, Inc. USA), vol. 55, Issue 10 (2012), 464–473.
Cariow A, Cariowa G: An algorithm for fast multiplication of sedenions. Information Processing Letters 113, 324–331 (2013)
A. Ţariov. Algorithmic aspects of computing rationalization in digital signal processing (in Polish), West Pomeranian University Press, 232, (2011).
W. H. Steeb, Y. Hardy, Matrix Calculus and Kronecker Product: A Practical Approach to Linear and Multilinear Algebra. World Scientific Publishing Company; 2 edition, 324 pages (March 24, 2011).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution License which permits any use, distribution, and reproduction in any medium, provided the original author(s) and the source are credited.
About this article
Cite this article
Cariow, A., Cariowa, G. An Algorithm for Fast Multiplication of Pauli Numbers. Adv. Appl. Clifford Algebras 25, 53–63 (2015). https://doi.org/10.1007/s00006-014-0466-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00006-014-0466-0