Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1911.10158

Decomposition of Pauli groups via weak central products

Andrea Rocchetto, Francesco G. Russo

Published Nov 22, 2019• 4 citations
arXivHTMLPDF

Abstract

For any $m \ge 1$ and odd prime power $\mathtt{q}=\mathtt{p}^m$, for $\mathtt{q}=2$, and for any $n \ge 1$, we show a result of decomposition for Pauli groups $\mathcal{P}_{n,\mathtt{q}}$ in terms of weak central products. This can be used to describe the underlying structure of Pauli groups on $n$ qudits of dimension $\mathtt{q}$ and enables us to identify abelian subgroups of $\mathcal{P}_{n,\mathtt{q}}$. As a consequence of our main results, we show a similar factorisation for the so--called `lifted' Pauli groups, recently introduced by Gottesman and Kuperberg in the context of error-correcting codes in quantum information theory.

DOI
10.48550/arxiv.1911.10158

Related papers

The qudit Pauli group: non-commuting pairs, non-commuting sets, and structure theorems

Rahul Sarkar, Theodore J. Yoder

Qudits with local dimension d>2 can have unique structure and uses that qubits ( d=2 ) cannot. Qudit Pauli operators provide a very useful basis of the space of qudit states and operators. We study the structure of the qudit Pauli group for any, including composite, d in several ways. To cover composite values of d , we work with modules over commutative rings, which generalize the notion of vector spaces over fields. For any specified set of commutation relations, we construct a set of qudit Paulis satisfying those relations. We also study the maximum size of sets of Paulis that mutually non-commute and sets that non-commute in pairs. Finally, we give methods to find near minimal generating sets of Pauli subgroups, calculate the sizes of Pauli subgroups, and find bases of logical operators for qudit stabilizer codes. Useful tools in this study are normal forms from linear algebra over commutative rings, including the Smith normal form, alternating Smith normal form, and Howell normal form of matrices. Possible applications of this work include the construction and analysis of qudit stabilizer codes, entanglement assisted codes, parafermion codes, and fermionic Hamiltonian simulation.

arXiv:2302.07966•Quantum•Apr 4, 2024•16 citations

A Review of Galois Qudits

Adam Wills

Galois qudits are $q$-dimensional quantum systems whose choice of Pauli group encodes the arithmetic of some finite field $\mathbb{F}_q$. They differ from the more familiar modular qudit, which are the same quantum system but whose choice of Pauli group are the clock and shift operators, which encode the arithmetic of integer addition and multiplication modulo $q$. Galois qudits are a useful mathematical construct that allow us to leverage the mathematical tools that are native to the larger qudit while only physically building smaller qudits. In particular, a Galois qudit of dimension $q = 2^s$ is exactly the same thing as a collection of $s$ qubits, not only in its Hilbert space, but also in its Pauli group, and Clifford hierarchy. This formalism has found a lot of utility recently in constructing quantum error-correcting codes over qubits with useful properties. In this review, we build on existing literature to collect and formalise facts and proofs about Galois qudits over binary extension fields. We define them and their Clifford hierarchies, describe what it means to measure their Pauli operators, describe their stabiliser tableaux, formally define qudit-to-qubit mappings, and finally describe quantum Reed-Solomon codes.

quant-pharXiv:2605.18981•May 20, 2026•9 citations

Pauli graphs when the Hilbert space dimension contains a square: Why the Dedekind psi function?

Michel R. P. Planat

We study the commutation relations within the Pauli groups built on all decompositions of a given Hilbert space dimension $q$, containing a square, into its factors. Illustrative low dimensional examples are the quartit ($q=4$) and two-qubit ($q=2^2$) systems, the octit ($q=8$), qubit/quartit ($q=2\times 4$) and three-qubit ($q=2^3$) systems, and so on. In the single qudit case, e.g. $q=4,8,12,...$, one defines a bijection between the $σ(q)$ maximal commuting sets [with $σ[q)$ the sum of divisors of $q$] of Pauli observables and the maximal submodules of the modular ring $\mathbb{Z}_q^2$, that arrange into the projective line $P_1(\mathbb{Z}_q)$ and a independent set of size $σ(q)-ψ(q)$ [with $ψ(q)$ the Dedekind psi function]. In the multiple qudit case, e.g. $q=2^2, 2^3, 3^2,...$, the Pauli graphs rely on symplectic polar spaces such as the generalized quadrangles GQ(2,2) (if $q=2^2$) and GQ(3,3) (if $q=3^2$). More precisely, in dimension $p^n$ ($p$ a prime) of the Hilbert space, the observables of the Pauli group (modulo the center) are seen as the elements of the $2n$-dimensional vector space over the field $\mathbb{F}_p$. In this space, one makes use of the commutator to define a symplectic polar space $W_{2n-1}(p)$ of cardinality $σ(p^{2n-1})$, that encodes the maximal commuting sets of the Pauli group by its totally isotropic subspaces. Building blocks of $W_{2n-1}(p)$ are punctured polar spaces (i.e. a observable and all maximum cliques passing to it are removed) of size given by the Dedekind psi function $ψ(p^{2n-1})$. For multiple qudit mixtures (e.g. qubit/quartit, qubit/octit and so on), one finds multiple copies of polar spaces, ponctured polar spaces, hypercube geometries and other intricate structures. Such structures play a role in the science of quantum information.

arXiv:1009.3858•Journal of Physics A Mathematical and Theoretical•Dec 20, 2010•34 citations

Phase-Space Representations of Quantum Error-Correcting Codes

Enrico Bozzetto, Jonte R. Hance

We connect the structure theorem for quasiprobability representations to quantum error correction. For a code space invariant under a subgroup of an extended Weyl-Heisenberg group, the Brif-Mann construction gives a semi-functorial representation whenever its kernel satisfies the Stratonovich-Weyl axioms, and composes on channels covering full error-correction cycles. With phase-space parity available, a kernel other than the ordinary Wigner one exists iff the code space is invariant under a lattice of displacements: among compact-phase-space bosonic codes, this is only the ideal Gottesman-Kitaev-Preskill family; in finite dimension, this is every qudit stabiliser code, whose negative volume for odd prime dimension is the syndrome-averaged logical magic. For rotation-symmetric, one-photon, non-Pauli qudit and spin codes only the ordinary kernel remains, its negativity reflecting the physical carrier, not logical content; a sector-graded representation built from recovery isometries restores a resource reading. We add a channel atlas, a closed-form magic lifetime under displacement noise, a Kirkwood-Dirac layer, and finite-energy corrections.

quant-pharXiv:2607.02164•Physical Review Research•Jul 3, 2026•0 citations

Applications of the generalised Pauli group in prime and prime power dimensions

Thomas Durt

Finds and Results from the Swedish Cyprus Expedition: A Gender Perspective at the Medelhavsmuseet•Jan 1, 2005•0 citations

Generalized semiquantum secret-sharing schemes

Vlad Gheorghiu

We investigate quantum secret-sharing schemes constructed from ${[[n,k,\ensuremath{\delta}]]}_{D}$ nonbinary stabilizer quantum error-correcting codes with carrier qudits of prime dimension $D$. We provide a systematic way of determining the access structure, which completely determines the forbidden and intermediate structures. We then show that the information available to the intermediate structure can be fully described and quantified by what we call the information group, a subgroup of the Pauli group of $k$ qudits, and we employ this group structure to construct a method for hiding the information from the intermediate structure via twirling of the information group and sharing of classical bits between the dealer and the players. Our scheme allows for the transformation of a ramp (intermediate) quantum secret-sharing scheme into a semiquantum perfect secret-sharing scheme with the same access structure as the ramp one but without any intermediate subsets, and is optimal in the amount of classical bits the dealer has to distribute.

arXiv:1204.1072•Physical Review A•May 15, 2012•37 citations
For any m≥1m \ge 1m≥1 and odd prime power q=pm\mathtt{q}=\mathtt{p}^mq=pm, for q=2\mathtt{q}=2q=2, and for any n≥1n \ge 1n≥1, we show a result of decomposition for Pauli groups Pn,q\mathcal{P}_{n,\mathtt{q}}Pn,q​ in terms of weak central products. This can be used to describe the underlying structure of Pauli groups on nnn qudits of dimension q\mathtt{q}q and enables us to identify abelian subgroups of Pn,q\mathcal{P}_{n,\mathtt{q}}Pn,q​. As a consequence of our main results, we show a similar factorisation for the so--called `lifted' Pauli groups, recently introduced by Gottesman and Kuperberg in the context of error-correcting codes in quantum information theory.
Qudits with local dimension d>2 can have unique structure and uses that qubits ( d=2 ) cannot. Qudit Pauli operators provide a very useful basis of the space of qudit states and operators. We study the structure of the qudit Pauli group for any, including composite, d in several ways. To cover composite values of d , we work with modules over commutative rings, which generalize the notion of vector spaces over fields. For any specified set of commutation relations, we construct a set of qudit Paulis satisfying those relations. We also study the maximum size of sets of Paulis that mutually non-commute and sets that non-commute in pairs. Finally, we give methods to find near minimal generating sets of Pauli subgroups, calculate the sizes of Pauli subgroups, and find bases of logical operators for qudit stabilizer codes. Useful tools in this study are normal forms from linear algebra over commutative rings, including the Smith normal form, alternating Smith normal form, and Howell normal form of matrices. Possible applications of this work include the construction and analysis of qudit stabilizer codes, entanglement assisted codes, parafermion codes, and fermionic Hamiltonian simulation.
Galois qudits are qqq-dimensional quantum systems whose choice of Pauli group encodes the arithmetic of some finite field Fq\mathbb{F}_qFq​. They differ from the more familiar modular qudit, which are the same quantum system but whose choice of Pauli group are the clock and shift operators, which encode the arithmetic of integer addition and multiplication modulo qqq. Galois qudits are a useful mathematical construct that allow us to leverage the mathematical tools that are native to the larger qudit while only physically building smaller qudits. In particular, a Galois qudit of dimension q=2sq = 2^sq=2s is exactly the same thing as a collection of sss qubits, not only in its Hilbert space, but also in its Pauli group, and Clifford hierarchy. This formalism has found a lot of utility recently in constructing quantum error-correcting codes over qubits with useful properties. In this review, we build on existing literature to collect and formalise facts and proofs about Galois qudits over binary extension fields. We define them and their Clifford hierarchies, describe what it means to measure their Pauli operators, describe their stabiliser tableaux, formally define qudit-to-qubit mappings, and finally describe quantum Reed-Solomon codes.
We study the commutation relations within the Pauli groups built on all decompositions of a given Hilbert space dimension qqq, containing a square, into its factors. Illustrative low dimensional examples are the quartit (q=4q=4q=4) and two-qubit (q=22q=2^2q=22) systems, the octit (q=8q=8q=8), qubit/quartit (q=2×4q=2\times 4q=2×4) and three-qubit (q=23q=2^3q=23) systems, and so on. In the single qudit case, e.g. q=4,8,12,...q=4,8,12,...q=4,8,12,..., one defines a bijection between the σ(q)σ(q)σ(q) maximal commuting sets [with σ[q)σ[q)σ[q) the sum of divisors of qqq] of Pauli observables and the maximal submodules of the modular ring Zq2\mathbb{Z}_q^2Zq2​, that arrange into the projective line P1(Zq)P_1(\mathbb{Z}_q)P1​(Zq​) and a independent set of size σ(q)−ψ(q)σ(q)-ψ(q)σ(q)−ψ(q) [with ψ(q)ψ(q)ψ(q) the Dedekind psi function]. In the multiple qudit case, e.g. q=22,23,32,...q=2^2, 2^3, 3^2,...q=22,23,32,..., the Pauli graphs rely on symplectic polar spaces such as the generalized quadrangles GQ(2,2) (if q=22q=2^2q=22) and GQ(3,3) (if q=32q=3^2q=32). More precisely, in dimension pnp^npn (ppp a prime) of the Hilbert space, the observables of the Pauli group (modulo the center) are seen as the elements of the 2n2n2n-dimensional vector space over the field Fp\mathbb{F}_pFp​. In this space, one makes use of the commutator to define a symplectic polar space W2n−1(p)W_{2n-1}(p)W2n−1​(p) of cardinality σ(p2n−1)σ(p^{2n-1})σ(p2n−1), that encodes the maximal commuting sets of the Pauli group by its totally isotropic subspaces. Building blocks of W2n−1(p)W_{2n-1}(p)W2n−1​(p) are punctured polar spaces (i.e. a observable and all maximum cliques passing to it are removed) of size given by the Dedekind psi function ψ(p2n−1)ψ(p^{2n-1})ψ(p2n−1). For multiple qudit mixtures (e.g. qubit/quartit, qubit/octit and so on), one finds multiple copies of polar spaces, ponctured polar spaces, hypercube geometries and other intricate structures. Such structures play a role in the science of quantum information.
We connect the structure theorem for quasiprobability representations to quantum error correction. For a code space invariant under a subgroup of an extended Weyl-Heisenberg group, the Brif-Mann construction gives a semi-functorial representation whenever its kernel satisfies the Stratonovich-Weyl axioms, and composes on channels covering full error-correction cycles. With phase-space parity available, a kernel other than the ordinary Wigner one exists iff the code space is invariant under a lattice of displacements: among compact-phase-space bosonic codes, this is only the ideal Gottesman-Kitaev-Preskill family; in finite dimension, this is every qudit stabiliser code, whose negative volume for odd prime dimension is the syndrome-averaged logical magic. For rotation-symmetric, one-photon, non-Pauli qudit and spin codes only the ordinary kernel remains, its negativity reflecting the physical carrier, not logical content; a sector-graded representation built from recovery isometries restores a resource reading. We add a channel atlas, a closed-form magic lifetime under displacement noise, a Kirkwood-Dirac layer, and finite-energy corrections.
We investigate quantum secret-sharing schemes constructed from ${[[n,k,\ensuremath{\delta}]]}_{D}$ nonbinary stabilizer quantum error-correcting codes with carrier qudits of prime dimension DDD. We provide a systematic way of determining the access structure, which completely determines the forbidden and intermediate structures. We then show that the information available to the intermediate structure can be fully described and quantified by what we call the information group, a subgroup of the Pauli group of kkk qudits, and we employ this group structure to construct a method for hiding the information from the intermediate structure via twirling of the information group and sharing of classical bits between the dealer and the players. Our scheme allows for the transformation of a ramp (intermediate) quantum secret-sharing scheme into a semiquantum perfect secret-sharing scheme with the same access structure as the ramp one but without any intermediate subsets, and is optimal in the amount of classical bits the dealer has to distribute.