相关论文: Nonbinary stabilizer codes over finite fields
Generalized bicycle (GB) codes is a class of quantum error-correcting codes constructed from a pair of binary circulant matrices. Unlike for other simple quantum code ans\"atze, unrestricted GB codes may have linear distance scaling. In…
We present several results on quantum codes over general alphabets (that is, in which the fundamental units may have more than 2 states). In particular, we consider codes derived from finite symplectic geometry assumed to have additional…
We show that within any quantum stabilizer code there lurks a classical binary linear code with similar error-correcting capabilities, thereby demonstrating new connections between quantum codes and classical codes. Using this result --…
Stabilizer codes obtained via CSS code construction and Steane's enlargement of subfield-subcodes and matrix-product codes coming from generalized Reed-Muller, hyperbolic and affine variety codes are studied. Stabilizer codes with good…
In quantum coding theory, stabilizer codes are probably the most important class of quantum codes. They are regarded as the quantum analogue of the classical linear codes and the properties of stabilizer codes have been carefully studied in…
This paper proposes a new family of recursive systematic convolutional codes, defined in the non-binary domain over different Galois fields GF(q) and intended to be used as component codes for the design of non-binary turbo codes. A general…
Quantum codes are subspaces of the state space of a quantum system that are used to protect quantum information. Some common classes of quantum codes are stabilizer (or additive) codes, non-stabilizer (or non-additive) codes obtained from…
The stabilizer code is the most general algebraic construction of quantum error-correcting codes proposed so far. A stabilizer code can be constructed from a self-orthogonal subspace of a symplectic space over a finite field. We propose a…
We classify mobile Pauli stabilizer codes up to gapped interfaces and coarse-graining using the framework of algebraic $\mathrm{L}$-theory. We compare this classification with that of framed TQFTs, theories that arise naturally in the…
We prove that the natural isomorphism between GF(2^h) and GF(2)^h induces a bijection between stabiliser codes on n quqits with local dimension q=2^h and binary stabiliser codes on hn qubits. This allows us to describe these codes…
Linear codes over finite rings become one of hot topics in coding theory after Hommons et al.([4], 1994) discovered that several remarkable nonlinear binary codes with some linear-like properties are the images of Gray map of linear codes…
We study, by means of the stabilizer formalism, a quantum error correcting code which is alternative to the standard block codes since it embeds a qubit into a qudit. The code exploits the non-commutative geometry of discrete phase space to…
We generalize the construction of Narain conformal field theories (CFTs) from qudit stabilizer codes to the construction from quantum stabilizer codes over the finite field of prime power order ($\mathbb{F}_{p^m}$ with $p$ prime and $m\geq…
We present a family of quantum stabilizer codes using the structure of duadic constacyclic codes over $\mathbb{F}_4$. Within this family, quantum codes can possess varying dimensions, and their minimum distances are lower bounded by a…
Quantum error correction and the use of quantum error correction codes is likely to be essential for the realisation of practical quantum computing. Because the error models of quantum devices vary widely, quantum codes which are tailored…
Protecting information in systems that have more than two basis states (qudits) not only offers a promising route for reducing the number of individual quantum locations that must be protected, while more accurately reflecting the structure…
In this paper, we show how to construct non-binary entanglement-assisted stabilizer quantum codes by using pre-shared entanglement between the sender and receiver. We also give an algorithm to determine the circuit for non-binary…
Low check weight is practically crucial code property for fault-tolerant quantum computing, which underlies the strong interest in quantum low-density parity-check (qLDPC) codes. Here, we explore the theory of weight-constrained stabilizer…
Subsystem codes protect quantum information by encoding it in a tensor factor of a subspace of the physical state space. Subsystem codes generalize all major quantum error protection schemes, and therefore are especially versatile. This…
This paper characterizes Goppa codes of certain maximal curves over finite fields defined by equations of the form $y^n = x^m + x$. We investigate Algebraic Geometric and quantum stabilizer codes associated with these maximal curves and…