@13311
"quantum computing is not suitable at least right now for the problem of solving chess"
++ There are two reasons why it is or will be suitable
- A conventional computer has a move generator that generates all legal moves from a given position, i.e. all positions that can result from it by a legal move. A quantum computer can resolve the reverse query: give all positions that can lead to a given position by a legal move. That kind of query is needed for retrograde analysis to generate an 8 men endgame table base from a 7 men endgame table base. Then 7 -> 8 -> 9 -> ... -> 32.
- A conventional computer works sequentially. A quantum computer can process in parallel: give it an array of positions and get an array of positions that can lead to it by 1 legal move. That speeds up the process.
"who knows what researchers will discover the next couple of centuries"
++ Yes: the functionallity of the computer of 80 years ago in the Manhattan Project: a room full of vacuum tubes now fits inside a smart watch. That is why I expect a quantum computer to strongly solve Chess before 2100.
As per usual, your ideas of scale are way off. I will just state the simplest of reasons why quantum computers cannot solve chess: quantum computers can't even play a game of chess nor are they currently in any imminent danger of being able to play a game of chess. I could go into the problems of decoherence, the limited nature of matrix operations that quantum computers can do, etc. but they have already been covered before, and probably here in this thread.
@13311
"quantum computing is not suitable at least right now for the problem of solving chess"
++ There are two reasons why it is or will be suitable
"who knows what researchers will discover the next couple of centuries"
++ Yes: the functionallity of the computer of 80 years ago in the Manhattan Project: a room full of vacuum tubes now fits inside a smart watch. That is why I expect a quantum computer to strongly solve Chess before 2100.