Romanesco codes are Clifford-deformed bivariate bicycle codes made from two cellular automaton codes that achieve an effective distance scaling linearly with qubit count in the infinite-bias limit.
Quantum XYZ cyclic codes for biased noise
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
In some quantum computing architectures, Pauli noise is highly biased. Tailoring Quantum error-correcting codes to the biased noise may benefit reducing the physical qubit overhead without reducing the logical error rate. In this paper, we propose a family of quantum XYZ cyclic codes, which are the only one family of quantum cyclic codes with code distance increasing with code length to our best knowledge and have good error-correcting performance against biased noise. Our simulation results show that the quantum XYZ cyclic codes have $50\%$ code-capacity thresholds for all three types of pure Pauli noise and around $13\%$ code-capacity threshold for depolarizing noise. In the finite-bias regime, when the noise is biased towards Pauli $Z$ errors with noise bias ratios $\eta_Z=1000$, the corresponding code-capacity threshold is around $49\%$. Besides, we show that to reach the same code distance, the physical qubit overhead of XYZ cyclic code is much less than that of the XZZX surface code.
citation-role summary
citation-polarity summary
fields
quant-ph 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Romanesco codes: Bias-tailored qLDPC codes from fractal codes
Romanesco codes are Clifford-deformed bivariate bicycle codes made from two cellular automaton codes that achieve an effective distance scaling linearly with qubit count in the infinite-bias limit.