Information Processing Letters
SIAM Journal on 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
Strengths and Weaknesses of Quantum Computing
SIAM Journal on Computing
Quantum vs. classical communication and computation
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Complexity theory retrospective II
The quantum query complexity of approximating the median and related statistics
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A lower bound for quantum search of an ordered list
Information Processing Letters
Complexity limitations on Quantum computation
Journal of Computer and System Sciences
An introduction to quantum computing for non-physicists
ACM Computing Surveys (CSUR)
Quantum complexity of integration
Journal of Complexity
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 lower bounds by polynomials
Journal of the ACM (JACM)
Quantum computation and quantum information
Quantum computation and quantum information
Complexity measures and decision tree complexity: a survey
Theoretical Computer Science - Complexity and logic
Quantum lower bounds by quantum arguments
Journal of Computer and System Sciences - Special issue on STOC 2000
Quantum Oracle Interrogation: Getting All Information for Almost Half the Price
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
A Better Lower Bound for Quantum Algorithms Searching an Ordered List
FOCS '99 Proceedings of the 40th Annual Symposium on 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
An Exact Quantum Polynomial-Time Algorithm for Simon's Problem
ISTCS '97 Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97)
Quantum Algorithms for Element Distinctness
CCC '01 Proceedings of the 16th Annual Conference on Computational Complexity
On the Quantum Complexity of Majority
On the Quantum Complexity of Majority
| Hi-index | 0.00 |
We discuss some of the recent progress in quantum algorithmics. We review most of the primary techniques used in proving upper and lower bounds and illustrate how to apply the techniques to a variety of problems, including the threshold function, parity, searching and sorting. We also give a set of open questions and possible future research directions. Our aim is to give a basic overview and we include suggestions to further reading.