quantum information

Foliated Quantum Error Correction for Qudits

arXiv:2607.13784

summary

The paper introduces a method to convert any Pauli‑based quantum error‑correcting code for prime‑dimensional qudits into a foliated graph‑state form that enables fault‑tolerant measurement‑based quantum computing, and it evaluates error thresholds for examples such as the qudit toric code.

Abstract

We present a framework for foliating any Pauli-based quantum error-correcting code over prime-dimensional qudits. For any such code, we obtain a qudit graph state that can be measured to perform fault-tolerant measurement-based quantum computing. Such a paradigm is of interest in platforms such as photonics, where measurement-based protocols are natural and high-dimensional states are readily available. We discuss several examples for arbitrary prime dimension , such as the qudit toric code (stabilizer, CSS), the -dimensional perfect code (stabilizer, non-CSS), and a straightforward -dimensional generalization of the CSS honeycomb code (dynamical, CSS). Under a simple error model, we numerically calculate thresholds for the foliated qudit toric code and demonstrate that they are comparable to the non-foliated version.

15 Figures in total (5 in the main text and appendices, 10 in Supplementary Material.) and 1 table

Topics & keywords

#quantum error correction#qudit systems#measurement-based quantum computing#graph states#fault tolerancefoliated codesPauli-based codesprime-dimensional quditstoric codeCSS codethreshold calculation