Tuesday, June 27, 2017 2:00 pm
-
2:00 pm
EDT (GMT -04:00)
Constraint Propagation Games
Zhengfeng Ji, University of Technology, Sydney
Constraint propagation games are simple extended nonlocal games that are motivated by the propagation checking of quantum computation and have found powerful applications in the study of quantum proof systems recently. In this talk, we will introduce their definitions and basic properties, demonstrate their uses in larger games as building blocks, and illustrate the method that turns them into nonlocal games. Time permitted, we will briefly discuss their advantage in establishing rigidity properties and how they play a crucial role in showing that quantum multi-prover interactive proof systems can be compressed to nonlocal games with logarithmic message sizes.