To someone who doesn't actually know many of the terms here, it sounds like they didn't accomplish much. They defined a stronger form of locality called "bi-locality" and found a way to violate it. The structure of the argument is, "We stood up a strawman and knocked it down," which sounds pretty weak. Is bi-locality an inherently interesting property? Does all classical computation follow it? I don't know enough to…
> The structure of the argument is, "We stood up a strawman and knocked it down," which sounds pretty weak. Weaker than "I don't understand what the paper says, only read a high level layman summary, not sure even what what the experiment was for, but I'm gonna piss on it anyway"? Even assuming what you already describe, the ability to show bi-locality as a new lower bound above which locality constraints apply, is v…
Come on. Parent was saying what it looked like to a layman, and then asking for someone to address that and ask what was actually going on. No need to "piss on [him]".