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

arXiv:1609.01809 · Applicable Algebra in Engineering Communication and Computing

Performance of ternary double circulant, double twistulant, and self-dual codes

Thomas Aaron Gulliver, Masaaki Harada

Published Jan 16, 2017• 0 citations
arXivHTMLPDF
DOI
10.1007/s00200-017-0312-4

Related papers

Ternary self-orthogonal codes of dual distance three and ternary quantum codes of distance three

Gang Chen, Ruihu Li

Designs Codes and Cryptography•Feb 15, 2012•13 citations

New self-dual additive F4 -codes constructed from circulant graphs

Markus Grassl, Masaaki Harada

arXiv:1509.04846•Discrete Mathematics•Nov 14, 2016•10 citations

Double quadratic residue codes and self-dual double cyclic codes

Arezoo Soufi Karbaski, Taher Abualrub, Steven T. Dougherty

Applicable Algebra in Engineering Communication and Computing•May 29, 2020•1 citation

Triorthogonal codes and self-dual codes

Minjia Shi, Haodong Lu, Jon-Lark Kim +1 more

arXiv:2408.09685•Quantum Information Processing•Jul 20, 2024•11 citations

Quasi-cyclic self-dual codes of length 70

Zhdanov, Alexandre

In this paper we obtain a number of [70,35,12] singly even self-dual codes as a quasi-cyclic codes with m=2 (tailbitting convolutional codes). One of them is the first known code with parameters Beta=140 Gamma=0. All codes are not pure double circulant i.e. could not be represented in systematic form.

arXiv:1704.01512•Apr 5, 2017•0 citations

Self-dual Stacked Quantum Low-Density Parity-Check Codes

Ze-Chuan Liu, Chong-Yuan Xu, Yong Xu

Quantum low-density parity-check (qLDPC) codes are promising candidates for fault-tolerant quantum computation due to their high encoding rates and distances. However, implementing logical operations using qLDPC codes presents significant challenges. Previous research has demonstrated that self-dual qLDPC codes facilitate the implementation of transversal Clifford gates. Here we introduce a method for constructing self-dual qLDPC codes by stacking non-self-dual qLDPC codes. Leveraging this methodology, we develop double-chain bicycle codes, double-layer bivariate bicycle (BB) codes, double-layer twisted BB codes, and double-layer reflection codes, many of which exhibit favorable code parameters. Additionally, we conduct numerical calculations to assess the performance of these codes as quantum memory under the circuit-level noise model, revealing that the logical failure rate can be significantly reduced with high pseudo-thresholds.

quant-pharXiv:2602.15372•Feb 18, 2026•4 citations
Quantum low-density parity-check (qLDPC) codes are promising candidates for fault-tolerant quantum computation due to their high encoding rates and distances. However, implementing logical operations using qLDPC codes presents significant challenges. Previous research has demonstrated that self-dual qLDPC codes facilitate the implementation of transversal Clifford gates. Here we introduce a method for constructing self-dual qLDPC codes by stacking non-self-dual qLDPC codes. Leveraging this methodology, we develop double-chain bicycle codes, double-layer bivariate bicycle (BB) codes, double-layer twisted BB codes, and double-layer reflection codes, many of which exhibit favorable code parameters. Additionally, we conduct numerical calculations to assess the performance of these codes as quantum memory under the circuit-level noise model, revealing that the logical failure rate can be significantly reduced with high pseudo-thresholds.