An algorithm for fast multiplication of Pauli numbers
From MaRDI portal
Recommendations
- New method of calculating a multiplication by using the generalized Bernstein-Vazirani algorithm
- On some algebras connected with fast algorithms
- An algorithm for fast multiplication of sedenions
- Fast algorithms for complex matrix multiplication using surrogates
- An effective algorithm for multiplication of a circulant matrix of large dimension by a column
Cites work
- An algorithm for fast multiplication of sedenions
- Clifford-Fourier transform for color image processing
- Computer Algebra and Geometric Algebra with Applications
- scientific article; zbMATH DE number 3614072 (Why is no real title available?)
- scientific article; zbMATH DE number 1285979 (Why is no real title available?)
- scientific article; zbMATH DE number 5019967 (Why is no real title available?)
- Matrix calculus and Kronecker product. A practical approach to linear and multilinear algebra
- Multigroup Decodable STBCs From Clifford Algebras
Cited in
(4)- An algorithm for fast multiplication of sedenions
- Almost periodic oscillation of octonion-valued neural networks with delays on time scales
- Paulicomposer: compute tensor products of Pauli matrices efficiently
- New method of calculating a multiplication by using the generalized Bernstein-Vazirani algorithm
This page was built for publication: An algorithm for fast multiplication of Pauli numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2340054)