2007/05/29 by Tomasz Magulski, Magulski, Tomasz, Łukasz Orłowski +1
Computer Science · Physics and Astronomy · #Computability, Logic, AI Algorithms #FOS: Physical sciences #Polynomial and algebraic computation #Quantum Computing Algorithms and Architecture #Quantum Physics (quant-ph) #quant-ph
paper · pdf · doi:10.48550/arxiv.0705.4289
11 pages, 6 tables
arxiv created 2007/05/29 · openalex publication_date 2007/05/29 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This 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.