Quantum State Detection Via Elimination

Simple item page
dc.creatorEttinger, J. Mark
dc.creatorHoyer, Peter
dc.date1999-05-28
dc.date.accessioned2026-07-07T06:16:36Z
dc.date.available2026-07-07T06:16:36Z
dc.descriptionWe 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.
dc.description8 pages, no figures
dc.identifierhttps://arxiv.org/abs/quant-ph/9905099
dc.identifierhttp://arxiv.org/abs/quant-ph/9905099
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/94110
dc.subjectQuantum Physics
dc.titleQuantum State Detection Via Elimination
dc.typetext

Files

Collections

arXiv