Logical Operator Decomposition for Distance Analysis of Bivariate Bicycle Codes
This paper introduces a logical operator decomposition framework for bivariate bicycle quantum codes that establishes an explicit distance identity, proves uniform rank properties, and enables the precise enumeration of minimum-weight logical operators to determine the exact distances of standard code instances.