Teleportation of geometric structures in 3D

Abstract

Simplest quantum teleportation algorithms can be represented in geometric terms in spaces of dimensions 3 (for real state-vectors) and 4 (for complex state-vectors). The geometric representation is based on geometric-algebra coding, a geometric alternative to the tensor-product coding typical of quantum mechanics. We discuss all the elementary ingredients of the geometric version of the algorithm: Geometric analogs of states and controlled Pauli gates. Fully geometric presentation is possible if one employs a nonstandard representation of directed magnitudes, formulated in terms of colors defined via stereographic projection of a color wheel, and not by means of directed volumes.

typos corrected, one plot removed

References in corpus (8)

• Tensor-product vs. geometric-product coding
• Cartoon Computation: Quantum-like computing without quantum mechanics
• The Landscape of Theoretical Physics: A Global View; From Point Particles to the Brane World and Beyond, in Search of a Unifying Principle
• Teleportation seen from space-time
• Elementary gates for cartoon computation
• An Extra Structure of Spacetime: A Space of Points, Areas and Volumes
• Superfast Algorithms and the Halting Problem in Geometric Algebra
• Geometric-Algebra Quantum-Like Algorithms: Simon's Algorithm