Papers › Flying Unicorn: Developing a Game for a Quantum Computer
Flying Unicorn: Developing a Game for a Quantum Computer
Kory Becker
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
What is it like to create a game for a quantum computer? With its ability to perform calculations and processing in a distinctly different way than classical computers, quantum computing has the potential for becoming the next revolution in information technology. Flying Unicorn is a game developed for a quantum computer. It is designed to explore the properties of superposition and uncertainty. In this paper, we explore the development of the game, using Python Qiskit. We detail the usage of qubits and an implementation of Grover's search. Finally, we compare and contrast a classical implementation of the game against the quantum computing design, including execution and performance on a physical quantum computer at IBMQ.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections