"Is there a complete semi-definite programming hierarchy for quantum causal problems? We divide the question into two parts. First: Can quantum causal problems be expressed as polynomial optimization problems (this talk). Second: Can this class of polynomial optimizations be solved by means of SDPs (Laurens' talk). The optimizations we consider here are ""polynomial"" in two ways. They are over the unknown observable algebra of the hidden systems, which are specified by non-commutative polynomials in a set of generators. But they also involve independence constraints, which are commutative polynomials in the state. A hierarchy
of such polynomial tests is complete if one can construct a quantum model for any observed distribution that passes all of them. We've recently had some success in finding such constructions, but also ran into problems in the general case [1, 2]. I give a high-level presentation of the state of the play.