Quantum mechanical algorithms for the nonabelian hidden subgroup problem

Authors:
Michelangelo Grigni;Leonard Schulman;Monica Vazirani;Umesh Vazirani
Affiliations:
Emory University;Caltech;U. C. Berkeley;-
Venue:
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Year:
2001

Citing 8
Cited 31

Fast generalized Fourier transforms

Theoretical Computer Science
Computation of Fourier transforms on the symmetric group

Proceedings of the third conference on Computers and mathematics
The graph isomorphism problem: its structural complexity

The graph isomorphism problem: its structural complexity
Quantum computation of Fourier transforms over symmetric groups

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On the Power of Quantum Computation

SIAM Journal on Computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

SIAM Journal on Computing
Normal subgroup reconstruction and quantum computation using group representations

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Regular Article: On Quantum Algorithms for Noncommutative Hidden Subgroups

Advances in Applied Mathematics

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

Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Quantum algorithms for solvable groups

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Quantum lower bound for the collision problem

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Quantum algorithms for some hidden shift problems

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Quantum Algorithms

LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Quantum Algorithms

FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Hidden translation and orbit coset in quantum computing

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Exponential algorithmic speedup by a quantum walk

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Generic quantum Fourier transforms

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
The power of basis selection in fourier sampling: hidden subgroup problems in affine groups

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Quantum lower bounds for the collision and the element distinctness problems

Journal of the ACM (JACM)
The quantum query complexity of the hidden subgroup problem is polynomial

Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
New lattice-based cryptographic constructions

Journal of the ACM (JACM)
The hidden subgroup problem and permutation group theory

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
The Symmetric Group Defies Strong Fourier Sampling

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Generic quantum Fourier transforms

ACM Transactions on Algorithms (TALG)
Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem

Journal of the ACM (JACM)
On the impossibility of a quantum sieve algorithm for graph isomorphism

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Quantum Testers for Hidden Group Properties

Fundamenta Informaticae - Machines, Computations and Universality, Part II
An efficient quantum algorithm for the hidden subgroup problem in extraspecial groups

STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups

LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
On the Impossibility of a Quantum Sieve Algorithm for Graph Isomorphism

SIAM Journal on Computing
Quantum solution to the hidden subgroup problem for poly-near-hamiltonian groups

Quantum Information & Computation
Physically-motivated dynamical algorithms for the graph isomorphism problem

Quantum Information & Computation
How a Clebsch-Gordan transform helps to solve the Heisenberg hidden subgroup problem

Quantum Information & Computation
On solving systems of random linear disequations

Quantum Information & Computation
Computational indistinguishability between quantum states and its cryptographic application

EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Finding hidden Borel subgroups of the general linear group

Quantum Information & Computation
Quantum Testers for Hidden Group Properties

Fundamenta Informaticae - Machines, Computations and Universality, Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

We provide positive and negative results concerning the “standard method” of identifying a hidden subgroup of a nonabelian group using a quantum computer.