Fast generalized Fourier transforms
Theoretical Computer Science
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Quantum Cryptanalysis of Hidden Linear Functions (Extended Abstract)
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Quantum Fourier sampling simplified
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Normal subgroup reconstruction and quantum computation using group representations
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Quantum algorithms for solvable groups
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Quantum mechanical algorithms for the nonabelian hidden subgroup problem
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Quantum Factoring, Discrete Logarithms, and the Hidden Subgroup Problem
Computing in Science and Engineering
Quantum algorithms for some hidden shift problems
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
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
Hidden translation and orbit coset in quantum computing
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
Progress in Quantum Algorithms
Quantum Information Processing
The hidden subgroup problem and permutation group theory
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
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
Generic quantum Fourier transforms
ACM Transactions on Algorithms (TALG)
The quantum query complexity of the abelian hidden subgroup problem
Theoretical Computer Science
The quantum Schur and Clebsch-Gordan transforms: I. efficient qudit circuits
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Graph Edit Distance without Correspondence from Continuous-Time Quantum Walks
SSPR & SPR '08 Proceedings of the 2008 Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Graph matching using the interference of continuous-time quantum walks
Pattern Recognition
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
On quantum algorithms for noncommutative hidden subgroups
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Limitations of quantum coset states for graph isomorphism
Journal of the ACM (JACM)
Complexity classes of equivalence problems revisited
Information and Computation
Quantum solution to the hidden subgroup problem for poly-near-hamiltonian groups
Quantum Information & Computation
Quantum measurements for hidden subgroup problems with optimal sample complexity
Quantum Information & Computation
How a Clebsch-Gordan transform helps to solve the Heisenberg hidden subgroup problem
Quantum Information & Computation
Quantum algorithms for shifted subset problems
Quantum Information & Computation
On the quantum hardness of solving isomorphism problems as nonabelian hidden shift problems
Quantum Information & Computation
Quantum expanders from any classical Cayley graph expander
Quantum Information & Computation
A quantum lower bound for the query complexity of simon's problem
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Quantum fourier transform over symmetric groups
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Reduction from non-injective hidden shift problem to injective hidden shift problem
Quantum Information & Computation
| Hi-index | 0.00 |