Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2511.15802 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911283824033792 |
|---|---|
| author | Weeks, C. Strange, P. Drmota, P. Quintanilla, J. |
| author_facet | Weeks, C. Strange, P. Drmota, P. Quintanilla, J. |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_15802 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Quantum-Assisted Graph Domination Games Weeks, C. Strange, P. Drmota, P. Quintanilla, J. Quantum Physics 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. |
| title | Quantum-Assisted Graph Domination Games |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2511.15802 |