**a pedagogical tool to learn quantum computing that is fun to play**

**Franz G. Fuchs, Vemund Falch, Christian Johnsen**

Quantum computers are on the verge of becoming a commercially available reality. They represent a paradigm change to the classical computing paradigm, and the learning curve is considerably long. The creation of games is a way to ease the transition for novices. We present a game similar to the poker variant Texas hold ’em with the intention to serve as an engaging pedagogical tool to learn the basics rules of quantum computing. The difference to the classical variant is that the community cards are replaced by a quantum register that is “randomly” initialized, and the cards for each player are replaced by quantum gates, randomly drawn from a set of available gates. Each player can create a quantum circuit with their cards, with the aim to maximize the number of 1’s that are measured in the computational basis. The basic concepts of superposition, entanglement and quantum gates are employed. We provide a proof-of-concept implementation using Qiskit. A comparison of the results using a simulator and IBM machines is conducted, showing that error rates on contemporary quantum computers are still very high. Improvements on the error rates and error mitigation techniques are necessary, even for simple circuits, for the success of noisy intermediate scale quantum computers.

read more at https://arxiv.org/pdf/1908.00044.pdf