Galois-qudit CWS code 


A CWS code for Galois qudits, defined using a Galois-qudit cluster state and a set of Galois-qudit \(Z\)-type Pauli strings defined by a \(q\)-ary classical code.

This entry has not yet been developed in the literature, so the formulation below is a conjecture. The Galois-qudit CWS construction takes in \( \mathcal{Q} = (\mathcal{G},\mathcal{C}) \), where \(\mathcal{G}\) is a graph, and where \(\mathcal{C}\) is an \((n,K,d)_q\) \(q\)-ary code. From the graph, we form the Galois-qudit cluster state \( |\mathcal{G} \rangle \). From the \(q\)-ary code, we form Galois-qudit Pauli \(Z\)-type operators \( W_i = Z_{c_{i,1}} \otimes \cdots \otimes Z_{c_{i,n}} \), where \(c_{i,j} \) is the \(j\)-th coordinate of the \(i\)-th classical codeword. The codewords are then \( | i \rangle = W_i | \mathcal{G} \rangle \).


  • Galois-qudit USt code — Any Galois-qudit CWS code can be written as a USt whose (\(K=1\)) stabilizer code is the cluster state and whose coset representatives are constructed from the \(q\)-ary classical code.



  • Group-based cluster-state code — A group-based cluster-state codeword for \(G=GF(q)\) is used to construct a modular-qudit CWS code.
  • Galois-qudit stabilizer code — Galois-qudit CWS codes whose underlying classical code is a linear \(q\)-ary code are Galois-qudit stabilizer codes containing a cluster-state codeword.
Page edit log

Your contribution is welcome!

on (edit & pull request)— see instructions

edit on this site

Zoo Code ID: galois_cws

Cite as:
“Galois-qudit CWS code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2024.
@incollection{eczoo_galois_cws, title={Galois-qudit CWS code}, booktitle={The Error Correction Zoo}, year={2024}, editor={Albert, Victor V. and Faist, Philippe}, url={} }
Share via:
Twitter | Mastodon |  | E-mail
Permanent link:

Cite as:

“Galois-qudit CWS code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2024.