A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem

  title={A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem},
  author={Greg Kuperberg},
  journal={SIAM J. Comput.},
  • G. Kuperberg
  • Published 2005
  • Mathematics, Physics, Computer Science
  • SIAM J. Comput.
We present a quantum algorithm for the dihedral hidden subgroup problem (DHSP) with time and query complexity $2^{O(\sqrt{\log\ N})}$. In this problem an oracle computes a function $f$ on the dihedral group $D_N$ which is invariant under a hidden reflection in $D_N$. By contrast, the classical query complexity of DHSP is $O(\sqrt{N})$. The algorithm also applies to the hidden shift problem for an arbitrary finitely generated abelian group. The algorithm begins as usual with a quantum character… Expand
Another Subexponential-time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
We give an algorithm for the hidden subgroup problem for the dihedral group D_N, or equivalently the cyclic hidden shift problem, that supersedes our first algorithm and is suggested by Regev'sExpand
The Power of Strong Fourier Sampling: Quantum Algorithms for Affine Groups and Hidden Shifts
This article shows that hidden subgroups of theq-hedral groups, i.e., semidirect products, and in particular the affine groups $A_p, can be information-theoretically reconstructed using the strong standard method, and proves a simple closure property for the class of groups over which the hidden subgroup problem can be solved efficiently. Expand
Efficient Quantum Algorithms for the Hidden Subgroup Problem over a Class of Semi-direct Product Groups
This paper describes a polynomial-time quantum algorithm solving the hidden subgroup problem (HSP) over the class of semi-direct product groups, for p and q prime, where p is an odd prime. Expand
Almost tight bound on the query complexity of generalized Simon's problem
It is proved that any classical deterministic algorithm solving generalized Simon's problem has to query at least $\Omega(\sqrt{k \cdot 2^{n-k}})$ values, clarifying the gap between quantum and classical computing on this problem. Expand
Solutions to the Hidden Subgroup Problem on Some Metacyclic Groups
A new polynomial-time quantum algorithm that solves the hidden subgroup problem (HSP) for a special class of metacyclic groups, namely p, q, with q |(p−1) and p/q=poly(log p), with time and query complexity $2^{O(\sqrt{\log p})}$. Expand
Quantum algorithm for the Boolean hidden shift problem
While the extremal case of the Boolean hidden shift problem over so-called bent functions can be reduced to a hidden subgroup problem over an abelian group, the more general case studied here does not seem to allow such a reduction. Expand
Quantum Algorithms for Learning Symmetric Juntas via the Adversary Bound
  • Aleksandrs Belovs
  • Mathematics, Physics
  • 2014 IEEE 29th Conference on Computational Complexity (CCC)
  • 2014
This paper constructs optimal quantum query algorithms for the cases when h is the XOR or the OR function, or the exact-half function or the majority function, and proves an upper bound of $${O(k^{1/4})}$$O (k 1/4). Expand
A classical one-way function to confound quantum adversaries
The promise of quantum computation and its consequences for complexity-theoretic cryptography motivates an immediate search for cryptosystems which can be implemented with current technology, butExpand
Quantum Algorithms to Solve the Hidden Shift Problem for Quadratics and for Functions of Large Gowers Norm
Most quantum algorithms that give an exponential speedup over classical algorithms exploit the Fourier transform in some way. In Shor's algorithm, sampling from the quantum Fourier spectrum is usedExpand
An Efficient Quantum Algorithm for the Hidden Subgroup Problem over Weyl-Heisenberg Groups
This work shows that the HSP over Weyl-Heisenberg groups can be solved efficiently on a quantum computer and uses Clebsch-Gordan decompositions to combine and reduce tensor products of irreducible representations. Expand


Hidden Subgroup States are Almost Orthogonal
It is well known that quantum computers can efficiently find a hidden subgroup $H$ of a finite Abelian group $G$. This implies that after only a polynomial (in $\log |G|$) number of calls to theExpand
Normal subgroup reconstruction and quantum computation using group representations
It is shown that an immediate generalization of the Abelian case solution to the non-Abelian case does not efficiently solve Graph Isomorphism. Expand
Quantum computation of Fourier transforms over symmetric groups
  • R. Beals
  • Mathematics, Computer Science
  • STOC '97
  • 1997
A quantum polynomial time algorithm for the Fourier transform for the symmetric groups Sn is given, adapting results obtained by Clausen and Diaconis–Rockmore to the quantum setting. Expand
Quantum algorithms for some hidden shift problems
The hidden coset problem is defined, which generalizes the hidden shift problem and the hidden subgroup problem and provides a unified way of viewing the ability of the Fourier transform to capture subgroup and shift structure. Expand
Exact quantum Fourier transforms and discrete logarithm algorithms
We show how the Quantum Fast Fourier Transform (QFFT) can be made exact for arbitrary orders (first showing it for large primes). Most quantum algorithms only need a good approximation of the quantumExpand
On the Power of Quantum Computation
This work presents a problem of distinguishing between two fairly natural classes of functions, which can provably be solved exponentially faster in the quantum model than in the classical probabilistic one, when the function is given as an oracle drawn equiprobably from the uniform distribution on either class. Expand
On Quantum Algorithms for Noncommutative Hidden Subgroups
A quantum algorithm is presented for the special case of dihedral groups which determines the hidden subgroup in a linear number of calls to the input function. Expand
Generic quantum Fourier transforms
This paper uses Bratteli diagrams, Gel'fand-Tsetlin bases, and strong generating sets of small adapted diameter to provide efficient quantum circuits for the QFT over a wide variety of finite Abelian and non-Abelian groups, including all group families for which efficient QFTs are currently known and many new group families. Expand
Quantum computation and lattice problems
  • O. Regev
  • Mathematics, Computer Science
  • The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.
  • 2002
We present the first explicit connection between quantum computation and lattice problems. Namely, we show a solution to the unique shortest vector problem (SVP) under the assumption that thereExpand
Noise-tolerant learning, the parity problem, and the statistical query model
The algorithm runs in polynomial time for the case of parity functions that depend on only the first O(log n log log n) bits of input, which provides the first known instance of an efficient noise-tolerant algorithm for a concept class that is not learnable in the Statistical Query model of Kearns [1998]. Expand