arXiv:2610.11225
High-Rate Concatenated Quantum Error-Correcting Codes for Qudits
Takanori Nishi, Hayato Goto
Abstract
Qudits provide a larger local Hilbert space than qubits and have recently attracted interest as building blocks for efficient fault-tolerant quantum computation (FTQC). In this work, we extend many-hypercube (MHC) codes, high-rate concatenated quantum codes, from qubits to qudits of prime dimension $q$. We construct the level-2 and level-3 MHC codes with parameters $\left[\!\left[6^2,4^2,2^2\right]\!\right]_q$ and $\left[\!\left[6^3,4^3,2^3\right]\!\right]_q$, respectively, and generalize the level-by-level minimum-distance (LLMD) decoder originally proposed for the qubit MHC codes. In a qudit $X$-error model, we evaluate the code-capacity performance of the qudit MHC codes for dimensions up to $q=13$. We find that the error threshold increases monotonically with the local dimension $q$, reaching $10.0\%$ for $q=13$, nearly double the value of $5.1\%$ for qubits. Furthermore, for sufficiently large local dimensions, we observe a pronounced waterfall regime in which the logical error rate decreases substantially faster than expected from conventional distance-based estimates. To understand the origin of the observed qudit advantage, we analyze the decoding performance in terms of the entropy of the underlying $q$-ary noise channel. This analysis reveals a competition between the increased syndrome information available at larger $q$ and the simultaneous growth of the typical physical error weight at fixed entropy. These results demonstrate that higher-dimensional quantum systems can substantially improve the performance of high-rate concatenated quantum codes and motivate further development of qudit-based FTQC architectures.
AI Summary
This paper asks how increasing the local dimension affects high-rate concatenated many-hypercube (MHC) codes. It extends the qubit construction to prime-dimensional qudits, giving codes with parameters $[[6^L,4^L,2^L]]_q$, and specifies stabilizers, logical operators, encoding circuits, logical SUM and Fourier operations, and error-correcting teleportation. Hard-decision (HD) and level-by-level minimum-distance (LLMD) decoders are generalized to qudits. Code-capacity Monte Carlo simulations study levels $L=2,3$ for $q=2,3,5,7,11,13$, under independent $X$ errors with uniformly distributed nonzero powers and error-free preparation and measurement. Success requires correct decoding of every logical qudit. The level-2/level-3 crossing increases from $5.1\%$ at $q=2$ to $10.0\%$ at $q=13$ with LLMD; HD crossings range from $1.1\%$ to $1.4\%$. For level 3, fits over physical error rates $0.02$–$0.04$ give logical-error exponents increasing from $3.48$ to $5.73$, compared with the distance-based exponent $4$. This finite-range steepening is identified as a waterfall regime. Replotting against $q$-ary channel entropy largely aligns the curves; residual differences are interpreted through competing effects of richer syndrome information and larger typical error weights at fixed entropy. The reported thresholds are two-level crossings rather than asymptotic estimates. LLMD uses restricted searches and random candidate pruning, and the large-$q$ low-error exponents have not reached their expected asymptotic values. Circuit-level noise, prime-power dimensions beyond primes, larger local dimensions, and decoding adapted to structured non-Pauli noise such as amplitude damping remain future directions.
Error found: The abstract calls the level-2/level-3 block-error crossing values error thresholds, although the paper does not establish that they represent asymptotic thresholds as concatenation depth increases.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 11 pages, 2 figures