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

Qudits naturally correspond to multilevel quantum systems, which have the potential to enable more efficient 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 SU ( d ) for any odd integer d ≥ 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 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.

Publication Details

Journal
Apollo (University of Cambridge)
Published
2025-09-09
DOI
https://doi.org/10.17863/cam.121183
Primary Topic
Geochemistry and Geologic Mapping
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

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

Apollo (University of Cambridge)
Geochemistry and Geologic Mapping
article

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

article en

Abstract

Qudits naturally correspond to multilevel quantum systems, which have the potential to enable more efficient 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 SU ( d ) for any odd integer d ≥ 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 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.

Apollo (University of Cambridge)
Openalex Percentile: Top 49%
Geochemistry and Geologic Mapping
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.