2026/06/30 by Ming Yang
#quant-ph #cs.CC
We formulate classical simulation of quantum correlations as coordination across a spacetime separator. All past-dependent information capable of influencing the future must cross the separator either through communicated messages or through a persistent classical state. We prove a general lower bound on this classical coordination cost in terms of the nonnegative rank of the separator correlation matrix, with approximate and amortized extensions governed by approximate nonnegative rank and Wyner common information. For sequential processes, we introduce a causal positive-realization rank that enforces consistent response and state-update maps, and we explain how bounded local computation and support-covering models arise as restricted cases. We apply the framework to genuine global Kochen--Specker contextuality, in which local subsystems are noncontextual and the tested multipartite blocks are generalized-Bell-local, while the complete empirical model has no global noncontextual explanation. At the symmetric point of a polarization--path Hardy construction, exact classical simulation requires two coordination bits, whereas the corresponding quantum separator requires one qubit. Under exact repetition, the classical lower bound is the base-two logarithm of three bits per copy; with asymptotically vanishing error, it becomes one and a half classical bits per copy, compared with one qubit per copy. We further construct a finite stabilizer--Peres--Mermin family for which the exact classical coordination cost grows quadratically with system size, while the quantum boundary cost grows only linearly. The separation applies to arbitrary finite-state causal online simulators. Establishing a constant-error quadratic separation and an intrinsic construction without flag conditioning remain open.