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
Counting by quantum eigenvalue estimation
Theoretical Computer Science
Quantum lower bounds by polynomials
Journal of the ACM (JACM)
Almost-everywhere superiority for Quantum polynomial time
Information and Computation
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Quantum Database Search by a Single Query
QCQC '98 Selected papers from the First NASA International Conference on Quantum Computing and Quantum Communications
Separating Quantum and Classical Learning
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
A Quantum Polynomial Time Algorithm in Worst Case for Simon's Problem
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
On Quantum Computation with Some Restricted Amplitudes
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
A Quantum Goldreich-Levin Theorem with Cryptographic Applications
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Introduction to Recent Quantum Algorithms
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Bounds for Small-Error and Zero-Error Quantum Algorithms
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
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
Deterministic polynomial-time quantum algorithms for Simon's problem
Computational Complexity
Limitations of quantum coset states for graph isomorphism
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
The quantum query complexity of the abelian hidden subgroup problem
Theoretical Computer Science
Evolving blackbox quantum algorithms using genetic programming
Artificial Intelligence for Engineering Design, Analysis and Manufacturing
An Efficient Quantum Algorithm for the Hidden Subgroup Problem over Weyl-Heisenberg Groups
Mathematical Methods in Computer Science
Constant-time solution to Simon's decision problem with the known subgroup range in quantum computer
CI '07 Proceedings of the Third IASTED International Conference on Computational Intelligence
Quantum search on bounded-error inputs
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
On quantum algorithms for noncommutative hidden subgroups
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
The geometry of quantum learning
Quantum Information Processing
Limitations of quantum coset states for graph isomorphism
Journal of the ACM (JACM)
Complexity classes of equivalence problems revisited
Information and Computation
Quantum measurements for hidden subgroup problems with optimal sample complexity
Quantum Information & Computation
Quantum algorithms for shifted subset problems
Quantum Information & Computation
On the uselessness of quantum queries
Theoretical Computer Science
Quantum searching amidst uncertainty
UC'05 Proceedings of the 4th international conference on Unconventional 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
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Superiority of exact quantum automata for promise problems
Information Processing Letters
Black-box hamiltonian simulation and unitary implementation
Quantum Information & Computation
Quantum speed-up for unsupervised learning
Machine Learning
Quantum Information Processing
Superlinear advantage for exact quantum algorithms
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
We investigate the power of quantum computers when they are required to return an answer that is guaranteed to be correct after a time that is upper-bounded by a polynomial in the worst case. We show that a natural generalization of Simon's problem can be solved in this way, whereas previous algorithms required quantum polynomial time in the expected sense only, without upper bounds on the worst-case running time. This is achieved by generalizing both Simon's and Grover's algorithms and combining them in a novel way. It follows that there is a decision problem that can be solved in exact quantum polynomial time, which would require expected exponential time on any classical bounded-error probabilistic computer if the data is supplied as a black box.