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

2005 ◽  
Vol 35 (1) ◽  
pp. 170-188 ◽  
Author(s):  
Greg Kuperberg
2007 ◽  
Vol 7 (5&6) ◽  
pp. 559-570
Author(s):  
Y. Inui ◽  
F. Le Gall

In this paper, we consider the hidden subgroup problem (HSP) over the class of semi-direct product groups $\mathbb{Z}_{p^r}\rtimes\mathbb{Z}_q$, for $p$ and $q$ prime. We first present a classification of these groups in five classes. Then, we describe a polynomial-time quantum algorithm solving the HSP over all the groups of one of these classes: the groups of the form $\mathbb{Z}_{p^r}\rtimes\mathbb{Z}_p$, where $p$ is an odd prime. Our algorithm works even in the most general case where the group is presented as a black-box group with not necessarily unique encoding. Finally, we extend this result and present an efficient algorithm solving the HSP over the groups $\mathbb{Z}^m_{p^r}\rtimes\mathbb{Z}_p$.


2007 ◽  
Vol 7 (1&2) ◽  
pp. 83-92
Author(s):  
R. Schutzhold ◽  
W.G. Unruh

The fastest quantum algorithms (for the solution of classical computational tasks) known so far are basically variations of the hidden subgroup problem with {$f(U[x])=f(x)$}. Following a discussion regarding which tasks might be solved efficiently by quantum computers, it will be demonstrated by means of a simple example, that the detection of more general hidden (two-point) symmetries {$V\{f(x),f(U[x])\}=0$} by a quantum algorithm can also admit an exponential speed-up. E.g., one member of this class of symmetries {$V\{f(x),f(U[x])\}=0$} is discrete self-similarity (or discrete scale invariance).


2003 ◽  
Vol 14 (05) ◽  
pp. 723-739 ◽  
Author(s):  
GÁBOR IVANYOS ◽  
FRÉDÉRIC MAGNIEZ ◽  
MIKLOS SANTHA

In this paper we show that certain special cases of the hidden subgroup problem can be solved in polynomial time by a quantum algorithm. These special cases involve finding hidden normal subgroups of solvable groups and permutation groups, finding hidden subgroups of groups with small commutator subgroup and of groups admitting an elementary Abelian normal 2-subgroup of small index or with cyclic factor group.


2017 ◽  
Vol 18 (2) ◽  
pp. 0215 ◽  
Author(s):  
Demerson Nunes Gonçalves ◽  
Tharso D Fernandes ◽  
C M M Cosme

The hidden subgroup problem (HSP) plays an important role in quantum computation, because many quantum algorithms that are exponentially faster than classical algorithms are special cases of the HSP. In this paper we show that there exist a new efficient quantum algorithm for the HSP on groups $\Z_{N}\rtimes\Z_{q^s}$ where $N$ is an integer with a special prime factorization, $q$ prime number and $s$ any positive integer.


2008 ◽  
Vol 8 (5) ◽  
pp. 438-487
Author(s):  
D. Bacon

It has recently been shown that quantum computers can efficiently solve the Heisenberg hidden subgroup problem, a problem whose classical query complexity is exponential. This quantum algorithm was discovered within the framework of using pretty good measurements for obtaining optimal measurements in the hidden subgroup problem. Here we show how to solve the Heisenberg hidden subgroup problem using arguments based instead on the symmetry of certain hidden subgroup states. The symmetry we consider leads naturally to a unitary transform known as the Clebsch-Gordan transform over the Heisenberg group. This gives a new representation theoretic explanation for the pretty good measurement derived algorithm for efficiently solving the Heisenberg hidden subgroup problem and provides evidence that Clebsch-Gordan transforms over finite groups are a new primitive in quantum algorithm design.


2012 ◽  
Vol 12 (7&8) ◽  
pp. 661-669
Author(s):  
Gabor Ivanyos

We present a quantum algorithm for solving the hidden subgroup problem in the general linear group over a finite field where the hidden subgroup is promised to be a conjugate of the group of the invertible lower triangular matrices. The complexity of the algorithm is polynomial when size of the base field is not much smaller than the degree.


Algorithmica ◽  
2010 ◽  
Vol 62 (1-2) ◽  
pp. 480-498 ◽  
Author(s):  
Gábor Ivanyos ◽  
Luc Sanselme ◽  
Miklos Santha

2014 ◽  
Vol 8 (4) ◽  
Author(s):  
Andrew M. Childs ◽  
Gábor Ivanyos

AbstractWe describe an efficient quantum algorithm for computing discrete logarithms in semigroups using Shor's algorithms for period finding and the discrete logarithm problem as subroutines. Thus proposed cryptosystems based on the presumed hardness of discrete logarithms in semigroups are insecure against quantum attacks. In contrast, we show that some generalizations of the discrete logarithm problem are hard in semigroups despite being easy in groups. We relate a shifted version of the discrete logarithm problem in semigroups to the dihedral hidden subgroup problem, and we show that the constructive membership problem with respect to


Sign in / Sign up

Export Citation Format

Share Document