Description
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 explicitly in the literature, so the formulation below is a conjectural Galois-qudit adaptation of the modular-qudit CWS constructions in Refs. [1,2]. 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 \).
Cousins
- Graph quantum code— A type of Galois-qudit cluster-state code can be built from a Galois-qudit cluster state by applying the conjectural Galois-qudit CWS construction using a linear \(q\)-ary code, in which codewords are obtained by applying Galois-qudit \(Z\)-type operators defined by the code to the Galois-qudit cluster state.
- 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.
Member of code lists
Primary Hierarchy
References
- [1]
- S. Y. Looi, L. Yu, V. Gheorghiu, and R. B. Griffiths, “Quantum-error-correcting codes using qudit graph states”, Physical Review A 78, (2008) arXiv:0712.1979 DOI
- [2]
- D. Hu, W. Tang, M. Zhao, Q. Chen, S. Yu, and C. H. Oh, “Graphical nonbinary quantum error-correcting codes”, Physical Review A 78, (2008) arXiv:0801.0831 DOI
Page edit log
- Victor V. Albert (2024-03-28) — most recent
Cite as:
“Galois-qudit CWS code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2024. https://errorcorrectionzoo.org/c/galois_cws