Related papers: MDS Stabilizer Poset Codes
This paper studies the problem of stability of a parameterized delay differential equations (DDE see equation (0.1)). After discretizing the DDE (0.1), we show that the problem can be equivalently casted into a semi-definite programming…
We propose a systematic scheme for the construction of graphs associated with binary stabilizer codes. The scheme is characterized by three main steps: first, the stabilizer code is realized as a codeword-stabilized (CWS) quantum code;…
In this paper, we initiate the study of constant dimension subspace codes restricted to Schubert varieties, which we call Schubert subspace codes. These codes have a very natural geometric description, as objects that we call intersecting…
Surface codes are one of the most important topological stabilizer codes in the theory of quantum error correction. In this paper, we provide an efficient way to obtain surface codes through Measurement-based quantum computation (MBQC)…
Maximum distance separable (MDS) are constructed to required specifications. The codes are explicitly given over finite fields with efficient encoding and decoding algorithms. Series of such codes over finite fields with ratio of distance…
Codeword stabilized (CWS) codes are a general class of quantum codes that includes stabilizer codes and many families of non-additive codes with good parameters. For such a non-additive code correcting all t-qubit errors, we propose an…
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…
Large-scale quantum computation is likely to require massive quantum error correction (QEC). QEC codes and circuits are described via the stabilizer formalism, which represents stabilizer states by keeping track of the operators that…
We study the performance of common quantum stabilizer codes in the presence of asymmetric and correlated errors. Specifically, we consider the depolarizing noisy quantum memory channel and perform quantum error correction via the five and…
This paper investigates the relation between linear codes and the stabilizer in ${\rm GL}_2(\mathbb{C})$ of their weight enumerators. We prove a result on the finiteness of stabilizers and give a complete classification of linear codes with…
Multipartite entanglement is a natural generalization of bipartite entanglement, but is relatively poorly understood. In this paper, we develop tools to calculate a class of multipartite entanglement measures - known as multi-invariants -…
A brief review is given of some well-known and some very recent results obtained in studies of two- and three-dimensional (2D and 3D) solitons. Both zero-vorticity (fundamental) solitons and ones carrying vorticity S = 1 are considered.…
The main purpose of this paper is to investigate the stability problem of some functional equations that appear in the characterization problem of information measures.
Using the EXIT chart approach, a necessary and sufficient condition is developed for the local stability of iterative decoding of multi-edge type (MET) doubly-generalized low-density parity-check (D-GLDPC) code ensembles. In such code…
Cyclic orbit codes are constant dimension subspace codes that arise as the orbit of a cyclic subgroup of the general linear group acting on subspaces in the given ambient space. With the aid of the largest subfield over which the given…
A new geometric shaping technique, referred to as coset shaping, is proposed and analyzed for coded QAM and PAM signaling. This method can be applied to both information and parity bits without introducing additional complexity. It is shown…
The discovery of the family of balanced product codes was pivotal in the subsequent development of 'good' low density quantum error correcting codes that have optimal scaling of the key parameters of distance and storage density. We review…
We consider quantum MDS (QMDS) codes for quantum systems of dimension $q$ with lengths up to $q^2+2$ and minimum distances up to $q+1$. We show how starting from QMDS codes of length $q^2+1$ based on cyclic and constacyclic codes, new QMDS…
We propose the use of certain low-density generator-matrix (LDGM) codes as syndrome measurement (SM) codes for quantum low-density parity check (QLDPC) codes. We use an efficient progressive-edge-growth-like algorithm to create LDGM SM…
Color codes are topological stabilizer codes with unusual transversality properties. Here I show that their group of transversal gates is optimal and only depends on the spatial dimension, not the local geometry. I also introduce a…