A new framework for building topological subsystem codes based on anticommuting quantum spin liquids has been developed by Vaibhav Sharma and Sumiran Pujari at Rice University, in collaboration with the Indian Institute of Technology Bombay. Sharma and colleagues demonstrate that these models, derived from modifications of the toric code, possess an extensive ground state degeneracy crucial for robust quantum error correction. Unlike conventional stabilizer codes which rely on commuting operators, the approach leverages an extensive set of anticommuting local conserved operators, resulting in a topological subsystem code with unique properties including a notable increase in undisturbed local gauge qubits. This construction offers a flexible template for designing new quantum error correcting codes adaptable to diverse quantum hardware platforms and geometries, addressing a critical need in the field of scalable quantum computation. Kagome lattice geometry enables threefold reduction in quantum error correction measurements A novel class of topological subsystem codes now requires threefold fewer measurements than existing designs, representing a significant advancement in reducing the overhead associated with quantum error correction. The implementation of these codes on a kagome lattice geometry necessitates only weight-3 local check operator measurements, a substantial reduction from the previously required weight-4 measurements common in many subsystem codes. This reduction in measurement complexity is achieved without compromising the ability to maintain an extensive number of undisturbed local gauge qubits, simultaneously enabling strong error correction capabilities. Built upon the principles of anticommuting quantum spin liquids, the framework provides a flexible template adaptable to diverse quantum hardware platforms and lattice geometries, potentially enhancing encoding rates or improving error thresholds for practical quantum computation. The kagome lattice, characterised by its corner-sharing triangles, provides a natural structure for implementing these low-weight check operators. For a square lattice of size L x L, the resulting code is an [L², 2, L] code,