Cartoon computation: quantum-like computing without quantum mechanics
From MaRDI portal
Abstract: We present a computational framework based on geometric structures. No quantum mechanics is involved, and yet the algorithms perform tasks analogous to quantum computation. Tensor products and entangled states are not needed -- they are replaced by sets of basic shapes. To test the formalism we solve in geometric terms the Deutsch-Jozsa problem, historically the first example that demonstrated the potential power of quantum computation. Each step of the algorithm has a clear geometric interpetation and allows for a cartoon representation.
Recommendations
Cited in
(8)- Geometric analogue of holographic reduced representation
- A loophole of all `loophole-free' Bell-type theorems
- Solovay-Kitaev approximations of special orthogonal matrices
- Operator calculus and invertible Clifford Appell systems: theory and application on the n-particle fermion algebra
- An improved formalism for quantum computation based on geometric algebra -- case study: Grover's search algorithm
- Kravchuk matrices and induced operators on Clifford algebras
- Elementary gates for cartoon computation
- A geometric algebra perspective on quantum computational gates and universality in quantum computing
This page was built for publication: Cartoon computation: quantum-like computing without quantum mechanics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3431673)
