This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05)
From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups
Pittsburgh, Pennsylvania, USA
October 23-October 25
ISBN: 0-7695-2468-0
Dave Bacon, Dave Bacon
Andrew M. Childs, Andrew M. Childs
Wim van Dam, Wim van Dam

We approach the hidden subgroup problem by performing the so-called pretty good measurement on hidden subgroup states. For various groups that can be expressed as the semidirect product of an abelian group and a cyclic group, we show that the pretty good measurement is optimal and that its probability of success and unitary implementation are closely related to an average-case algebraic problem. By solving this problem, we find efficient quantum algorithms for a number of nonabelian hidden subgroup problems, including some for which no efficient algorithm was previously known: certain metacyclic groups as well as all groups of the form Z^r _p xZp for fixed r (including the Heisenberg group, r = 2). In particular, our results show that entangled measurements across multiple copies of hidden subgroup states can be useful for efficiently solving the nonabelian HSP.

Citation:
Dave Bacon, Andrew M. Childs, Wim van Dam, "From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups," focs, pp.469-478, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.