Related papers: Constructive Conjugate Codes for Quantum Error Cor…
Quantum error correction is an important building block for reliable quantum information processing. A challenging hurdle in the theory of quantum error correction is that it is significantly more difficult to design error-correcting codes…
Several notions of code products are known in quantum error correction, such as hyper-graph products, homological products, lifted products, balanced products, to name a few. In this paper we introduce a new product code construction which…
Entanglement-assisted quantum error correcting codes (EAQECCs) are a simple and fundamental class of codes. They allow for the construction of quantum codes from classical codes by relaxing the duality condition and using pre-shared…
We study Algebraic Geometry codes producing quantum error-correcting codes by the CSS construction. We pay particular attention to the family of Castle codes. We show that many of the examples known in the literature in fact belong to this…
Symbol-pair code is a new coding framework which is proposed to correct errors in the symbol-pair read channel. In particular, maximum distance separable (MDS) symbol-pair codes are a kind of symbol-pair codes with the best possible…
Error-correcting codes and related combinatorial constructs play an important role in several recent (and old) results in computational complexity theory. In this paper we survey results on locally-testable and locally-decodable…
One central theme in quantum error-correction is to construct quantum codes that have a large minimum distance. In this paper, we first present a construction of classical codes based on certain class of polynomials. Through these classical…
Quantum replacer codes are codes that can be protected from errors induced by a given set of quantum replacer channels, an important class of quantum channels that includes the erasures of subsets of qubits that arise in quantum error…
Quantum synchronizable codes are kinds of quantum error-correcting codes that can not only correct the effects of quantum noise on qubits but also the misalignment in block synchronization. In this paper, the quantum synchronizable codes…
This paper introduces a new combinatorial construction for q-ary constant-weight codes which yields several families of optimal codes and asymptotically optimal codes. The construction reveals intimate connection between q-ary…
In this paper, we provide two methods of constructing quantum codes from linear codes over finite chain rings. The first one is derived from the Calderbank-Shor-Steane (CSS) construction applied to self-dual codes over finite chain rings.…
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…
CSS codes are a subfamily of stabilizer codes especially appropriate for fault-tolerant quantum computations. A very simple method is proposed to encode a general qudit when a Calderbank-Shor-Steane quantum code, defined over a q-ary…
CSS-T codes were recently introduced as quantum error-correcting codes that respect a transversal gate. A CSS-T code depends on a CSS-T pair, which is a pair of binary codes $(C_1, C_2)$ such that $C_1$ contains $C_2$, $C_2$ is even, and…
We address the problems of constructing quantum convolutional codes (QCCs) and of encoding them. The first construction is a CSS-type construction which allows us to find QCCs of rate 2/4. The second construction yields a quantum…
A subspace code is a nonempty collection of subspaces of the vector space $\mathbb{F}_q^{n}$. A pair of linear codes is called a linear complementary pair (in short LCP) of codes if their intersection is trivial and the sum of their…
In this paper, a linear $\ell$-intersection pair of codes is introduced as a generalization of linear complementary pairs of codes. Two linear codes are said to be a linear $\ell$-intersection pair if their intersection has dimension…
The importance of quantum error correction in paving the way to build a practical quantum computer is no longer in doubt. This dissertation makes a threefold contribution to the mathematical theory of quantum error-correcting codes.…
We investigate CSS and CSS-T quantum error-correcting codes from the point of view of their existence, rarity, and performance. We give a lower bound on the number of pairs of linear codes that give rise to a CSS code with good correction…
We introduce a purely graph-theoretical object, namely the coding clique, to construct quantum errorcorrecting codes. Almost all quantum codes constructed so far are stabilizer (additive) codes and the construction of nonadditive codes,…