Robustness in Quantum Games (Spring 2027)

There are games where players can win strictly more often by exploiting entanglement than they could without quantum mechanics. Such quantum strategies are often described in the familiar language of linear algebra. Studying these games leads to interesting questions about matrices and the equations they satisfy.

We will study examples of these games and learn why quantum mechanics gives us an advantage in them. We will then investigate how small changes in the rules of the games affect how big that advantage is.

You will experiment with examples and run computer simulations. We will use these experiments to look for patterns, formulate conjectures, and attempt to prove them.

For more information contact Jananan Arulseelan (jananan@iastate.edu)

People:

• Jananan Arulseelan (Postdoc)

• TBD

Pre-requisites:

• Linear algebra, Calculus III, and some experience with proofs. 

• Experience with mathematical computing will be an asset but not required.