Quantum Chess: Come up with circuit pruning algorithm

[dstrain115]

(More difficult issues)

One of the biggest limitations of quantum chess right now is the number of qubits and length of the circuit. The current quantum chess algorithm assumes that you construct the entire game as a circuit and run through the entire game from move 1, doing all measurements the same way (or post-selecting results) in order to calculate the results. In order to play through a longer game, it is necessary to prune the circuit.

For instance, in many practical games, after a measurement, the game collapses into a completely classical state. If we can detect that the game has gone into a classical state (or even if a "chain" of moves went into this state), we can get rid of the circuit and start over from the classical position. This would allow us to construct more complex and longer games on hardware.