{
  "abstract": "In encoder circuits built on the stabilizer formalism, the dominant contribution to circuit complexity comes from the use of controlled (CNOT) gates, making CNOT-count reduction a central circuit-design objective. Entanglement-assisted (EA) quantum QC-LDPC codes offer strong error-correction capabilities with structured parity-check matrices, but their practical use depends on efficient encoder circuits and the availability of pre-shared Bell pairs (ebits). In this paper, we adopt a prior entanglement-assisted QC-LDPC (EAQC) encoder construction. We formulate the encoder optimization as a search over GF(2) row operations that decompose the binary matrix derived from its CNOT sub-sequence. We solve this problem using a beam search algorithm guided by a Hamming-distance heuristic. For the tested EA quantum QC-LDPC code families, the proposed method achieves CNOT-count reductions of 7.3-34.0% relative to the baseline EAQC encoder. The optimized circuits also outperform the Patel-Markov-Hayes and greedy cost-minimization baselines, and are verified by stabilizer-tableau simulation. These results show that substantial encoder simplification is possible for structured EA QC-LDPC codes.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": "Journal reference: IEEE Trans. Circuits and Systems II: Express Briefs, 73, 2026",
  "arxiv": "2606.11468",
  "author_total": 4,
  "authors": [
    {
      "name": "Aditya Sodhani"
    },
    {
      "name": "Pavan Kumar"
    },
    {
      "name": "Shayan Srinivasa Garani"
    },
    {
      "name": "Keshab K. Parhi"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/2v1j3zmpmdkz0.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2606.11468",
  "fulltext_url": null,
  "id": "2v1j3zmpmdkz0",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2606.11468",
  "language": null,
  "licence": "CC-BY-NC-ND-4.0",
  "licence_label": "CC BY-NC-ND 4.0",
  "licence_source": "article",
  "licence_url": "http://creativecommons.org/licenses/by-nc-nd/4.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "cs.IT"
    ],
    [
      "arxiv",
      "math.IT"
    ],
    [
      "arxiv",
      "quant-ph"
    ]
  ],
  "openalex": null,
  "pdf_url": "https://arxiv.org/pdf/2606.11468",
  "pmcid": null,
  "pmid": null,
  "published": "2026-08-28",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/2v1j3zmpmdkz0.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:23:19Z",
      "native_id": "2606.11468",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2606.11468"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "arxiv:math.IT",
      "subfield": "general"
    },
    {
      "field": "physics",
      "origin": "arxiv:quant-ph",
      "subfield": "quantum"
    }
  ],
  "title": "Optimizing Encoder Circuits of Entanglement-Assisted Quantum LDPC Codes via Beam Search",
  "title_text": "Optimizing Encoder Circuits of Entanglement-Assisted Quantum LDPC Codes via Beam Search",
  "type": "preprint",
  "updated_at": "2026-11-05T15:20:21Z",
  "url": "https://research.draconitic.com/paper/2v1j3zmpmdkz0",
  "venue": "arXiv",
  "versions": [
    {
      "doi": "10.1109/tcsii.2026.3734949",
      "pid": null,
      "relation": "published-as",
      "title": null,
      "venue": null
    }
  ]
}