Quantum Computing

Discussion of chess software programming and technical issues.

Moderators: hgm, chrisw, Rebel

Leo
Posts: 1093
Joined: Fri Sep 16, 2016 6:55 pm
Location: USA/Minnesota
Full name: Leo Anger

Quantum Computing

Post by Leo »

I wonder what Quantum Computing would mean for chess.
Advanced Micro Devices fan.
User avatar
towforce
Posts: 11946
Joined: Thu Mar 09, 2006 12:57 am
Location: Birmingham UK
Full name: Graham Laight

Re: Quantum Computing

Post by towforce »

Leo wrote: Wed Nov 20, 2024 9:15 pm I wonder what Quantum Computing would mean for chess.

Deeper search - link:

"...we find examples of trees for which the classical algorithm requires time exponential in 𝑛, but for which the quantum algorithm succeeds in polynomial time."
The simple reveals itself after the complex has been exhausted.
Engin
Posts: 974
Joined: Mon Jan 05, 2009 7:40 pm
Location: Germany
Full name: Engin Üstün

Re: Quantum Computing

Post by Engin »

i doubt that one day Quantum Computer can play chess.
User avatar
towforce
Posts: 11946
Joined: Thu Mar 09, 2006 12:57 am
Location: Birmingham UK
Full name: Graham Laight

Re: Quantum Computing

Post by towforce »

This might not be possible, but maybe...

1. Find a smallish set of positions that represent chess very well

2. Model this set with some expressions

3. Set a large quantum computer with a huge number of qubits in a superstate to work on the set of expressions from (2)

4. The qubits collapse into an optimal model state, giving a mathematical expression that optimally resolves the model

Result: simple mathematical expression (which will therefore run quickly) that provides the best evaluation function ever for chess.
The simple reveals itself after the complex has been exhausted.