##
###
Optimal measurements for the dihedral hidden subgroup problem
[article]

Dave Bacon, Andrew M. Childs, Wim van Dam

2005
*
arXiv
*
pre-print

In particular, we show that an *efficient* quantum *algorithm* *for* a restricted version of the optimal measurement would imply an *efficient* quantum *algorithm* *for* the *subset* *sum* *problem*, *and* conversely, that ...
Finally, we consider implementing the optimal measurement by a quantum circuit, *and* thereby establish further connections between the dihedral hidden subgroup *problem* *and* average case *subset* *sum* *problems* ...
We thank Carlos Mochon *and* Frank Verstraete *for* helpful discussions of Theorem 1, *and* Abie Flaxman *for* correspondence regarding the *algorithm* in [16] *and* an earlier version thereof. ...

arXiv:quant-ph/0501044v1
fatcat:cgvue7uxerbmnltvowgadqxv6u