Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Quantum Information Processing

Playing quantum games by a scheme with pre- and post-selection

Guo-Fu Weng, Yang Yu

Published Oct 24, 2015• 10 citations
Publisher
DOI
10.1007/s11128-015-1151-5

Related papers

A survey of quantum games

Hong Mei Guo, Juheng Zhang, Gary J. Kœhler

Decision Support Systems•Jul 11, 2008•145 citations

QubitQuest: Learning Quantum Computing through Mini-Games

Bella Hill, Miguel Ehécatl Morales-Trujillo

Quantum Computing (QC) is often challenging for beginners due to its abstract concepts and mathematical foundations. This paper explores the use of gamification to support the learning of introductory QC concepts. To investigate this, QubitQuest was developed as a set of three educational mini-games designed to teach key QC topics: the Bloch sphere, entanglement, and quantum circuits. The mini-games aim to balance engagement, motivation, and learning while introducing concepts in small and focused units of progressive difficulty. A two-phase user study was conducted to evaluate the mini-games. In the first phase, a preliminary survey was conducted to gather information on learners' preferences and inform the design of the mini-games. In the second phase, participants played the mini-games and completed pre- and post-game questionnaires to assess their learning. The results show that participants improved their understanding of introductory QC concepts after playing the mini-games, with post-game scores higher than pre-game scores. Those who completed more levels achieved higher post-game scores, indicating that motivation and engagement influenced the learning outcomes. These findings suggest that mini-games may improve students' learning experience and outcomes when exposed to introductory QC concepts.

arXiv:2604.24015•Apr 27, 2026•3 citations

Formulation and Analysis of Quantum Games: A Mathematical Paradigm

Ijaz Durrani

•Jan 1, 2026•0 citations

The Complete Quantum Cheshire Cat

Yelena Guryanova, Nicolas Brunner, Sandu Popescu

We show that a physical property can be entirely separated from the object it belongs to, hence realizing a complete quantum Cheshire cat. Our setup makes use of a type of quantum state of particular interest, namely an entangled pre- and post-selected state, in which the pre- and post-selections are entangled with each other. Finally we propose a scheme for the experimental implementation of these ideas.

arXiv:1203.4215•Mar 19, 2012•19 citations

Continuous-variable quantum games

Hui Li, Jiangfeng Du, Serge Massar

arXiv:quant-ph/0212122•Physics Letters A•Dec 1, 2002•173 citations

Post-selection games

Víctor Calleja Rodríguez, Ivan A. Bocanegra-Garay, Mateus Araújo

In this paper, we introduce post-selection games, a generalization of nonlocal games where each round can be not only won or lost by the players, but also discarded by the referee. Such games naturally formalize possibilistic proofs of nonlocality, such as Hardy's paradox. We develop algorithms for computing the local and Tsirelson bounds of post-selection games. Furthermore, we show that they have an unbounded advantage in statistical power over traditional nonlocal games, making them ideally suited for analysing Bell tests with low detection efficiency.

quant-pharXiv:2601.18861•Quantum•Jan 28, 2026•0 citations
Quantum Computing (QC) is often challenging for beginners due to its abstract concepts and mathematical foundations. This paper explores the use of gamification to support the learning of introductory QC concepts. To investigate this, QubitQuest was developed as a set of three educational mini-games designed to teach key QC topics: the Bloch sphere, entanglement, and quantum circuits. The mini-games aim to balance engagement, motivation, and learning while introducing concepts in small and focused units of progressive difficulty. A two-phase user study was conducted to evaluate the mini-games. In the first phase, a preliminary survey was conducted to gather information on learners' preferences and inform the design of the mini-games. In the second phase, participants played the mini-games and completed pre- and post-game questionnaires to assess their learning. The results show that participants improved their understanding of introductory QC concepts after playing the mini-games, with post-game scores higher than pre-game scores. Those who completed more levels achieved higher post-game scores, indicating that motivation and engagement influenced the learning outcomes. These findings suggest that mini-games may improve students' learning experience and outcomes when exposed to introductory QC concepts.
In this paper, we introduce post-selection games, a generalization of nonlocal games where each round can be not only won or lost by the players, but also discarded by the referee. Such games naturally formalize possibilistic proofs of nonlocality, such as Hardy's paradox. We develop algorithms for computing the local and Tsirelson bounds of post-selection games. Furthermore, we show that they have an unbounded advantage in statistical power over traditional nonlocal games, making them ideally suited for analysing Bell tests with low detection efficiency.