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.
From: Keshab Parhi [view email]
[v1]
Tue, 9 Jun 2026 21:57:07 UTC (1,658 KB)
[v2]
Fri, 28 Aug 2026 21:08:13 UTC (1,694 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。