Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2508.09683 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909735801847808 |
|---|---|
| author | Bultrini, Daniel Wootton, James |
| author_facet | Bultrini, Daniel Wootton, James |
| contents | Quantum computers have long been more of a toy for researchers than a tool for solving complex problems. However, recent advances in the field make exploiting the advantages of fault-tolerant quantum computers feasible in the next 5 to 10 years. It is now time to begin imagining how such devices could be used in practice for game development and deployment. In this work we identify procedural content generation as a very promising area of application and exploration. We examine a selection of algorithmic approaches used in classical procedural content generation and propose promising quantum algorithms that could provide an alternative approach or a computational advantage. We then end with a hypothetical game that exploits a recent quantum algorithm for computing the Jones polynomial exponentially faster than classical computers could. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_09683 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Procedural Generation and Games at the Dawn of Fault Tolerant Quantum Computing Bultrini, Daniel Wootton, James Quantum Physics Quantum computers have long been more of a toy for researchers than a tool for solving complex problems. However, recent advances in the field make exploiting the advantages of fault-tolerant quantum computers feasible in the next 5 to 10 years. It is now time to begin imagining how such devices could be used in practice for game development and deployment. In this work we identify procedural content generation as a very promising area of application and exploration. We examine a selection of algorithmic approaches used in classical procedural content generation and propose promising quantum algorithms that could provide an alternative approach or a computational advantage. We then end with a hypothetical game that exploits a recent quantum algorithm for computing the Jones polynomial exponentially faster than classical computers could. |
| title | Procedural Generation and Games at the Dawn of Fault Tolerant Quantum Computing |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2508.09683 |