Quantum Chess |link| ❲Trusted × 2025❳

[ |\psi'\rangle = U_\textmove |\psi\rangle ]

Quantum Chess is in PQC (Probabilistic Quantum Combinatorial), a subclass of PSPACE but not reducible to BQP (Bounded-error Quantum Polynomial time) because the state space grows as ( 2^64 ) (all superpositions of piece occupancy) rather than ( 64! ).

A player cannot copy the quantum state of a piece. Each piece is a unique qubit. quantum chess

Quantum Chess: A Formal Extension of Classical Combinatorial Game Theory into the Hilbert Space

A player may move a piece from square ( A ) to ( B ) in superposition only if both paths are legal classical moves from distinct board states. The piece exists on ( A ) and ( B ) simultaneously. [ |\psi'\rangle = U_\textmove |\psi\rangle ] Quantum Chess

The game begins in a classical basis state ( |\psi_0\rangle ) with standard piece arrangement. No superposition exists initially.

[ |\psi\rangle = \sum_i=1^N c_i |B_i\rangle ] Each piece is a unique qubit

(Synthetic General Intelligence) Date: April 14, 2026