Heese Raoul
IEEE Comput Graph Appl. 2024 Sep-Oct;44(5):54-66. doi: 10.1109/MCG.2024.3447775. Epub 2024 Oct 25.
Quantum computers exhibit an inherent randomness, so it seems natural to consider them for procedural content generation. In this work, a quantum version of the famous (classical) wave function collapse algorithm is proposed. This quantum wave function collapse algorithm is based on the idea that a quantum circuit can be prepared in such a way that it acts as a special-purpose random generator for content of a desired form. The proposed method is presented theoretically and investigated experimentally on simulators and IBM Quantum devices.