can a quantum computer solve chess

@jeremyrutman2 but can you see sarcasm when its right in front of you?

queen to f7

Either they're both trolls or they're both legit with huge egos

State of the art game tree evaluation only gets a sqrt-ish speedup over classical algorithms in terms of query complexity (see arxiv.org/abs/0907.1623). Although we can't prove faster algorithms exist, we do know that an exponential speedup in general game tree evaluation would show that BQP (bounded error quantum polynomial time) contains NP, since we can solve 3-SAT in terms of game tree evaluations. Hence, even if we had scalable quantum computers, it is likely that a quantum computer will provide no help in completely solving chess. Specifically, the number of game states is at least 10^120, so a quantum computer would need 10^60 quantum queries which is completely unreasonable.

iiuc there's two separate points you're making - a . exponential speedup in game tree eval would show bqp contains np, and b. there's unreasonable requirements for even a quantum computer trying to solve chess (specifically, number of queries). I didn't understand however how those relate (if they do)

If chess is ever solved than it will probably be along the same path as checkers was solved. First table bases with a sufficient number of men. The calculation from the starting position towards the table bases.

You probably need to ask the quantum community, not the chess community.

chess.stackexchange.com/questions/6147/will-quantum-computers-solve-chess
quantumcomputing.stackexchange.com/questions/5823/will-quantum-computers-be-able-to-solve-the-game-of-chess
www.chess.com/blog/watcha/limits-of-quantum-computing-in-solving-chess