An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups

C. Chevalley. Démonstration d’une hypothèse de M. Artin. Abhand. Math. Sem. Univ. Hamburg

1936

Earlier work this paper cites.

E. Warning. Bemerkung zur vorstehenden Arbeit von Herr Chevalley. Abhand. Math. Sem. Univ. Hamburg

1936

Earlier work this paper cites.

Five number-theoretic algorithms

D. Shanks · 1972

Earlier work this paper cites.

On total functions, existence theorems, and computational complexity

N. Meggido and C. Papadimitriou · 1991

Earlier work this paper cites.

E. M. Luks, Computing in solvable matrix groups, In Proc. 33rd IEEE FOCS

1992

Earlier work this paper cites.

R. Beals and L. Babai. Las Vegas algorithms for matrix groups. In Proc. 34th IEEE FOCS

1993

Earlier work this paper cites.

Quantum measurements and the Abelian Stabilizer Problem

A. Kitaev · 1995

Earlier work this paper cites.

Algorithms for quantum computation: Discrete logarithm and factoring

P. Shor · 1997

Earlier work this paper cites.

Polynomial-time solution to the Hidden Subgroup Problem for a class of non-abelian groups

M. Rötteler and T. Beth · 1998

Cited alongside, same era.

M. Hall Jr., Theory of groups, AMS Chelsea Publishing

1999

Cited alongside, same era.

Quantum Computer Algorithms

M. Mosca · 1999

Cited alongside, same era.

Quantum Computation and Quantum Information

M. Nielsen and I. Chuang · 2000

Cited alongside, same era.

Quantum mechanical algorithms for the nonabelian Hidden Subgroup Problem

M. Grigni, L. Schulman, M. Vazirani, and U. Vazirani · 2001

Cited alongside, same era.

B. Eick, Orbit-stabilizer problems and computing normalizers for polycyclic groups, J. Symbolic Comput

2002

Cited alongside, same era.

Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem

G. Ivanyos, F. Magniez, and M. Santha · 2003

Later among the works it cites.

Hoefling, Efficient multiplication algorithms for finite polycyclic groups, Preprint

2004

Later among the works it cites.

The power of basis selection in Fourier sampling: Hidden subgroup problems in affine groups

C. Moore, D. Rockmore, A. Russell, and L. Schulman · 2004

Later among the works it cites.

From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups

D. Bacon, A. Childs, and W. van Dam · 2005

Later among the works it cites.

D. F. Holt, B. Eick and E. O’Brien, Handbook of computational group theory, Chapman & Hall/CRC Press

2005

Later among the works it cites.