Originally posted by XanthosNZwell, no - but they can check two different angles at once.
The Innsbruck researchers used their calcium ion to execute a quantum procedure called the Deutsch-Josza algorithm, which involves working out whether an imaginary coin is the same or different on each side. A quantum computer can check both sides at once, so can answer the problem at least twice as fast as a classical computer.
For that partic ...[text shortened]... as fast. However to solve chess or checkers I don't see why you would be using that algorithm.
Why would a perfect game result in a win for white? Black plays perfect also. Maybe in the end it would appear that it's a disadvantage to move first: Win for black!
White would offer a draw immediately, black would refuse and win... Hmm... White would resign immediately and offer a rematch, hehe...
But 'more likely' a perfect game would end in a draw.
White would immediately offer a draw, black would agree and computertime can be used for other matters.
Anyway, I think that when computers will be so sophisticated that they can solve chess, they would also be sophisticated enough to understand that they should seriously dumb down in order to have some fun.
😛