Quantum-Assisted Graph Domination Games
C. Weeks, P. Strange, P. Drmota, J. Quintanilla
TL;DR
This paper investigates quantum advantages in the 1-step graph domination game on cycle graphs, demonstrating that NISQ processors can realize predicted quantum benefits with high accuracy through numerical, analytical, and experimental methods.
Contribution
It introduces explicit quantum strategies for the graph domination game, generalizes them to larger cycles, and validates quantum advantage using NISQ hardware.
Findings
Quantum strategies achieve upper bounds for small graphs.
NISQ processors realize quantum advantages with high accuracy.
Strategies generalize to larger cycle graphs.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum Mechanics and Applications