Is quantum search practical?

Computing in Science and Engineering

Volumn 7, Issue 3, 2005, Pages 62-70

  Viamontes, George F ^a   Markov, Igor L ^a   Hayes, John P ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GROVER'S QUANTUM SEARCH ALGORITHMS; GROVER'S SEARCH; PROBLEM-SPECIFIC ALGORITHMS; REAL-LIFE DATABASE APPLICATIONS;

ALGORITHMS; COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DATA REDUCTION; DATABASE SYSTEMS; PROBLEM SOLVING; SEARCH ENGINES;

QUANTUM THEORY;

EID: 19944374082     PISSN: 15219615     EISSN: None     Source Type: Journal    
DOI: 10.1109/MCSE.2005.53     Document Type: Review

References (24)

1. M.A. Nielsen and I.L. Chuang, Quantum Computation and Quantum Information, Cambridge Univ. Press 2000.
2. C. Bennett et al., "Strengths and Weaknesses of Quantum Computing," SIAMI. Computing, vol. 26, no. 5, 1997, pp. 1510-1523.
3. C. Zalka, "Using Graver's Quantum Algorithm for Searching Actual Databases," Physical Rev. A, vol. 62, no. 5, 2000, pp. 052305-1-052305-4.
4. J. Preskill, "Quantum Computing: Pro and Con," Proc. Royal Soc London A, vol. 454, no. 1969, 1998, pp. 469-486.
5. L.K. Grover, "Quantum Mechanics Helps in Searching for a Needle in a Haystack," Physical Rev. Letters, vol. 79, no. 2, 1997, pp. 325-328.
6. M. Boyer et al., "Tight Bounds on Quantum Searching," Fortschritte der Physik, vol. 46, no. 4-5, 1998, pp. 493-505.
7. J. Roland and N.J. Cerf, "Quantum-Circuit Model of Hamiltonian Search Algorithms," Physical Rev. A, vol. 68, no. 6, 2003, pp. 062311-1-062311-6.
8. V.V. Shende, I.L. Markov, and S.S. Bullock, "Smaller Two-Qubit Circuits for Quantum Communication and Computation," Proc. Design Automation and Test in Europe (DATE), IEEE CS Press, 2004, pp. 980-985.
9. G.F. Viamontes, I.L. Markov, and J.P. Hayes, "More Efficient Gate-Level Simulation of Quantum Circuits," Quantum Information Processing, vol. 2, no. 5, 2003, pp. 347-380.
10. S. Aaronson and D. Gottesman, "Improved Simulation of Stabilizer Circuits," Physical Rev. A, vol. 70, no. 5, 2004, pp. 052328-1-052328-14.
11. L.C. Valiant, "Quantum Circuits that Can Be Simulated Classically in Polynomial Time," SIAM J. Computing, vol. 31, no. 4, 2002. pp. 1229-1254.
12. G. Vidal, "Efficient Classical Simulation of Slightly Entangled Quantum Computations," Physical Rev. Letters, vol. 91, no. 14, 2003. pp. 147902-1-147902-4.
13. U. Schöning, "A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems," Proc. IEEE Symp. Foundation of Comp. Science, ACM Press, 1999, p. 410.
14. D. Eppstein, "Improved Algorithms for 3-Coloring, 3-Edge-Coloring, and Constraint Satisfaction," Proc. Symp. Discrete Algorithms, ACM/SIAM Press, 2001, pp. 329-337.
15. C. Zalka, "Crover's Quantum Searching Algorithm Is Optimal," Physical Rev. A, vol. 60, no. 4, 1999, pp. 2746-2751.
16. H. Kautz and B. Selman, "Ten Challenges Redux: Recent Progress in Propositional Reasoning and Search," Proc. Principles and Practice of Constraint Programming (CP), LNCS 2833, Springer, 2003, pp. 1-18.
17. S. Arora, "Polynomial-Time Approximation Schemes for Euclidean Traveling Salesman and Other Geometric Problems," J. ACM, vol. 45, no. 5, 1998, pp. 753-782.
18. X. Wang et al., Collisions for Hash functions MD4, MD5, HAVAL-128, and RIPEMD, Cryptology ePrint Archive, report no. 199, Aug. 2004, pp. 1-4.
19. E. Biham and R. Chen, "Near-Collisions of SHA-0," Proc. Int'l Cryptology Conf. (CRYPTO), LNCS 3152, Springer, 2004, pp. 290-305.
20. L. Marraro and F. Massacci, "Towards the Formal Verification of Ciphers: Logical Cryptanalysis of DES," Proc. Workshop Formal Methods and Security Protocols (FMSP), 1999.
21. S.P. Murphy and M.J.B. Robshaw, "Essential Algebraic Structure within the AES," Proc. Int'l Cryptology Conf. (CRYPTO), LNCS 2442, Springer, 2002, pp. 1-16.
22. J. Roland and N.J. Cerf, "Adiabatic Quantum Search Algorithm for Structured Problems," Physical Rev. A, vol. 68, no. 6, 2003, pp. 062312-1-062312-7.
23. P.T. Darga et al., "Exploiting Structure in Symmetry Generation for CNF," Proc. Design Automation Conf. (DAC), ACM Press, 2004, pp. 530-534.
24. D. Curtis and D. A. Meyer, "Towards Quantum Template Matching," Proc. SPIE, vol. 5161 (Quantum Communications and Quantum Imaging), SPIE Press, 2004, pp. 134-141.