Contextuality and erasure of information

In this talk I describe a simple single system game inspired by the CHSH game, where both Bell’s and Tsirelson’s bounds hold.

Apart from the dimension and the classical or quantum nature of the input system, crucial for the performance of the protocol is the use of reversible or irreversible gates. Moved from this consideration, I analyze the bounds obtained in light of Landauer’s principle, showing the entropic costs of erasure associated with the game. I will also study the role of contextuality as a resource for the game and explore a possible connection between contextuality and the erasure of information.