Solving Highly Constrained Search Problems with Quantum Computers

Details Solving Highly Constrained Search Problems with Quantum Computers Solving Highly Constrained Search Problems with Quantum Computers

2011-05-27

arxiv.org/abs/1105.5459v1

Journal Of Artificial Intelligence Research, Volume 10, pages 39-66, 1999

Computer Science

Artificial Intelligence

Scientific paper

10.1613/jair.574

A previously developed quantum search algorithm for solving 1-SAT problems in a single step is generalized to apply to a range of highly constrained k-SAT problems. We identify a bound on the number of clauses in satisfiability problems for which the generalized algorithm can find a solution in a constant number of steps as the number of variables increases. This performance contrasts with the linear growth in the number of steps required by the best classical algorithms, and the exponential number required by classical and quantum methods that ignore the problem structure. In some cases, the algorithm can also guarantee that insoluble problems in fact have no solutions, unlike previously proposed quantum search algorithms.

Affiliated with

Also associated with

No associations

Rating

Solving Highly Constrained Search Problems with Quantum Computers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Solving Highly Constrained Search Problems with Quantum Computers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Solving Highly Constrained Search Problems with Quantum Computers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-664472