Geometric-Algebra Quantum-Like Algorithms: Simon's Algorithm

Simple item page
dc.creatorMagulski, Tomasz
dc.creatorOrłowski, Łukasz
dc.date2007-05-29
dc.date.accessioned2026-07-07T08:03:33Z
dc.date.available2026-07-07T08:03:33Z
dc.descriptionThis is continuation of the approach to performing quantum algorithms using geometric structures which was presented by Aerts and Czachor. We solve the Simon's problem which, next to the Shor's alghorithm, is a representative of a quantum hidden subgroup class. We also highlight some advantages resulting from the fact that no quantum mechanics is involved.
dc.description11 pages, 6 tables
dc.identifierhttps://arxiv.org/abs/0705.4289
dc.identifierhttp://arxiv.org/abs/0705.4289
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/129616
dc.subjectQuantum Physics
dc.titleGeometric-Algebra Quantum-Like Algorithms: Simon's Algorithm
dc.typetext

Files

Collections

arXiv