Single-prover interactive proofs can recognize PSPACE; if certain complexity assumptions are made, they can do so in zero-knowledge. Generalizing to multiple non-communicating provers extends this class to NEXP, and at the same time removes the complexity assumption needed for zero-knowledge. \n \nHowever, it was recently discovered that the non-communication condition might be insufficient to guarantee soundness. The provers can form joint randomness through non-local computation without communicating. This could break protocols that rely on the statistical independence of the provers. \n \nIn this work, we analyze multi-prover interactive proofs under the constraint of statistical isolation which prohibits non-local computation. We show that there exists perfect zero-knowledge proofs for NEXP under statistical isolation.
We prove the Rényi quantum null energy condition for every integer Rényi order
n≥2. In local Poincaré-invariant quantum field theory, this states that the sandwiched Rényi divergence (SRD) of an excited state relative to the vacuum is convex along a future-directed null deformation. We assume that the deformation is realized by the canonical translations of a half-sided modular inclusion and that the divergence is finite for the initial, undeformed algebra. The proof establishes convexity of the SRD along the induced positive contraction semigroup on Haagerup
Ln(M), for every non-zero positive initial element. We also establish a Rényi ant formula at every even integer order and, under an additional regularity assumption, at odd integer orders. The Rényi ant formula identifies the negative first null derivative of SRD with a multiple of the infimum of the canonical null-translation energy over vector purifications of an escort state constructed from the excited state and the vacuum.