Reachable poly-wide Demi-Quantum Nim hardness conjecture
Statement
Let $Z^{\mathrm{demi}\mathcal Q}[\mathbb{B}]$ be a demi-quantum game whose initial quantum board $\mathbb{B}$ is a superposition of positions, and call it classically reachable when $\mathbb{B}$ is reachable from a classical position. A game is poly-wide when the number of realizations in its initial board is polynomial in the descriptive complexity of the underlying instance.
Reachable poly-wide Demi-Quantum Nim conjecture. Reachable poly-wide $\ruleset{\mathrm{demi\text{-}Quantum Nim}$ remains $\cclass{PSPACE}$-hard to play optimally.
The unrestricted poly-wide Demi-Quantum Nim problem is stated to be $\cclass{PSPACE}$-complete; the conjecture asks whether the hardness persists when the initial board is classically reachable.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.