A lower bound on the overhead of addressable surgery on sparse stabiliser codes
The paper establishes a lower bound of Omega(k^2) ancillary qubits required for performing lattice surgery on sparse stabiliser codes using sparse ancillas. This means that for codes with large k, constant overhead ancillas cannot realize all possible measurements, implying a space-time tradeoff where reducing space requires increasing the number of surgery rounds.