dorsal/arxiv
View SchemaControl-target inversion property on Abelian groups
| Authors | Massoud Amini |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0308148 |
| URL | https://arxiv.org/abs/quant-ph/0308148 |
Abstract
We show that the quantum Fourier transform on finite fields used to solve query problems is a special case of the usual quantum Fourier transform on finite abelian groups. We show that the control/target inversion property holds in general. We apply this to get a sharp query complexity separation between classical and quantum algorithms for a hidden homomorphism problem on finite Abelian groups.
{
"annotation_id": "6b4d3b66-a98e-41d1-a855-7cce3bcd574e",
"date_created": "2026-03-02T18:02:02.266000Z",
"date_modified": "2026-03-02T18:02:02.266000Z",
"file_hash": "75a1501a91109ab84094d887e2be212e1391ed800bd6e947cdb1a06ce0d0c5ff",
"private": false,
"record": {
"abstract": "We show that the quantum Fourier transform on finite fields used to solve\nquery problems is a special case of the usual quantum Fourier transform on\nfinite abelian groups. We show that the control/target inversion property holds\nin general. We apply this to get a sharp query complexity separation between\nclassical and quantum algorithms for a hidden homomorphism problem on finite\nAbelian groups.",
"arxiv_id": "quant-ph/0308148",
"authors": [
"Massoud Amini"
],
"categories": [
"quant-ph"
],
"title": "Control-target inversion property on Abelian groups",
"url": "https://arxiv.org/abs/quant-ph/0308148"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "cc3a7f0f-2d70-44f5-ba85-9c468ef8e471",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}