Elementary gates for cartoon computation

Simple item page
dc.creatorCzachor, Marek
dc.date2007-06-07
dc.date2007-07-19
dc.date.accessioned2026-07-07T08:18:54Z
dc.date.available2026-07-07T08:18:54Z
dc.descriptionThe 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.
dc.descriptionPublished version
dc.identifierhttps://arxiv.org/abs/0706.0967
dc.identifierhttp://arxiv.org/abs/0706.0967
dc.identifierJ. Phys. A: Math. Theor. 40 (2007) F753-F759
dc.identifierdoi:10.1088/1751-8113/40/31/F01
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/134594
dc.subjectQuantum Physics
dc.titleElementary gates for cartoon computation
dc.typetext

Files

Collections

arXiv