Procedural Generation and Games at the Dawn of Fault Tolerant Quantum Computing
Vision paper Abstract-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.
Authors
- Daniel Bultrini (ORCID: https://orcid.org/0000-0002-2534-4200)
- James R. Wootton (ORCID: https://orcid.org/0000-0003-1943-5306)
Institutions
- The Swiss Private Equity & Corporate Finance Association (CH)
Publication Details
- Published
- 2025-08-19
- DOI
- https://doi.org/10.1109/cog64752.2025.11114389
- Primary Topic
- Quantum Computing Algorithms and Architecture
- Type
- article
- Field-Weighted Citation Impact
- 0.00