I suppose it depends what the exponent is. If it is 2, then 1,000 only squares to 1,000,000, which is still a small number. Meanwhile 10^45 still square-roots to 10^22, which remains far too big. But if the exponent could be large enough then maybe...and actually I am not sure...
For example, could 64 squares be encoded in each of fifteen states (KQRBKP for both sides or empty) and then could all of that be considered at once due to quantum uncertainty? Must admit I have no idea if it even works that way. Maybe I'll try to read up on it.
Answering myself, at least for the moment, and without taking a PhD level course at the border of CS and Physics, from what I can determine, quantum computers aren’t expected to be all that well suited to this problem.
Apparently the exponent we are dealing with is still 2. That is to say 2 states per qubit. Even considered all at once, this isn’t nearly as cool as if the number of states could be much larger.
Also apparently, quantum computers are not expected to be particularly good at solving problems involving sequence (which chess more or less is). That is, you could possibly encode all the states in a very large number of qubits. But then you still need to connect them up in meaningful sequence, which is just as hard as it ever was.
And lastly (lol, as if), you still need to be able to “read” the solution even if the quantum machine is capable of giving it, and it’s still as big as it ever was.
Sorry for the edits--the self-quoting wasn't working very well.
.. Obviously, it's speculation ; But since, 'quantum' computers, are still in their development infancy ; Perhaps, there are already, mathematical projections, {or estimates} ; As to how long, it might take, a hypothetical, quantum 'supercomputer' ; Capable, of sorting through, mind-boggling, permutations ; Given that, the 'quantum' approach ; Has supposedly equal, daunting capabilities {!?! }
Quantum computers don't work like that. They check all permutations at the same time. A quantum computer with enough power solves chess instantly. The problem is, "enough power" (meaning enough quantum bits, properly organized and powered) is still on the same order as has already been discussed.
No, I believe you are wrong here. The computation that can be achieved with a quantum computer is exponential in the number of qubits. So if this resource was used efficiently, a thousand qubit quantum computer might be adequate for chess.
I suppose it depends what the exponent is. If it is 2, then 1,000 only squares to 1,000,000, which is still a small number. Meanwhile 10^45 still square-roots to 10^22, which remains far too big. But if the exponent could be large enough then maybe...and actually I am not sure...
For example, could 64 squares be encoded in each of fifteen states (KQRBKP for both sides or empty) and then could all of that be considered at once due to quantum uncertainty? Must admit I have no idea if it even works that way. Maybe I'll try to read up on it.