Strengths and Weaknesses of Quantum Computing
SIAM Journal on Computing
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Journal of the ACM (JACM)
How to solve it: modern heuristics
How to solve it: modern heuristics
Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms
Quantum computation and quantum information
Quantum computation and quantum information
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
Quantum Circuits That Can Be Simulated Classically in Polynomial Time
SIAM Journal on Computing
Essential Algebraic Structure within the AES
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Smaller Two-Qubit Circuits for Quantum Communication and Computation
Proceedings of the conference on Design, automation and test in Europe - Volume 2
Improving Gate-Level Simulation of Quantum Circuits
Quantum Information Processing
Exploiting structure in symmetry detection for CNF
Proceedings of the 41st annual Design Automation Conference
| Hi-index | 0.00 |
Gauging a quantum algorithm's practical significance requires weighing it against the best conventional techniques applied to useful instances of a similar problem. The authors show that several commonly suggested applications fail to satisfy the requirements of Grover's quantum search algorithm—the most widely studied in this area.