A quantum differentiation of k-SAT instances

Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

We present a quantum adiabatic algorithm to differentiate between k-SAT instances, those with no solutions and those that have many solutions. The time complexity of the algorithm is a function of the energy gap between the subspace of all 0-eigenvectors (ground states) and the first excited states manifold, and scales polynomially with the number of resources. The idea of gaps between subspaces suggests a new tool to analyze time complexity in adiabatic quantum machines.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A quantum differentiation of k-SAT instances 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 A quantum differentiation of k-SAT instances, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A quantum differentiation of k-SAT instances will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-1230654

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.