Zimu Li and colleagues at Tsinghua University present findings in a study titled “Theory of (Co)homological Invariants on Quantum LDPC Codes”. The study investigates the mathematical underpinnings of quantum error correction with a new framework for analysing (co)homological invariants of quantum codes. Zimu Li and colleagues at Tsinghua University detail a systematic approach applicable to a wide range of quantum low-density parity-check (qLDPC) codes, including both hypergraph product (HGP) and sheaf codes. The work resolves a key challenge in explicitly defining sheaf codewords and presents the first thorough calculation of cup products within sheaf code structures. By linking sheaf codes to HGP codes through graph lifts, the researchers propose a method for generating extensive code families while preserving key invariants, potentially enabling the creation of many parallel, constant-depth multi-controlled-Z gates and offering a pathway towards improved quantum coding and fault tolerance
Constructing complex quantum error correction via inductive code lifting
An inductive lifting scheme forms the basis of this advance, a technique for building complex quantum codes from simpler ones while preserving essential mathematical properties. A small, well-defined hypergraph product (HGP) code served as the initial structure; HGP codes represent a type of quantum code constructed from interconnected graphs, providing a structured approach to encoding information. Graph lifts, a process similar to layering maps, were then employed to create more intricate sheaf codes from the initial HGP code, preserving essential mathematical properties throughout the process. The focus is on computing cup products, fundamental operations in algebraic topology, and approximately N independent cup products can be supported on codes of length N, potentially enabling efficient quantum gates. This capability could significantly improve the speed and efficiency of quantum computations.
Cup product support scales linearly with code length in qLDPC and qLTC codes
A major obstacle to supporting numerous parallel quantum gates has now been overcome; mathematicians have proven that up to Θ(N) independent cup products can be supported on quantum low-density parity-check (qLDPC) and quantum locally testable codes (qLTCs) of length N. This result, reliant on Artin’s primitive root conjecture, unlocks the potential for linearly many parallel, constant-depth multi-controlled-Z gates, essential for efficient quantum computation. The work presents a new framework for analysing (co)homological invariants, linking HGP codes to more complex sheaf codes through graph lifts, allowing for the inductive generation of code families while preserving key mathematical properties.
The team generalised the concept of ‘canonical logical representatives’ from simpler codes to the more complex ‘sheaf codes’, resolving a key challenge in defining codewords. Interpreting sheaf codes as variations of HGP codes, a technique for building strong quantum error correction, facilitated this, and the inductive process preserves important mathematical properties, allowing verification of code features on smaller, manageable instances.
