{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreiej6roicee4hyre6nxbpnaazn2guv7nwdscqzdl37rap2nzdahizu",
    "uri": "at://did:plc:4rgrdigiftglskeax4wvmsev/app.bsky.feed.post/3mf4am6f7va72"
  },
  "coverImage": {
    "$type": "blob",
    "ref": {
      "$link": "bafkreiflo6xt7is6b2iafwghkjahlgggocme5jwjsbeuqqwcywuvjhmszm"
    },
    "mimeType": "image/png",
    "size": 24783
  },
  "path": "/abs/2602.15372v1",
  "publishedAt": "2026-02-18T01:00:00.000Z",
  "site": "https://arxiv.org",
  "tags": [
    "Ze-Chuan Liu",
    "Chong-Yuan Xu",
    "Yong Xu"
  ],
  "textContent": "**Authors:** Ze-Chuan Liu, Chong-Yuan Xu, Yong Xu\n\nQuantum 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.",
  "title": "Self-dual Stacked Quantum Low-Density Parity-Check Codes"
}