Notes on Geometric-Algebra Quantum-Like Algorithms
arXiv:quant-ph/0610187
Abstract
In these notes we present preliminary results on quantum-like algorithms where tensor product is replaced by geometric product. Such algorithms possess the essential properties typical of quantum computation (entanglement, parallelism) but employ additional algebraic structures typical of geometric algebra -- structures absent in standard quantum computation. As a test we reformulate in Geometric Algebra terms the Deutsch-Jozsa problem.
Preliminary version of notes
References in corpus (4)
- Quantum Aspects of Semantic Analysis and Symbolic Artificial Intelligence
- Expressing the operations of quantum computing in multiparticle geometric algebra
- Finite set of invariants to characterize local Clifford equivalence of stabilizer states
- On Geometric Algebra representation of Binary Spatter Codes