Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Contemporary mathematics - American Mathematical Society

Geometric constructions of quantum codes

Jürgen Bierbrauer, D. Bartoli, Stefano Marcugini, Fernanda Pambianco

Published Jan 1, 2010• 5 citations
Publisher
DOI
10.1090/conm/523/10321

Related papers

Geometric Constructions of Gallager Codes

Shu Lin, Jun Xu, Heng Tang +1 more

Springer eBooks•Jan 1, 2003•0 citations

Almost optimal geometrically local quantum LDPC codes in any dimension

Xingjian Li, Ting-Chun Lin, Adam Wills +1 more

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.

Nature Communications•Feb 5, 2026•2 citations

Constructions of quasi-twisted quantum codes

Jingjie Lv, Ruihu Li, Junli Wang

arXiv:1912.05142•Quantum Information Processing•Jul 30, 2020•11 citations

On the Construction of Asymmetric Quantum Codes

Giuliano G. La Guardia

International Journal of Theoretical Physics•Feb 4, 2014•21 citations

Quantum Codes From Concatenated Algebraic-Geometric Codes

H. Chen, San Ling, Chaoping Xing

We apply Steane's enlargement of the Calderbank-Shor-Steane (CSS) codes and additive codes over F/sub 4/ to concatenated algebraic-geometric codes to construct many good quantum codes with fewer restrictions on the parameters compared to some known quantum codes. Some of the quantum codes we have constructed are either optimal or have parameters as good as the best known codes, while some have parameters better than those obtained from other known constructions.

IEEE Transactions on Information Theory•Jul 19, 2005•70 citations

Constructing quantum codes

Hao Chen

Frontiers of Computer Science in China•Jun 1, 2008•0 citations
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.