Hayato Goto (Dec 02 2025).
Abstract: Many-hypercube codes [H. Goto, Sci. Adv. 10, eadp6388 (2024)], concatenated
[[n,n−2,2]] quantum error-detecting codes (
n is even), have recently been proposed as high-rate quantum codes suitable for fault-tolerant quantum computing. However, the original many-hypercube codes with
n=6 have large code block sizes at high concatenation levels (216 and 1296 physical qubits per block at levels 3 and 4, respectively), making not only experimental realization difficult but also logical error rates high. Toward earlier experimental realization and lower logical error rates, here we investigate smaller many-hypercube codes obtained by concatenating
[[6,4,2]] and/or
[[4,2,2]] codes, where, e.g.,
D6,4,4 denotes the many-hypercube code using
[[6,4,2]] at level 1 and
[[4,2,2]] at levels 2 and 3. As a result, we found a surprising fact:
D6,4,4 (
D6,6,4,4) can achieve lower block error rates than
D4,4,4 (
D4,4,4,4), despite its higher encoding rate. Focusing on level 3, we also developed efficient fault-tolerant encoders realizing about 60% overhead reduction while maintaining or even improving the performance, compared to the original design. Using them, we numerically confirmed that
D6,4,4 also achieves the best performance for logical controlled-NOT gates in a circuit-level noise model. These results will be useful for early experimental realization of fault-tolerant quantum computing with high-rate quantum codes.