28 May 2013 Quantum searching application in search based software engineering
Author Affiliations +
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.
© (2013) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Nan Wu, FangMin Song, Xiangdong Li, "Quantum searching application in search based software engineering", Proc. SPIE 8749, Quantum Information and Computation XI, 87490M (28 May 2013); doi: 10.1117/12.2018874; https://doi.org/10.1117/12.2018874
PROCEEDINGS
10 PAGES


SHARE
RELATED CONTENT

Data fusion in entangled networks of quantum sensors
Proceedings of SPIE (May 02 2017)
Quantum models of Parrondo's games
Proceedings of SPIE (November 13 2002)
Finite temperature quantum algorithm and majorization
Proceedings of SPIE (March 27 2008)
Is quantum parallelism real?
Proceedings of SPIE (April 03 2008)

Back to Top