License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FUN.2022.11
URN: urn:nbn:de:0030-drops-159812
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2022/15981/
Burke, Kyle W. ;
Ferland, Matthew ;
Teng, Shang-Hua
Quantum-Inspired Combinatorial Games: Algorithms and Complexity
Abstract
Recently, quantum concepts inspired a new framework in combinatorial game theory. This transformation uses discrete superpositions to yield beautiful new rulesets with succinct representations that require sophisticated strategies. In this paper, we address the following fundamental questions:
- Complexity Leap: Can this framework transform polynomial-time solvable games into intractable games?
- Complexity Collapse: Can this framework transform PSPACE-complete games into ones with complexity in the lower levels of the polynomial-time hierarchy?
We focus our study on how it affects two extensively studied polynomial-time-solvable games: Nim and Undirected Geography. We prove that both Nim and Undirected Geography make a complexity leap over NP, when starting with superpositions: The former becomes Σ₂^p-hard and the latter becomes PSPACE-complete. We further give an algorithm to prove that from any classical starting position, quantumized Undirected Geography remains polynomial-time solvable. Together they provide a nearly-complete characterization for Undirected Geography. Both our algorithm and its correctness proof require strategic moves and graph contraction to extend the matching-based theory for classical Undirected Geography.
Our constructive proofs for both games highlight the intricacy of this framework. The polynomial time robustness of Undirected Geography in this quantum-inspired setting provides a striking contrast to the recent result that the disjunctive sum of two Undirected Geography games is PSPACE-complete. We give a Σ₂^p-hardness analysis of quantumized Nim, even if there are no pile sizes of more than 1.
BibTeX - Entry
@InProceedings{burke_et_al:LIPIcs.FUN.2022.11,
author = {Burke, Kyle W. and Ferland, Matthew and Teng, Shang-Hua},
title = {{Quantum-Inspired Combinatorial Games: Algorithms and Complexity}},
booktitle = {11th International Conference on Fun with Algorithms (FUN 2022)},
pages = {11:1--11:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-232-7},
ISSN = {1868-8969},
year = {2022},
volume = {226},
editor = {Fraigniaud, Pierre and Uno, Yushi},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2022/15981},
URN = {urn:nbn:de:0030-drops-159812},
doi = {10.4230/LIPIcs.FUN.2022.11},
annote = {Keywords: Quantum-Inspired Games, Combinatorial Games, Computational Complexity, Polynomial Hierarchy, \c{c}lass\{PSPACE\}, Nim, Generalized Geography, Snort}
}
