A lower bound on the overhead of surgery on sparse stabiliser codes

We show that performing lattice surgery on sparse stabiliser codes with sparse ancillas requires $\tilde{\mathrm{\Omega }}(k^2)$ ancillary qubits in the worst case. As a result, for codes with large $k$, constant overhead ancillas can only realise a small fraction of possible measurements.