Computer Science Technical Reports
CS at VT

Quantum Computing Applied to Optimization

Ge, Yuzhen and Watson, Layne T (1999) Quantum Computing Applied to Optimization. Technical Report ncstrl.vatech_cs//TR-99-03, Computer Science, Virginia Polytechnic Institute and State University.

Full text available as:
Postscript - Requires a viewer, such as GhostView (1412328)


Optimization problems represent a class of problems that can be time consuming to solve and very complex. In this paper, a quantum algorithm for solving optimization problems is proposed. The algorithm utilizes the encoding scheme from genetic algorithms to encode the problem and then uses Grover's unitary transformation to seek out a solution. The efficiency of the algorithm depends on the length of the chromosome or the coded variable. As a simple example the satisfiability problem, an NP-complete problem, is examined using the algorithm and the time complexity of solving this problem is greatly improved. The traveling salesman and minimum spanning tree problems are also briefly discussed.

Item Type:Departmental Technical Report
Subjects:Computer Science > Historical Collection(Till Dec 2001)
ID Code:507
Deposited By:User autouser
Deposited On:05 December 2001
Alternative Locations: URL:, URL: