The graph isomorphism problem: its structural complexity
The graph isomorphism problem: its structural complexity
A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Quantum computation of Fourier transforms over symmetric groups
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
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 mechanical algorithms for the nonabelian hidden subgroup problem
STOC '01 Proceedings of the thirty-third 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 Computation and Lattice Problems
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Fast Quantum Fourier Transforms for a Class of Non-Abelian Groups
AAECC-13 Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Quantum Cryptanalysis of Hidden Linear Functions (Extended Abstract)
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
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
A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
SIAM Journal on Computing
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
Limitations of quantum coset states for graph isomorphism
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Applications of coherent classical communication and the schur transform to quantum information theory
On the impossibility of a quantum sieve algorithm for graph isomorphism
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Quantum algorithm for a generalized hidden shift problem
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
The quantum Schur and Clebsch-Gordan transforms: I. efficient qudit circuits
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for quantum computation: discrete logarithms and factoring
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
On the power of quantum computation
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Weak Fourier-Schur sampling, the hidden subgroup problem, and the quantum collision problem
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Quantum solution to the hidden subgroup problem for poly-near-hamiltonian groups
Quantum Information & Computation
Efficient quantum algorithms for the hidden subgroup problem over semi-direct product groups
Quantum Information & Computation
On the power of random bases in fourier sampling: hidden subgroup problem in the heisenberg group
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
An Efficient Quantum Algorithm for the Hidden Subgroup Problem over Weyl-Heisenberg Groups
Mathematical Methods in Computer Science
Finding hidden Borel subgroups of the general linear group
Quantum Information & Computation
Hi-index | 0.00 |
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.