Elementary gates for cartoon computation

DOI10.1088/1751-8113/40/31/F01MaRDI QIDQ5757581zbMATH OpenWikidataFDO

Authors Marek Czachor

Publication date 7 September 2007

Published in Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0706.0967

Mathematics Subject Classification ID

Quantum computation (81P68)

Abstract: The basic one-bit gates (X, Y, Z, Hadamard, phase, pi/8) as well as the controlled cnot and Toffoli gates are reformulated in the language of geometric-algebra quantum-like computation. Thus, all the quantum algorithms can be reformulated in purely geometric terms without any need of tensor products.

Recommendations

• Cartoon computation: quantum-like computing without quantum mechanics
• On computations with dessins d'enfants
• A Coinductive Animation of Turing Machines
• Abelian logic gates
• Circuits and expressions with nonassociative gates
• Physical portrayal of computational complexity
• Circuits, matrices, and nonassociative computation
• scientific article; zbMATH DE number 1396672
• Combinational circuits in a one-element basis
• Exact synthesis of elementary quantum gate circuits

Cited in

(5)

• Geometric analogue of holographic reduced representation
• A loophole of all `loophole-free' Bell-type theorems
• Solovay-Kitaev approximations of special orthogonal matrices
• Cartoon computation: quantum-like computing without quantum mechanics
• A geometric algebra perspective on quantum computational gates and universality in quantum computing

This page was built for publication: Elementary gates for cartoon computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5757581)