Description
I will discuss a protocol for implementing a concatenated code with reduced check weight, via gauging out qubits in the homological product code. Along the way I will touch upon the unproven conjecture regarding the distance of the homological product code, how this protocol can be viewed as a generalised fault complex of a product of CSS code with a non-repetition classical code, the relationship of this proposal to Litinski's Blocklets, and generalising the fault complex formalism to subsystem codes.
| I am the presenting author | Yes |
|---|