Cartoon Computation: Quantum-like computing without quantum mechanics

Simple item page
dc.creatorAerts, Diederik
dc.creatorCzachor, Marek
dc.date2006-11-28
dc.date2007-02-18
dc.date.accessioned2026-07-07T07:51:45Z
dc.date.available2026-07-07T07:51:45Z
dc.descriptionWe 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.
dc.descriptionversion accepted in J. Phys.A (Letter to the Editor)
dc.identifierhttps://arxiv.org/abs/quant-ph/0611279
dc.identifierhttp://arxiv.org/abs/quant-ph/0611279
dc.identifierJ. Phys. A: Math. Theor. 40 (2007) F259-F266
dc.identifierdoi:10.1088/1751-8113/40/13/F01
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/125627
dc.subjectQuantum Physics
dc.titleCartoon Computation: Quantum-like computing without quantum mechanics
dc.typetext

Files

Collections

arXiv