Solving Random Satisfiability Problems with Quantum Computers

Details Solving Random Satisfiability Problems with Quantum Computers Solving Random Satisfiability Problems with Quantum Computers

2001-04-09

arxiv.org/abs/quant-ph/0104048v1

Physics

Quantum Physics

26 pages

Scientific paper

Quantum computer algorithms can exploit the structure of random satisfiability problems. This paper extends a previous empirical evaluation of such an algorithm and gives an approximate asymptotic analysis accounting for both the average and variation of amplitudes among search states with the same costs. The analysis predicts good performance, on average, for a variety of problems including those near a phase transition associated with a high concentration of hard cases. Based on empirical evaluation for small problems, modifying the algorithm in light of this analysis improves its performance. The algorithm improves on both GSAT, a commonly used conventional heuristic, and quantum algorithms ignoring problem structure.

Affiliated with

Also associated with

No associations

Rating

Solving Random Satisfiability 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 Random Satisfiability Problems with Quantum Computers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Solving Random Satisfiability Problems with Quantum Computers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-534814