Share Email Print

Proceedings Paper

Quantum searching application in search based software engineering
Author(s): Nan Wu; FangMin Song; Xiangdong Li
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

The Search Based Software Engineering (SBSE) is widely used in software engineering for identifying optimal solutions. However, there is no polynomial-time complexity solution used in the traditional algorithms for SBSE, and that causes the cost very high. In this paper, we analyze and compare several quantum search algorithms that could be applied for SBSE: quantum adiabatic evolution searching algorithm, fixed-point quantum search (FPQS), quantum walks, and a rapid modified Grover quantum searching method. The Grover’s algorithm is thought as the best choice for a large-scaled unstructured data searching and theoretically it can be applicable to any search-space structure and any type of searching problems.

Paper Details

Date Published: 28 May 2013
PDF: 10 pages
Proc. SPIE 8749, Quantum Information and Computation XI, 87490M (28 May 2013); doi: 10.1117/12.2018874
Show Author Affiliations
Nan Wu, Nanjing Univ. (China)
FangMin Song, Nanjing Univ. (China)
Xiangdong Li, New York City College of Technology, CUNY (United States)
The Graduate Ctr., CUNY (United States)

Published in SPIE Proceedings Vol. 8749:
Quantum Information and Computation XI
Eric Donkor; Andrew R. Pirich; Howard E. Brandt, Editor(s)

© SPIE. Terms of Use
Back to Top