Procedural Generation and Games at the Dawn of Fault Tolerant Quantum Computing

• URL: http://arxiv.org/abs/2508.09683v1
• Date: Wed, 13 Aug 2025 10:22:20 GMT
• Title: Procedural Generation and Games at the Dawn of Fault Tolerant Quantum Computing
• Authors: Daniel Bultrini, James Wootton,
• Abstract summary: Quantum computers have long been more of a toy for researchers than a tool for solving complex problems.<n>Recent advances in the field make exploiting the advantages of fault-tolerant quantum computers feasible in the next 5 to 10 years.<n>It is now time to begin imagining how such devices could be used in practice for game development and deployment.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• Digital quantum simulation of many-body systems: Making the most of intermediate-scale, noisy quantum computers [51.56484100374058]
  This thesis is centered around simulating quantum dynamics on quantum devices.<n>We present an overview of the most relevant quantum algorithms for quantum dynamics.<n>We identify relevant problems within quantum dynamics that could benefit from quantum simulation in the near future.
  arXiv  Detail & Related papers  (2025-08-29T10:37:19Z)
• Towards Equivalence Checking of Classical Circuits Using Quantum Computing [2.6235431676697263]
  We propose a working concept of a quantum computing methodology for equivalence checking. We show that, although this might be an obvious choice, there are several pitfalls to avoid in order to get meaningful results.
  arXiv  Detail & Related papers  (2024-08-26T18:00:03Z)
• Benefits of non-adiabatic quantum control in quantum computation through spin qubit systems [0.0]
  controllable quantum systems can be reliable building blocks for Quantum computation. In the future, we hope to see a full fledged operationally stable quantum computer.
  arXiv  Detail & Related papers  (2024-03-17T17:48:51Z)
• The QUATRO Application Suite: Quantum Computing for Models of Human Cognition [49.038807589598285]
  We unlock a new class of applications ripe for quantum computing research -- computational cognitive modeling. We release QUATRO, a collection of quantum computing applications from cognitive models.
  arXiv  Detail & Related papers  (2023-09-01T17:34:53Z)
• Quantum Computing Toolkit From Nuts and Bolts to Sack of Tools [0.0]
  Quantum computing has the potential to provide exponential performance benefits in processing over classical computing. It utilizes quantum mechanics phenomena (such as superposition, entanglement, and interference) to solve a computational problem. Quantum computers are in the nascent stage of development and are noisy due to decoherence, i.e., quantum bits deteriorate with environmental interactions.
  arXiv  Detail & Related papers  (2023-02-17T14:08:44Z)
• Quantum Machine Learning: from physics to software engineering [58.720142291102135]
  We show how classical machine learning approach can help improve the facilities of quantum computers. We discuss how quantum algorithms and quantum computers may be useful for solving classical machine learning tasks.
  arXiv  Detail & Related papers  (2023-01-04T23:37:45Z)
• Long-Time Error-Mitigating Simulation of Open Quantum Systems on Near Term Quantum Computers [38.860468003121404]
  We study an open quantum system simulation on quantum hardware, which demonstrates robustness to hardware errors even with deep circuits containing up to two thousand entangling gates. We simulate two systems of electrons coupled to an infinite thermal bath: 1) a system of dissipative free electrons in a driving electric field; and 2) the thermalization of two interacting electrons in a single orbital in a magnetic field -- the Hubbard atom. Our results demonstrate that algorithms for simulating open quantum systems are able to far outperform similarly complex non-dissipative algorithms on noisy hardware.
  arXiv  Detail & Related papers  (2021-08-02T21:36:37Z)
• Quantum Computing for Location Determination [6.141741864834815]
  We introduce an example for the expected gain of using quantum algorithms for location determination research. The proposed quantum algorithm has a complexity that is exponentially better than its classical algorithm version, both in space and running time. We discuss both software and hardware research challenges and opportunities that researchers can build on to explore this exciting new domain.
  arXiv  Detail & Related papers  (2021-06-11T15:39:35Z)
• Imaginary Time Propagation on a Quantum Chip [50.591267188664666]
  Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems. We propose an algorithm to implement imaginary time propagation on a quantum computer.
  arXiv  Detail & Related papers  (2021-02-24T12:48:00Z)
• Quantum Computing without Quantum Computers: Database Search and Data Processing Using Classical Wave Superposition [101.18253437732933]
  We present experimental data on magnetic database search using spin wave superposition. We argue that in some cases the classical wave-based approach may provide the same speedup in database search as quantum computers.
  arXiv  Detail & Related papers  (2020-12-15T16:21:53Z)
• Electronic structure with direct diagonalization on a D-Wave quantum annealer [62.997667081978825]
  This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer. We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
  arXiv  Detail & Related papers  (2020-09-02T22:46:47Z)
• A quantum procedure for map generation [0.0]
  We explore whether near-term quantum computers could provide tools that are useful in the creation and implementation of computer games. This is performed by encoding a rudimentary decision making process for the nations within a quantum procedure that is well-suited to near-term devices.
  arXiv  Detail & Related papers  (2020-05-20T19:29:29Z)
• An Application of Quantum Annealing Computing to Seismic Inversion [55.41644538483948]
  We apply a quantum algorithm to a D-Wave quantum annealer to solve a small scale seismic inversions problem. The accuracy achieved by the quantum computer is at least as good as that of the classical computer.
  arXiv  Detail & Related papers  (2020-05-06T14:18:44Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.