Two Problems on Quantum Computing in Finite Abelian Groups
Quantum Physics
2026-04-02 v1 Group Theory
Abstract
In the context of finite Abelian groups two problems are presented and solved using quantum computing techniques. The first is the well--known Hidden Subgroup Problem, originally solved by Simon in a landmark work. The second is the Fully Balanced Image Problem, originally introduced by the authors (joint with J. Ossorio--Castillo), which is related to a certain class of mappings (which contains strictly, for instance, the family of group morphisms). Both problems are tackled using a combination of two techniques: first, a conversion into Boolean objects, better suited for quantum computing arguments, and subsequently a custom--tailored algorithm which takes advantage of the Generalised Phase--Kick Back technique.
Cite
@article{arxiv.2604.00929,
title = {Two Problems on Quantum Computing in Finite Abelian Groups},
author = {Ulises Pastor-Díaz and José M. Tornero},
journal= {arXiv preprint arXiv:2604.00929},
year = {2026}
}
Comments
23 pages