Constructs distance-3, distance-5, and general 2t+1 logical qudit codes in spin systems with smaller Hilbert-space dimension than qubit-based encodings and polynomial scaling for operations.
Ouyang, Permutation-invariant qudit codes from polynomials, Linear Algebra and its Ap- plications532, 43 (2017)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Fault-Tolerant Encoding of Logical Qudits in Spin Systems
Constructs distance-3, distance-5, and general 2t+1 logical qudit codes in spin systems with smaller Hilbert-space dimension than qubit-based encodings and polynomial scaling for operations.