The history and status of the P versus NP question
STOC '92 Proceedings of the twenty-fourth 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
On the Power of Quantum Computation
SIAM Journal on Computing
Strengths and Weaknesses of Quantum Computing
SIAM Journal on 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
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Why haven't more quantum algorithms been found?
Journal of the ACM (JACM)
Quantum algorithms for some hidden shift problems
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Exponential algorithmic speedup by a quantum walk
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Coins make quantum walks faster
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation
SIAM Journal on Computing
Quantum Algorithms: Philosophical Lessons
Minds and Machines
Self-protected quantum algorithms based on quantum state tomography
Quantum Information Processing
Natural Quantum Operational Semantics with Predicates
International Journal of Applied Mathematics and Computer Science - Selected Problems of Computer Science and Control
Non-classical computing: feasible versus infeasible
Proceedings of the 2010 ACM-BCS Visions of Computer Science Conference
Classical-processing and quantum-processing signal separation methods for qubit uncoupling
Quantum Information Processing
Hi-index | 0.00 |
We discuss the progress (or lack of it) that has been made in discovering algorithms for computation on a quantum computer. Some possible reasons are given for the paucity of quantum algorithms so far discovered, and a short survey is given of the state of the field.