A parity obstruction to degree-optimal syndrome extraction in bivariate bicycle codes
The paper investigates a parity obstruction preventing syndrome extraction circuits from achieving their theoretical minimum depth for bivariate bicycle codes. While optimal syndrome extraction is desired for efficient quantum error correction, this work shows that certain structural properties of these specific codes impose constraints on the achievable circuit depth, meaning the ideal complexity cannot be reached without modification.