The Algebra for Stabilizer Codes

• URL: http://arxiv.org/abs/2304.10584v5
• Date: Wed, 11 Oct 2023 21:47:16 GMT
• Title: The Algebra for Stabilizer Codes
• Authors: Cole Comfort
• Abstract summary: In the language of the stabilizer formalism, full rank stabilizer tableaux are exactly the bases for affine Lagrangian subspaces. We show that by splitting the projector for a stabilizer code we recover the error detection protocol and the error correction protocol with affine classical processing power.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: There is a bijection between odd prime dimensional qudit pure stabilizer states modulo invertible scalars and affine Lagrangian subspaces of finite dimensional symplectic $\mathbb{F}_p$-vector spaces. In the language of the stabilizer formalism, full rank stabilizer tableaux are exactly the bases for affine Lagrangian subspaces. This correspondence extends to an isomorphism of props: the composition of stabilizer circuits corresponds to the relational composition of affine subspaces spanned by the tableaux, the tensor product corresponds to the direct sum. In this paper, we extend this correspondence between stabilizer circuits and tableaux to the mixed setting; regarding stabilizer codes as affine coisotropic subspaces (again only in odd prime qudit dimension/for qubit CSS codes). We show that by splitting the projector for a stabilizer code we recover the error detection protocol and the error correction protocol with affine classical processing power.

Related papers

• A streamlined demonstration that stabilizer circuits simulation reduces to Boolean linear algebra [0.0]
  Gottesman-Knill theorem states that computations on stabilizer circuits can be simulated on a classical computer. This note aims to make the connection between stabilizer circuits and Boolean linear algebra even more explicit.
  arXiv  Detail & Related papers  (2025-04-18T22:57:24Z)
• Wigner's Theorem for stabilizer states and quantum designs [0.6374763930914523]
  We describe the symmetry group of the stabilizer polytope for any number $n$ of systems and any prime local dimension $d$. In the qubit case, the symmetry group coincides with the linear and anti-linear Clifford operations. We extend an observation of Heinrich and Gross and show that the symmetries of fairly general sets of Hermitian operators are constrained by certain moments.
  arXiv  Detail & Related papers  (2024-05-27T18:00:13Z)
• Stabiliser codes over fields of even order [2.048226951354646]
  We describe stabiliser codes on n quqits with local dimension q=2h and binary stabiliser codes on hn qubits. A stabiliser code over a field of even order corresponds to a so-called quantum set of symplectic polar spaces.
  arXiv  Detail & Related papers  (2024-01-12T15:08:50Z)
• Bases for optimising stabiliser decompositions of quantum states [14.947570152519281]
  We introduce and study the vector space of linear dependencies of $n$-qubit stabiliser states. We construct elegant bases of linear dependencies of constant size three. We use them to explicitly compute the stabiliser extent of states of more qubits than is feasible with existing techniques.
  arXiv  Detail & Related papers  (2023-11-29T06:30:05Z)
• Quantum Subspace Correction for Constraints [3.977810072874835]
  We show that it is possible to construct operators that stabilize the constraint-satisfying subspaces of computational problems in their Ising representations. We also look at a potential use of quantum subspace correction for fault-tolerant depth-reduction.
  arXiv  Detail & Related papers  (2023-10-31T05:23:50Z)
• On the Stability of Expressive Positional Encodings for Graphs [46.967035678550594]
  Using Laplacian eigenvectors as positional encodings faces two fundamental challenges. We introduce Stable and Expressive Positional generalizations (SPE) SPE is the first architecture that is (1) provably stable, and (2) universally expressive for basis invariant functions.
  arXiv  Detail & Related papers  (2023-10-04T04:48:55Z)
• Unified Fourier-based Kernel and Nonlinearity Design for Equivariant Networks on Homogeneous Spaces [52.424621227687894]
  We introduce a unified framework for group equivariant networks on homogeneous spaces. We take advantage of the sparsity of Fourier coefficients of the lifted feature fields. We show that other methods treating features as the Fourier coefficients in the stabilizer subgroup are special cases of our activation.
  arXiv  Detail & Related papers  (2022-06-16T17:59:01Z)
• Semi-Supervised Subspace Clustering via Tensor Low-Rank Representation [64.49871502193477]
  We propose a novel semi-supervised subspace clustering method, which is able to simultaneously augment the initial supervisory information and construct a discriminative affinity matrix. Comprehensive experimental results on six commonly-used benchmark datasets demonstrate the superiority of our method over state-of-the-art methods.
  arXiv  Detail & Related papers  (2022-05-21T01:47:17Z)
• Fully non-positive-partial-transpose genuinely entangled subspaces [0.0]
  We provide a construction of multipartite subspaces that are not only genuinely entangled but also fully non-positive-partial-transpose (NPT) Our construction originates from the stabilizer formalism known for its use in quantum error correction.
  arXiv  Detail & Related papers  (2022-03-31T09:11:16Z)
• Sparse Quadratic Optimisation over the Stiefel Manifold with Application to Permutation Synchronisation [71.27989298860481]
  We address the non- optimisation problem of finding a matrix on the Stiefel manifold that maximises a quadratic objective function. We propose a simple yet effective sparsity-promoting algorithm for finding the dominant eigenspace matrix.
  arXiv  Detail & Related papers  (2021-09-30T19:17:35Z)
• Coordinate Independent Convolutional Networks -- Isometry and Gauge Equivariant Convolutions on Riemannian Manifolds [70.32518963244466]
  A major complication in comparison to flat spaces is that it is unclear in which alignment a convolution kernel should be applied on a manifold. We argue that the particular choice of coordinatization should not affect a network's inference -- it should be coordinate independent. A simultaneous demand for coordinate independence and weight sharing is shown to result in a requirement on the network to be equivariant.
  arXiv  Detail & Related papers  (2021-06-10T19:54:19Z)
• Square Root Bundle Adjustment for Large-Scale Reconstruction [56.44094187152862]
  We propose a new formulation for the bundle adjustment problem which relies on nullspace marginalization of landmark variables by QR decomposition. Our approach, which we call square root bundle adjustment, is algebraically equivalent to the commonly used Schur complement trick. We show in real-world experiments with the BAL datasets that even in single precision the proposed solver achieves on average equally accurate solutions.
  arXiv  Detail & Related papers  (2021-03-02T16:26:20Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.