报告题目: A Structural Introduction to Quantum LDPC Codes: From Representations to Modern Constructions

报告人: 姚远，北京大学

报告时间: 6月5日 周五， 10:30

报告地点：腾讯会议：106-740-917

摘  要: 

Quantum low-density parity-check (qLDPC) codes have emerged as one of the most promising approaches to reducing the overhead of fault-tolerant quantum computation. Over the past decade, a diverse collection of code families has been developed, including hypergraph product codes, lifted product codes, balanced product codes, fiber bundle codes, bivariate bicycle codes, and several recent variants. Although these constructions are often presented using different mathematical languages, many of their underlying structures are closely related.

This talk presents a structural introduction to qLDPC codes based on a unified representation framework. We first review four complementary descriptions of CSS codes: parity-check matrices, chain complexes, Tanner graphs, and polynomial representations, and discuss how these viewpoints are connected. Using parity-check matrices as a common language, we then systematically introduce major qLDPC constructions and explain their relationships. Finally, we discuss how code structure influences practical considerations such as connectivity, syndrome extraction, and fault-tolerant architectures.