betaFeedback

WorksMathematics

Stabiliser codes over prime fields as weighted graphs and as quantum sets of lines

Abstract

We further develop the theory of quantum stabiliser codes and its links with graph theory and finite geometry. We prove that an [[n,k,d]]_p stabiliser code over a finite field with p elements, p prime, gives rise to a graph on n-k vertices together with two disjoint independent sets of size k. Its edges are weighted with elements of a finite field of size p. If k=0, such codes are known as graph states. Second, we view stabiliser codes as so-called quantum sets of lines in projective space, allowing us to determined their minimum distance geometrically. We describe two geometrical operations to obtain new quantum sets of lines from given quantum sets of lines. As an application, we list the number of stabiliser codes up to equivalence, for given small parameters.

Introduction

Stabiliser codes were introduced by Calderbank, Rains, Shor and Sloane [8] and Gottesman [14] independently. They are a special type of quantum error-correcting codes. A stabiliser code is a subspace QQ of a Hilbert space (Cq)⊗n(\mathbb{C}^{q})^{\otimes n} that is the intersection of the eigenspaces of eigenvalue one of an abelian subgroup SS of E⊗n\mathcal{E}^{\otimes n}, where E\mathcal{E} is a nice error basis. These codes are widely used in quantum error-correction, partly because it is often easier to work with the subgroup SS, rather than with a basis for the subspace QQ. In this article, we restrict ourselves to the case where qq is prime. In this case, the stabiliser formalism allows us to interpret the abelian subgroup SS as a classical additive code that is contained in its symplectic dual, see [2, 3, 8, 20].

One-dimensional binary stabiliser codes are called graphical states or graph states since they can be represented by a simple graph. Graph states have been well studied, see for example [1, 12, 16, 21]. There have been many proposals to use graphs to represent stabiliser codes of general dimension, including [18, 19, 21, 27].

In this article, we prove that an [[n,k,d]]p[[n,k,d]]_p stabiliser code over a prime field can be interpreted as a weighted graph on n+kn+k vertices containing two independent sets of size kk that induce a (non-weighted) matching. As far as we are aware, this equivalence has not been previously noted.

We go on to consider quantum sets of lines, sets of lines in projective space, associated to such a stabiliser code, from which it is possible to give a geometrical description of the minimum distance dd. These ideas are inspired by the work of Glynn, Gulliver, Maks and Gupta [15] and build on the generalisations of Ball, Centelles and Huber [3]. See also the work of Bierbrauer, Faina, Giulietti, Marcugini and Pambianco [6].

As an application, we present some tables on the number of stabiliser codes of dimension k=1k=1 and local dimension q=2q=2 (qubit) and q=3q=3 (qutrit), expanding on the known classifications for k=0k=0 and q=2q=2 by Danielsen and Parker [11] and k=0k=0 and q=3q=3 by Danielsen [10].

Preliminaries

Stabiliser formalism

Let Fp\mathbb{F}_p denote the finite field of order pp, where pp is prime. Consider the standard symplectic inner product on the vector space Fp2n\mathbb{F}_p^{2n} given by

⟨u,v⟩=∑i=1nuivn+i−viun+i.\langle\mathbf{u},\mathbf{v}\rangle=\sum_{i=1}^{n}u_i v_{n+i}-v_i u_{n+i}.

Given a subspace U⊆Fp2nU\subseteq\mathbb{F}_p^{2n}, let U⊥={v∈Fp2n:⟨u,v⟩=0 for all u∈U}U^\perp=\{\mathbf{v}\in\mathbb{F}_p^{2n}:\langle\mathbf{u},\mathbf{v}\rangle=0\text{ for all }\mathbf{u}\in U\}. A subspace UU is called totally isotropic if U⊆U⊥U\subseteq U^\perp. The symplectic weight of a vector v∈Fp2n\mathbf{v}\in\mathbb{F}_p^{2n} is defined as

swt⁡(v)=#{i∈{1,…,n}:(vi,vn+i)≠(0,0)}.\operatorname{swt}(\mathbf{v})=\#\{i\in\{1,\ldots,n\}:(v_i,v_{n+i})\ne(0,0)\}.

Definition 1. An [[n,k]]p[[n,k]]_p stabiliser code is a totally isotropic subspace SS of Fp2n\mathbb{F}_p^{2n} of dimension n−kn-k. The minimum distance of SS is

d(S)={min⁡{swt⁡(v):v∈S⊥∖S}if k>0,min⁡{swt⁡(v):v∈S∖{0}}if k=0.d(S)= \begin{cases} \min\{\operatorname{swt}(\mathbf{v}):\mathbf{v}\in S^\perp\setminus S\} & \text{if } k>0,\\ \min\{\operatorname{swt}(\mathbf{v}):\mathbf{v}\in S\setminus\{\mathbf{0}\}\} & \text{if } k=0. \end{cases}

If the minimum distance dd is specified, we call SS an [[n,k,d]]p[[n,k,d]]_p code.

Definition 2. A stabiliser matrix of an [[n,k]]p[[n,k]]_p stabiliser code SS is an (n−k)×2n(n-k)\times2n matrix whose rows form a basis of SS. A parity check matrix4 of an [[n,k]]p[[n,k]]_p stabiliser code SS is an (n+k)×2n(n+k)\times2n matrix whose rows form a basis of S⊥S^\perp.

We denote a stabiliser matrix by GG and a parity check matrix by HH.

Equivalent stabiliser codes

Definition 3. Two stabiliser codes are (local Clifford) equivalent if they can be obtained from one another by:

  1. Permutations of the nn pairs of positions.

  1. For each pair, a symplectic transformation on that pair. That is, a change of basis of Fp2\mathbb{F}_p^2 that preserves the symplectic inner product.

The maps yielding equivalence are the elements of the local Clifford group Sp⁡(2,p)n⋊Sym⁡(n)\operatorname{Sp}(2,p)^n \rtimes\operatorname{Sym}(n). For example, for a given i∈{1,…,n}i \in\{1,\ldots,n\}, we can replace (vi,vn+i)(v_i,v_{n+i}) by (vn+i,−vi)(v_{n+i},-v_i) within every vector v\mathbf{v}. Another possibility is to replace (vi,vn+i)(v_i,v_{n+i}) by (vi+vn+i,vn+i)(v_i+v_{n+i},v_{n+i}) within every vector v\mathbf{v}. These two operations are in fact enough to generate the whole group of symplectic transformations, since Sp⁡(2,p)=SL⁡(2,p)\operatorname{Sp}(2,p)=\operatorname{SL}(2,p) is generated as a multiplicative group by all products of the matrices

(0−110)and(1011).\begin{pmatrix} 0 & -1 \\ 1 & 0 \end{pmatrix} \quad\text{and}\quad \begin{pmatrix} 1 & 0 \\ 1 & 1 \end{pmatrix}.

Equivalent codes have the same parameters.

Stabiliser codes as graphs

A particular type of one-dimensional (k=0k=0) stabiliser codes are graph states. Given a graph on nn vertices, we can construct from it a stabiliser matrix that has the identity matrix on the left and the adjacency matrix AA of the graph on the right:

G=(In∣A).G=\left(I_n\mid A\right).

Bahramgiri and Beigi [5] proved that every [ ⁣[n,0] ⁣]p[\![n,0]\!]_p stabiliser code, pp prime, is equivalent to a graph state. This was proved already by Schlingemann [22] for the binary case. We generalise this result to multidimensional (k≥1k\geq1) stabiliser codes.

Multidimensional graph states

Theorem 4. Consider an [ ⁣[n,k,d] ⁣]p[\![n,k,d]\!]_p stabiliser code and let r=n−kr=n-k. Up to equivalence, its stabiliser matrix has the form

G=(Ir∣B∣A+BCT∣C)G=\left(I_r\mid B\mid A+BC^T\mid C\right)

where AA is a symmetric r×rr\times r matrix with zeroes on the diagonal and BB and CC are r×kr\times k matrices.

Proof. After row reduction and permutations of pairs of columns, we may assume that the code has stabiliser matrix

G=(Ir′BDCOOEO),G=\begin{pmatrix} I_{r'} & B & D & C \\ O & O & E & O \end{pmatrix},

for some r′≤rr'\leq r. Here, the part below CC may be assumed zero, since otherwise we can swap the columns containing BB and CC and increase the rank r′r' of the left part. The rowspace of GG is symplectic self-orthogonal if and only if GΛGT=OG\Lambda G^T=O where

Λ=(OIn−InO).\Lambda=\begin{pmatrix} O & I_n \\ -I_n & O \end{pmatrix}.

Thus,

O=GΛGT=(Ir′BDCOOEO)(DTETCTO−Ir′O−BTO)=(DT+BCT−D−CBTET−EO).O=G\Lambda G^T= \begin{pmatrix} I_{r'} & B & D & C \\ O & O & E & O \end{pmatrix} \begin{pmatrix} D^T & E^T \\ C^T & O \\ -I_{r'} & O \\ -B^T & O \end{pmatrix} = \begin{pmatrix} D^T+BC^T-D-CB^T & E^T \\ -E & O \end{pmatrix}.

We deduce that E=OE=O, and hence r′=rr'=r, and that A=ATA=A^T, where A=D−BCTA=D-BC^T. Finally, we can replace any non-zero elements on the diagonal of the matrix AA by zero, by adding the iith column to the (n+i)(n+i)th column if needed (preserving the symplectic inner product of rows). ∎

More explicitly, we can always put the stabiliser matrix in the form

References

  1. [1]S. Anders and H.J. Briegel, Fast simulation of stabilizer circuits using a graph state representation, Phys. Rev. A, 73 (2006) 022334.DOI
  2. [2]A. Ashikhmin and E. Knill, Nonbinary quantum stabilizer codes, IEEE Trans. Inf. Theory 47 (2001) no. 7, 3065–3072.DOI
  3. [3]S. Ball, A. Centelles and F. Huber, Quantum error-correcting codes and their geometries, Ann. Inst. Henri Poincare D, 10 (2023) 337–405.DOI
  4. [4]S. Ball, E. Moreno and R. Simoens, Stabiliser codes over fields of even order, IEEE Trans. Inf. Theory 71 (2025) 3707–3718.arxiv.org/abs/2401.06618
  5. [5]M. Bahramgiri and S. Beigi, Graph States Under the Action of Local Clifford Group in Non-Binary Case, arXiv:quant-ph/0610267 (2006).arxiv.org/abs/quant-ph/0610267
  6. [6]J. Bierbrauer, G. Faina, M. Giulietti, S. Marcugini and F. Pambianco, The geometry of quantum codes, Innov. Incidence Geom. 6+7 (2008) no. 1, 53–71.DOI
  7. [7]A.R. Calderbank and P. Shor, Good quantum error-correcting codes exist, Phys. Rev. A, 54 (1996) 1098–1105.pubmed.ncbi.nlm.nih.gov/9913578
  8. [8]A.R. Calderbank, E.M. Rains, P.W. Shor, and N. Sloane, Quantum error correction via codes over GF(4), IEEE Trans. Inf. Theory, 44 (1998) 1369–1387.
  9. [9]N. Claudet and S. Perdix, Local equivalence of stabilizer states: a graphical characterisation, arXiv:2409.20183 (2025).DOI
  10. [10]L.E. Danielsen. Graph-based classification of self-dual additive codes over finite fields. Adv. Math. Commun. 3 (2009), no. 4, 329–348.
  11. [11]L.E. Danielsen and M.G. Parker, On the classification of all self-dual additive codes over GF(4) of length up to 12, J. Comb. Theory A 113 (2006), Issue 7, 1351–1367.
  12. [12]M.B. Elliot, Stabilizer states and local realism, PhD Thesis, University of New Mexico, USA (2008).
  13. [13]T. Feulner. The Automorphism Groups of Linear Codes and Canonical Representatives of Their Semilinear Isometry Classes. Advances in Mathematics of Communications 3 (2009) no.4, 363–383.DOI
  14. [14]D. Gottesman, Class of quantum error-correcting codes saturating the quantum Hamming bound, Phys. Rev. A 54 (1996) 1862–1868.
  15. [15]D.G. Glynn, T.A. Gulliver, J.G. Maks and M.K. Gupta, The Geometry of Additive Quantum Codes, unpublished manuscript (available online at https://www.academia.edu/17980449).
  16. [16]M. Hein, J. Eisert and H.J. Briegel, Multi-party entanglement in graph states, Phys. Rev. A, 69 (2004) 062311.
  17. [17]M. Heinrich, On stabiliser techniques and their application to simulation and certification of quantum devices, University of Cologne, PhD Thesis (2021).
  18. [18]A.T. Hu and A.B. Khesin, Improved graph formalism for quantum circuit simulation, Phys. Rev. A, 105 (2022) 022432.DOI
  19. [19]T. McElvanney and M. Backens, Complete flow-preserving rewrite rules for mbqc patterns with pauli measurements, arXiv:2205.02009 (2022).DOI
  20. [20]A. Ketkar, A. Klappenecker, S. Kumar and P.K. Sarvepalli, Nonbinary stabilizer codes over finite fields, IEEE Trans. Inf. Theory, 52 (2006) 4892–4914.arxiv.org/abs/quant-ph/0508070
  21. [21]A.B. Khesin, J. Lu and P. Shor, Universal graph representation of stabilizer codes, arXiv:2411.14448v3 (2025).DOI
  22. [22]D. Schlingemann, Stabilizer codes can be realized as graph codes, Quantum Inf. Comput. 2 (2002) no. 4, 307–323.DOI
  23. [23]M. Van den Nest, J. Dehaene and B. De Moor, Graphical description of the action of local Clifford transformations on graph states, Phys. Rev. A, 69 (2004), no. 2, 022316.DOI
  24. [24]The Sage Developers, SageMath, the Sage Mathematics Software System (Version 10.1), https://www.sagemath.org.
  25. [25]A.M. Steane. Simple quantum error correcting codes, Phys. Rev. Lett. 77 (1996) 793–797.DOI
  26. [26]L. Vandré, J. de Jong, F. Hahn, A. Burchardt, O. Gühne, A. Pappa, Distinguishing graph states by the properties of their marginals, arXiv:2406.09956 (2025).DOI
  27. [27]S. Yu, Q. Chen, and C. H. Oh, Graphical quantum error-correcting codes, arXiv:0709.1780 (2007).arxiv.org/abs/0709.1780

Paper details

vlnc:W_tddgqekh
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…
Contents