Quantum computers are not known to be able to solve NP-complete problems in polynomial time,
and can be simulated classically with exponential slowdown.
You have searched the Shtetl-Optimized weblog archives
for 'Checkers'. If you are unable to find anything in these search results, you can try one of these links.