dorsal/arxiv
View SchemaQuantum State Detection Via Elimination
| Authors | J. Mark Ettinger, Peter Hoyer |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/9905099 |
| URL | https://arxiv.org/abs/quant-ph/9905099 |
Abstract
We present the view of quantum algorithms as a search-theoretic problem. We show that the Fourier transform, used to solve the Abelian hidden subgroup problem, is an example of an efficient elimination observable which eliminates a constant fraction of the candidate secret states with high probability. Finally, we show that elimination observables do not always exist by considering the geometry of the hidden subgroup states of the dihedral group D_N.
{
"annotation_id": "026fd91a-714c-45fc-97f3-fc988dd19ba9",
"date_created": "2026-03-02T18:02:48.355000Z",
"date_modified": "2026-03-02T18:02:48.355000Z",
"file_hash": "a711b69e63201aeeed89f5374471f3eb12a63d17bac8a890504198e5737e2390",
"private": false,
"record": {
"abstract": "We present the view of quantum algorithms as a search-theoretic problem. We\nshow that the Fourier transform, used to solve the Abelian hidden subgroup\nproblem, is an example of an efficient elimination observable which eliminates\na constant fraction of the candidate secret states with high probability.\nFinally, we show that elimination observables do not always exist by\nconsidering the geometry of the hidden subgroup states of the dihedral group\nD_N.",
"arxiv_id": "quant-ph/9905099",
"authors": [
"J. Mark Ettinger",
"Peter Hoyer"
],
"categories": [
"quant-ph"
],
"title": "Quantum State Detection Via Elimination",
"url": "https://arxiv.org/abs/quant-ph/9905099"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "6e659d01-2740-4880-8a90-786c2835dc3b",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}