The central thesis of this paper is that Quantum Chess is not a stochastic analog of chess but a distinct mathematical structure. While classical chess belongs to (solved via brute-force search), Quantum Chess introduces non-classical correlations that preclude direct tree search, placing it in a unique category of PQC-complete . 2. Mathematical Foundations 2.1 State Representation In classical chess, a board state ( S ) is a mapping from squares to pieces. In Quantum Chess, the state is a vector in a Hilbert space:
[ |\psi\rangle = \sum_i=1^N c_i |B_i\rangle ] quantum chess
White Knight at c3. Black Rook at a4, Black Bishop at e4. Classical: Knight forks; Black saves one. Quantum: Knight moves to b5 in superposition, threatening both. Black must measure: if they measure a4 and find the Rook, the Knight's amplitude at b5 attacking the Bishop collapses – but so does the Bishop's position. This creates a probabilistic advantage. 4.2 Entanglement Traps Entanglement allows a player to create non-local correlations. If White entangles their Queen with Black’s Knight, then measuring the Queen’s position forces the Knight’s position. Skilled players use this to force unfavorable collapses for the opponent. 4.3 The Measurement Gambit A player may intentionally not measure, keeping their own pieces in superposition. However, this risks that the opponent’s measurement could collapse the player’s pieces into disadvantageous positions. The optimal strategy resembles quantum game theory’s “Eisert–Wilkens–Lewenstein” protocol. 5. Quantum Algorithms as Metaphor While actual quantum computing is not required to play the game (it runs on classical computers simulating quantum states), the strategic patterns mirror known algorithms: The central thesis of this paper is that
The game begins in a classical basis state ( |\psi_0\rangle ) with standard piece arrangement. No superposition exists initially. Mathematical Foundations 2
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! ).
[ |\psi'\rangle = U_\textmove |\psi\rangle ]
A player cannot copy the quantum state of a piece. Each piece is a unique qubit.