Effectiveness hypotheses and the boxworld interactive-proof class
Determine which hypothesis on message state spaces, expressed in the coordinates of the computable verifier gates, guarantees that the interactive-proof class equals PSPACE for a natural class of theories including theories not isomorphic to quantum or classical theory, and determine whether the interactive-proof class of boxworld equals PSPACE.
References
Which hypothesis on the message state spaces, formulated in the coordinates of (T4), implies $GIP(G)=PSPACE$ for a natural class of theories including theories that are not isomorphic to quantum or classical theory? Is $GIP(\text{boxworld})=PSPACE$? No analogue of the realisation theorem for quantum combs is known for boxworld, so the strategies of a boxworld prover have no known finite description of the kind that underlies the quantum upper bound .
What are the multi-prover classes of boxworld and of other theories satisfying (T1)--(T4)?
Which parts of Theorems~\ref{thm:cl-universal} and~\ref{thm:qm-universal} survive when local tomography is replaced by a weaker structural assumption on composites?