Logic Seminar: Finitary reformulations of Connes’ embedding conjecture
Author: Lona
Author: Lona
Speaker: Peter Burton, Iowa State University
Abstract: We will continue to speak on finitary reformulations of Connes’ embedding conjecture, this time focusing on connecting them to quantum information theory. In particular, we will describe how a problem related to the number of vertexes required to product a certain configuration of labelled graphs is equivalent to an analogous problem related to the degree of entanglement needed to win certain nonlocal games. The negation of Connes’ embedding conjecture implies that the answer to both problems can sometimes be ‘infinity’ and we will discuss how to interpret this in terms of cryptographic protocols involving counting discrete objects rather than quantum measurements.