Work

Almost optimal geometrically local quantum LDPC codes in any dimension

Year: 2026

Type: article

Abstract: with local check operators, have been a subject of significant interest. A key challenge is identifying the optimal code construction that maximizes both code dimension and distance under the geometric constraints. In this work, we introduce a construction that can transform any good quantum LDPC code into an almost optimal geometrically local quantum code. Our approach hinges on a novel yet simple procedure that extracts a two-dimensional structure from an arbitrary three-term chain complex, building a connection between geometric operations and code constructions. We expect that this procedure will find broader applications in areas such as weight reduction and the geometric realization of chain complexes.

Source: Nature Communications

DOI: 10.1038/s41467-026-69031-w

Authors: Xingjian Li, Ting-Chun Lin, Adam Wills, Min-Hsiu Hsieh

Institutions: Tsinghua University, University of California San Diego, Foxconn (Taiwan), Massachusetts Institute of Technology

Language: English

Topic: Quantum Computing Algorithms and Architecture

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: gold

Estimated APC paid: $6,990

OpenAlex ID: W7127943645