Monomial stabilizer code [1]
Description
Code whose codespace is the joint \(+1\) eigenspace of a set of monomial unitary operators, i.e., unitary operators \(PD\) that are each a product of a permutation matrix \(P\) and a diagonal matrix \(D\) in a distinguished basis. The stabilizing operators need not commute. Codespaces are called M-spaces, and states admitted by one-dimensional codespaces are called M-states [1].
Monomial stabilizer descriptions exist for many states and codes outside of the Pauli stabilizer formalism. Examples include XP stabilizer codes [2], quantum-double codes, the ground space of the AKLT model, W and Dicke states, and coset states (i.e., CSS-type states) of finite Abelian groups [1]. Further examples include locally maximally entanglable (LME) states [3], states encoding output distributions of probabilistic classical circuits [4], and the Laughlin wavefunction at unit filling [1].
A monomial stabilizer group \(\mathcal{G}\) is an extension of the permutation group \(\mathcal{P}\) formed by the permutation parts of its elements by the normal subgroup formed by its diagonal elements. For example, the \(n\)-qubit Pauli group is an extension of its \(X\)-type permutation image by the diagonal subgroup generated by \(Z\)-type strings and phases.
The results below hold when the stabilizing operators generate a finite group \(\mathcal{G}\), which is the setting of the original formalism [1]. The defining joint-eigenspace condition applies verbatim to infinite groups, and many of the results naturally extend [1]. For compact stabilizer groups, averages over \(\mathcal{G}\) can be taken with respect to the Haar measure. For continuous configuration spaces, the distinguished basis becomes a generalized basis of delta-function normalized states, and joint eigenspaces can be spanned by non-normalizable states. In this way, the formalism accommodates the finite, compact, and sufficiently well-behaved locally compact Abelian (LCA) groups underlying general-group quantum-double codes, group-GKP codes, and stabilizer codes, with the LCA case including mixed stabilizer codes. For such \(\mathcal{G}\), the projector onto the codespace is the average of the elements of \(\mathcal{G}\). In other words, the codespace is the isotypic component of the trivial irrep of \(\mathcal{G}\), and the multiplicity of that irrep is the codespace dimension.
Every monomial stabilizer code with finite stabilizer group admits a canonical orthonormal basis, the orbit basis, containing one basis state per orbit of \(\mathcal{P}\) lying in the codespace support [1]. The orbit state determined by a distinguished-basis state \(|x\rangle\) in the support is \begin{align}
Deciding whether the codespace of a monomial stabilizer code is nonzero is \(NP\)-hard, already for diagonal stabilizer generators acting on at most three qubits each [1]. Sampling the distribution underlying a codeword of a one-dimensional code and estimating codeword expectation values of single-qubit observables are \(NP\)-hard under randomized reductions, via the satisfiability problem with a promised unique satisfying assignment [1]. Efficient classical algorithms for sampling and for estimating expectation values of few-body observables exist whenever orbit membership, uniform orbit sampling, and the phases \(\xi_{x}(y)\) are efficiently computable [1]. Nearly all of the example families above satisfy these conditions [1].
Cousins
- Group-representation code— The projector onto a monomial stabilizer codespace with finite stabilizer group is the average of the elements of the group [1]. In other words, the projection is onto the trivial-isotypic sector of the stabilizer group. Group-representation codes instead project onto a selected irrep sector of a group of distinguished unitary operations.
- Knill code— Knill codes and monomial stabilizer codes are overlapping generalizations of stabilizer codes, with neither family containing the other. Knill codes project onto an irrep of a normal subgroup of the group formed by a nice error basis, and such bases need not consist of monomial matrices [5]. Conversely, monomial stabilizer groups need not form nice error bases.
- Valence-bond-solid (VBS) code— The ground space of the spin-1 AKLT model, which underlies the earliest VBS codes, is the joint \(+1\) eigenspace of non-commuting two-body monomial operators [1]. Its orbit basis for open boundary conditions consists of the four standard matrix-product ground states [1].
- Clifford-hierarchy stabilizer code— Clifford-hierarchy stabilizer codes whose stabilizing operators are products of Pauli strings and diagonal Clifford-hierarchy gates [6] are monomial stabilizer codes [1].
Member of code lists
Primary Hierarchy
References
- [1]
M. V. den Nest, “A monomial matrix formalism to describe quantum many-body states”, New Journal of Physics 13, 123004 (2011) arXiv:1108.0531 DOI
- [2]
M. A. Webster, B. J. Brown, and S. D. Bartlett, “The XP Stabiliser Formalism: a Generalisation of the Pauli Stabiliser Formalism with Arbitrary Phases”, Quantum 6, 815 (2022) arXiv:2203.00103 DOI
- [3]
C. Kruszynska and B. Kraus, “Local entanglability and multipartite entanglement”, Physical Review A 79, (2009) arXiv:0808.3862 DOI
- [4]
S. Bravyi and B. Terhal, “Complexity of stoquastic frustration-free Hamiltonians”, (2008) arXiv:0806.1746
- [5]
A. Klappenecker and M. Roetteler, “On the Monomiality of Nice Error Bases”, (2003) arXiv:quant-ph/0301078
- [6]
Anonymous, “Clifford hierarchy stabilizer codes: Transversal non-Clifford gates and magic”, Physical Review Letters (2026) arXiv:2511.02900 DOI
- [7]
P.-S. Hsin, R. Kobayashi, and G. Zhu, “Non-Abelian Self-Correcting Quantum Memory and Transversal Non-Clifford Gate Beyond the n \({}^{
1/3 }\) Distance Barrier”, PRX Quantum 6, (2025) arXiv:2405.11719 DOI - [8]
Y.-A. Chen and P.-S. Hsin, “Exactly solvable lattice Hamiltonians and gravitational anomalies”, SciPost Physics 14, (2023) arXiv:2110.14644 DOI
- [9]
F. Wei, Z. Han, Z. Li, and Z.-W. Liu, “NLTM Hamiltonians from gauged sheaf quantum locally testable codes”, (2026) arXiv:2609.40220
Page edit log
- Victor V. Albert (2026-08-26) — most recent
Cite as:
“Monomial stabilizer code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2026. https://errorcorrectionzoo.org/c/monomial_stabilizer, arXiv:2606.11484