On the quantum hardness of solving isomorphism problems as nonabelian hidden shift problems
arXiv:quant-ph/0510185 · doi:10.26421/QIC7.5-6
Abstract
We consider an approach to deciding isomorphism of rigid n-vertex graphs (and related isomorphism problems) by solving a nonabelian hidden shift problem on a quantum computer using the standard method. Such an approach is arguably more natural than viewing the problem as a hidden subgroup problem. We prove that the hidden shift approach to rigid graph isomorphism is hard in two senses. First, we prove that Omega(n) copies of the hidden shift states are necessary to solve the problem (whereas O(n log n) copies are sufficient). Second, we prove that if one is restricted to single-register measurements, an exponential number of hidden shift states are required.
19 pages
References in corpus (9)
- The quantum query complexity of the hidden subgroup problem is polynomial
- 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
- Another subexponential-time quantum algorithm for the dihedral hidden subgroup problem
- The Symmetric Group Defies Strong Fourier Sampling: Part II
- Optimal measurements for the dihedral hidden subgroup problem
- The Hidden Subgroup Problem in Affine Groups: Basis Selection in Fourier Sampling
- The Power of Strong Fourier Sampling: Quantum Algorithms for Affine Groups and Hidden Shifts
- The Symmetric Group Defies Strong Fourier Sampling: Part I