Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
95 tokens/sec
Gemini 2.5 Pro Premium
32 tokens/sec
GPT-5 Medium
18 tokens/sec
GPT-5 High Premium
20 tokens/sec
GPT-4o
97 tokens/sec
DeepSeek R1 via Azure Premium
87 tokens/sec
GPT OSS 120B via Groq Premium
468 tokens/sec
Kimi K2 via Groq Premium
202 tokens/sec
2000 character limit reached

Qudit-based quantum error-correcting codes from irreducible representations of SU(d) (2410.02407v1)

Published 3 Oct 2024 in quant-ph, math-ph, and math.MP

Abstract: Qudits naturally correspond to multi-level quantum systems, which offer an efficient route towards quantum information processing, but their reliability is contingent upon quantum error correction capabilities. In this paper, we present a general procedure for constructing error-correcting qudit codes through the irreducible representations of $\mathrm{SU}(d)$ for any odd integer $d \geq 3.$ Using the Weyl character formula and inner product of characters, we deduce the relevant branching rules, through which we identify the physical Hilbert spaces that contain valid code spaces. We then discuss how two forms of permutation invariance and the Heisenberg-Weyl symmetry of $\mathfrak{su}(d)$ can be exploited to simplify the construction of error-correcting codes. Finally, we use our procedure to construct an infinite class of error-correcting codes encoding a logical qudit into $(d-1)2$ physical qudits.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.