Optimal measurements for the dihedral hidden subgroup problem
From MaRDI portal
Publication:3594442
DOI10.4086/CJTCS.2006.002zbMath1117.81010arXivquant-ph/0501044OpenAlexW1603109705MaRDI QIDQ3594442
Dave Morris Bacon, Wim van Dam, Andrew M. Childs
Publication date: 8 August 2007
Published in: Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)
Abstract: We consider the dihedral hidden subgroup problem as the problem of distinguishing hidden subgroup states. We show that the optimal measurement for solving this problem is the so-called pretty good measurement. We then prove that the success probability of this measurement exhibits a sharp threshold as a function of the density nu=k/log N, where k is the number of copies of the hidden subgroup state and 2N is the order of the dihedral group. In particular, for nu<1 the optimal measurement (and hence any measurement) identifies the hidden subgroup with a probability that is exponentially small in log N, while for nu>1 the optimal measurement identifies the hidden subgroup with a probability of order unity. Thus the dihedral group provides an example of a group G for which Omega(log|G|) hidden subgroup states are necessary to solve the hidden subgroup problem. We also consider the optimal measurement for determining a single bit of the answer, and show that it exhibits the same threshold. 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. 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 the ability to quantum sample from subset sum solutions allows one to implement the optimal measurement.
Full work available at URL: https://arxiv.org/abs/quant-ph/0501044
Quantum computation (81P68) Quantum measurement theory, state operations, state preparations (81P15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (8)
Random measurement bases, quantum state distinction and applications to the hidden subgroup problem ⋮ Algebraic Methods in Quantum Informatics ⋮ Quantum algorithm design: techniques and applications ⋮ On the optimal error exponents for classical and quantum antidistinguishability ⋮ Post-quantum \(\kappa\)-to-1 trapdoor claw-free functions from extrapolated dihedral cosets ⋮ Unnamed Item ⋮ Leveraging the hardness of dihedral coset problem for quantum cryptography ⋮ New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups
This page was built for publication: Optimal measurements for the dihedral hidden subgroup problem
