Related papers: The geometry of non-additive stabiliser codes
New stabilizer codes with parameters better than the ones available in the literature are provided in this work, in particular quantum codes with parameters $[[127,63, \geq 12]]_2$ and $[[63,45, \geq 6]]_4$ that are records. These codes are…
We propose a systematic framework to construct a (d+1)-dimensional stabilizer model from an initial generic d-dimensional abelian symmetry. Our approach builds upon the iterative gauging procedure, developed by one of the authors in [J.…
Hybrid codes simultaneously encode both quantum and classical information, allowing for the transmission of both across a quantum channel. We construct a family of nonbinary error-detecting hybrid stabilizer codes that can detect one error…
This article provides an introduction to surface code quantum computing. We first estimate the size and speed of a surface code quantum computer. We then introduce the concept of the stabilizer, using two qubits, and extend this concept to…
We introduce a flexible and graphically intuitive framework that constructs complex quantum error correction codes from simple codes or states, generalizing code concatenation. More specifically, we represent the complex code constructions…
In this paper, we provide a general framework for counting geometric structures in pseudo-random graphs. As applications, our theorems recover and improve several results on the finite field analog of questions originally raised in the…
The geometric measure, the logarithmic robustness and the relative entropy of entanglement are proved to be equal for a stabilizer quantum codeword. The entanglement upper and lower bounds are determined with the generators of code. The…
We give an introduction to the theory of quantum error correction using stabilizer codes that is geared towards the working computer scientists and mathematicians with an interest in exploring this area. To this end, we begin with an…
The two-dimensional color code is an alternative to the toric code that encodes more logical qubits while maintaining crucial features of the $\mathbb{Z}_2\times\mathbb{Z}_2$ toric code in the long wavelength limit. However its short range…
We present a decoder for nonbinary CWS quantum codes using the structure of union codes. The decoder runs in two steps: first we use a union of stabilizer codes to detect a sequence of errors, and second we build a new code, called union…
We present a notion of geometry encoding suitable for machine learning-based numerical simulation. In particular, we delineate how this notion of encoding is different than other encoding algorithms commonly used in other disciplines such…
We use affine variety codes and their subfield-subcodes for obtaining quantum stabilizer codes via the CSS code construction. With this procedure, we get codes with good parameters and a code whose parameters exceed the CSS quantum…
In this paper we study the equivalence of quantum stabilizer codes via symplectic isometries of stabilizer codes. We define monomially and symplectically equivalent stabilizer codes and determine how different the two notions can be.…
We define linear and semilinear isometry for general subspace codes, used for random network coding. Furthermore, some results on isometry classes and automorphism groups of known constant dimension code constructions are derived.
Graphical designs are an extension of spherical designs to functions on graphs. We connect linear codes to graphical designs on cube graphs, and show that the Hamming code in particular is a highly effective graphical design. We show that…
We present a new application of multi-orbit cyclic subspace codes to construct large optical orthogonal codes, with the aid of the multiplicative structure of finite fields extensions. This approach is different from earlier approaches…
A new type of local-check additive quantum code is presented. Qubits are associated with edges of a 2-dimensional lattice whereas the stabilizer operators correspond to the faces and the vertices. The boundary of the lattice consists of…
We introduce a class of cyclic quantum codes, basing the construction not on the simplicity of the stabilizers, but rather on the simplicity of preparation of a code state (at least in the absence of noise). We show how certain known codes,…
Dynamical stabilizer codes (DSCs) have recently emerged as a powerful generalization of static stabilizer codes for quantum error correction, replacing a fixed stabilizer group with a sequence of non-commuting measurements. This dynamical…
A graph state and a graph code respectively are defined based on a mathematical simple graph. In this work, we examine a relation between a graph state and a graph code both obtained from the same graph, and show that a graph state is a…