dorsal/arxiv
View SchemaPolynomial-Time Solution to the Hidden Subgroup Problem for a Class of non-abelian Groups
| Authors | Martin Roetteler, Thomas Beth |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/9812070 |
| URL | https://arxiv.org/abs/quant-ph/9812070 |
Abstract
We present a family of non-abelian groups for which the hidden subgroup problem can be solved efficiently on a quantum computer.
{
"annotation_id": "0739b936-7132-4a18-8631-b8ed7c9a17f9",
"date_created": "2026-03-02T18:02:44.970000Z",
"date_modified": "2026-03-02T18:02:44.970000Z",
"file_hash": "5d3efb931d1e75f4550b29dcd6472bdaf0adb8ce3e3f697830e11a204f05724a",
"private": false,
"record": {
"abstract": "We present a family of non-abelian groups for which the hidden subgroup\nproblem can be solved efficiently on a quantum computer.",
"arxiv_id": "quant-ph/9812070",
"authors": [
"Martin Roetteler",
"Thomas Beth"
],
"categories": [
"quant-ph",
"cs.ET"
],
"title": "Polynomial-Time Solution to the Hidden Subgroup Problem for a Class of non-abelian Groups",
"url": "https://arxiv.org/abs/quant-ph/9812070"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "e26cb699-0ce1-41b0-9747-9557ec1e7f0f",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}