An Efficient Quantum Algorithm for the Hidden Subgroup Problem over Weyl-Heisenberg Groups
Mathematical Methods in Computer Science
Quantum algorithms using the curvelet transform
Proceedings of the forty-first annual ACM symposium on Theory of computing
On the complexity of the hidden subgroup problem
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Quantum algorithms for highly non-linear Boolean functions
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Limitations on the simulation of non-sparse hamiltonians
Quantum Information & Computation
Efficient quantum algorithm for identifying hidden polynomials
Quantum Information & Computation
Quantum algorithms for shifted subset problems
Quantum Information & Computation
Quantum algorithm for the Boolean hidden shift problem
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Quantum walks: a comprehensive review
Quantum Information Processing
Quantum binary field inversion: improved circuit depth via choice of basis representation
Quantum Information & Computation
| Hi-index | 0.00 |
Attempts to find new quantum algorithms that outperform classical computation have focused primarily on the nonabelian hidden subgroup problem, which generalizes the central problem solved by Shor's factoring algorithm. We suggest an alternative generalization, namely to problems of finding hidden nonlinear structures over finite fields. We give examples of two such problems that can be solved efficiently by a quantum computer, but not by a classical computer. We also give some positive results on the quantum query complexity of finding hidden nonlinear structures.