61 citations · 256 across the 25 of their papers we have counts for
31 papers
The NPA hierarchy does not always attain the commuting operator value
Marco Fanizza, Larissa Kroell, Arthur Mehta +4
We show that it is undecidable to determine whether the commuting operator value of a nonlocal game is strictly greater than 1/2. Specifically, there is a computable mapping from T…
Operator solutions of linear systems and small cancellation
William Slofstra, Lu-Ming Zhang
We show that if a graph has minimum vertex degree at least d and girth at least g, where (d, g) is (3, 6) or (4, 4), then the incidence system of the graph has a (possibly infinite…
Two prover perfect zero knowledge for MIP*
Kieran Mastel, William Slofstra
The recent MIP*=RE theorem of Ji, Natarajan, Vidick, Wright, and Yuen shows that the complexity class MIP* of multiprover proof systems with entangled provers contains all recursiv…
Positivity is undecidable in tensor products of free algebras
Arthur Mehta, William Slofstra, Yuming Zhao
It is well known that an element of the algebra of noncommutative *-polynomials is positive in all *-representations if and only if it is a sum of squares. This provides an effecti…
Satisfiability problems and algebras of boolean constraint system games
Connor Paddock, William Slofstra
Mermin and Peres showed that there are boolean constraint systems (BCSs) which are not satisfiable, but which are satisfiable with quantum observables. This has led to a burgeoning…
An operator-algebraic formulation of self-testing
Connor Paddock, William Slofstra, Yuming Zhao +1
We give a new definition of self-testing for correlations in terms of states on -algebras. We show that this definition is equivalent to the standard definition for any class…