The Optimal Single Copy Measurement for the Hidden Subgroup Problem

Abstract

The optimization of measurements for the state distinction problem has recently been applied to the theory of quantum algorithms with considerable successes, including efficient new quantum algorithms for the non-abelian hidden subgroup problem. Previous work has identified the optimal single copy measurement for the hidden subgroup problem over abelian groups as well as for the non-abelian problem in the setting where the subgroups are restricted to be all conjugate to each other. Here we describe the optimal single copy measurement for the hidden subgroup problem when all of the subgroups of the group are given with equal a priori probability. The optimal measurement is seen to be a hybrid of the two previously discovered single copy optimal measurements for the hidden subgroup problem.

8 pages. Error in main proof fixed

References in corpus (5)

• Efficient Quantum Circuits for Schur and Clebsch-Gordan Transforms
• From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups
• A Subexponential Time Algorithm for the Dihedral Hidden Subgroup Problem with Polynomial Space
• The Hidden Subgroup Problem - Review and Open Problems
• How a Clebsch-Gordan Transform Helps to Solve the Heisenberg Hidden Subgroup Problem

Cited by in corpus (3)

• Two-sided estimates of minimum-error distinguishability of mixed quantum states via generalized Holevo-Curlander bounds
• Error rates of Belavkin weighted quantum measurements and a converse to Holevo's asymptotic optimality theorem
• Estimates of non-optimality of quantum measurements and a simple iterative method for computing optimal measurements