You're viewing papers too quickly. Please wait a moment.<br>This helps keep the archive available for everyone.

Quick Navigation

Topics

Quantum Algorithms

Quantum Wave Function Collapse for Procedural Content Generation

arXiv
Authors: Raoul Heese

Year

2023

Paper ID

53203

Status

Preprint

Abstract Read

~2 min

Abstract Words

84

Citations

N/A

Abstract

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.

Why This Paper Matters

  • It adds a 2023 reference point for readers tracking recent quantum research.
  • Quantum computers exhibit an inherent randomness, so it seems natural to consider them for procedural content generation.

Paper Tools

Become a member to use research tools

Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.

Show Paper arXiv Publisher Share Cite This Paper Copy URL Compare Copy DOI Add to Reading List Category Correction Request

References & Citation Signals

Local Citation Graph (Related-Paper Links)

Current Paper #53203 #69983 Spectral Leakage and Masking Ef... #69982 Dimensionality Reduction of QAO... #69981 A Hybrid Quantum-Classical Appr... #69980 Complexity Inequalities for Qua...

External citation index: OpenAlex citation signal

Community Reactions

Quick sentiment from readers on this paper.

Score: 0
Likes: 0 Dislikes: 0

Sign in to react to this paper.

Discussion & Reviews (Moderated)

Average Rating: 0.0 / 5 (0 ratings)

No written reviews yet.