Quantum-Assisted Graph Domination Games
arXiv:2511.15802 · doi:10.1088/1367-2630/ae73a9
Abstract
We study quantum advantage in the 1-step graph domination game on cycle graphs numerically, analytically and through the use of Noisy intermediate scale quantum (NISQ) processors. We find explicit strategies that realise the recently found upper bounds for small graphs and generalise them to larger cycles. We demonstrate that NISQ computers realise the predicted quantum advantages with high accuracy.
14 pages (including appendix), 5 figures, 4 tables (including appendix)