Classical simulation of coherent crosstalk in surface codes
This work develops a classical algorithm to simulate coherent crosstalk in surface codes, which involves nearest-neighbor ZZ interactions and single-qubit rotations. The simulation is efficient, but combining these noise types leads to a hardness result: efficiently sampling the resulting syndrome distributions is computationally hard unless the polynomial hierarchy collapses.