A quantum algorithm for software engineering search

ASE2009 - 24th IEEE/ACM International Conference on Automated Software Engineering

Volumn , Issue , 2009, Pages 40-51

  Hall, Robert J ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

Modeling; Quantum computing; Search algorithm; Simulation; Synthesis; Validation; Verification

Indexed keywords

EFFICIENT SIMULATION; PROPERTY CHECKING; QUANTUM ALGORITHMS; QUANTUM APPROACH; QUANTUM COMPUTING; QUANTUM SEARCH ALGORITHM; QUANTUM SEARCHING; SEARCH ALGORITHMS; SIMULATION-BASED; SOFTWARE ARTIFACTS; SOFTWARE ENGINEERS; SOFTWARE SYNTHESIS; SOFTWARE TEST;

COMPUTATION THEORY; ENGINEERING; LEARNING ALGORITHMS; QUANTUM COMPUTERS; QUANTUM OPTICS; QUANTUM THEORY; SOFTWARE ENGINEERING; SYNTHESIS (CHEMICAL);

COMPUTER SOFTWARE SELECTION AND EVALUATION;

EID: 77952217335     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ASE.2009.51     Document Type: Conference Paper

References (19)

1. M. Harman, "The current state and future of search based software engineering," in FOSE '07: 2007 Future of Software Engineering. Washington, DC, USA: IEEE Computer Society, 2007, pp. 342-357.
2. R. Feynman, "Simulating physics with computers," Intl. J. Theoretical Physics, vol. 21, no. 6/7, 1982.
3. N. Yanofsky and M. Mannucci, Quantum computing for computer scientists. Cambridge University Press, 2008.
4. L. Grover, "A fast quantum mechanical algorithm for database search," in Proc. 28th ACM Symposium on Theory of Computing, 1996.
5. J. Gruska, Quantum computing. McGraw-Hill, 1999.
6. P. Shor, "Polynomial time algorithms for prime factorization and discrete logarithms on a quantum computer," SIAM J. Computing, vol.26, no.5, 1997.
7. D. Sofge, "A survey of quantum programming languages: history, methods, and tools," in Proc. 2nd Intl. Conf. on quantum, nano and micro technologies, 2008.
8. M. Boyer, G. Brassard, P. Hoyer, and A. Tapp, "Tight bounds on quantum searching," in Proc. 4th Workshop on Physics and Computation, 1996.
9. "Grover's algorithm - wikipedia entry," en.wikipedia.org/wiki/ Grover
10. M. Lowry, A. Philpot, T. Pressburger, and I. Underwood, "Amphion: automatic programming for scientific subroutine libraries," in LNCS, vol.869, 1994.
11. R. Hall, "Generalized behavior-based retrieval," in Proc. 15th Intl. Conf. on Software Engineering, 1993.
12. C. Bennett, L. Bernstein, G. Brassard, and U. Vazirani, "Strengths and weaknesses of quantum computing," SIAM J. Computing, vol.26, no.5, 1997.
13. n), 2003.
14. A. Ambainis, "Quantum search algorithms," SIGACT News, vol.35, no.2, 2004.
15. G. Brassard, P. Hoyer, and A. Tapp, "Quantum counting," in LNCS, vol.1443, 1998.
16. M. Udrescu, L. Prodan, and M. Vladutiu, "Implementing quantum genetic algorithms: a solution based on grover's algorithm," in Proc. 3rd ACM Conf on Computing Frontiers, 2006.
17. D. Jackson, I. Schechter, and I. Shlyakhter, "Alcoa: the alloy constraint analyzer," in Proc. 22nd Intl. Conf. on Software Engineering, 2000.
18. F. Schuermann, "Interactive quantum computation: jaquzzi0.1," www.eng.buffalo.edu/p̃hygons/jaQuzzi/index.html, 2009.
19. K. Obenland and A. Despain, "A parallel quantum computer simulator," arxiv.org/abs/quant-ph/9804039.