Related papers: A new approach to codeword stabilized quantum code…
In this paper we estimate the fidelity of stabilizer and CSS codes. First, we derive a lower bound on the fidelity of a stabilizer code via its quantum enumerator. Next, we find the average quantum enumerators of the ensembles of finite…
While stabilizer tableaus have proven exceptionally useful as a descriptive tool for additive quantum codes, they offer little guidance for concrete constructions or coding algorithm analysis. We introduce a representation of stabilizer…
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 define and show how to construct nonbinary quantum stabilizer codes. Our approach is based on nonbinary error bases. It generalizes the relationship between selforthogonal codes over $GF_{4}$ and binary quantum codes to one between…
We consider the CSS algorithm relating self-orthogonal classical linear codes to q-ary quantum stabilizer codes and we show that to such a pair of a classical and a quantum code one can associate geometric spaces constructed using methods…
In this paper we investigate the encoding of operator quantum error correcting codes i.e. subsystem codes. We show that encoding of subsystem codes can be reduced to encoding of a related stabilizer code making it possible to use all the…
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…
Quantum synchronizable codes are quantum error-correcting codes that can correct the effects of quantum noise as well as block synchronization errors. We improve the previously known general framework for designing quantum synchronizable…
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…
This paper unites two research lines. The first involves finding categorical models of quantum programming languages and their type systems. The second line concerns the program of quantization of mathematical structures, which amounts to…
In this paper, we try to generalise quantum stabilizer formalism to any composite system, that is, it includes not only composite systems of equal dimensions, but also composite systems of unequal dimensions.
Stabilizer codes are the most widely studied class of quantum error-correcting codes and form the basis of most proposals for a fault-tolerant quantum computer. A stabilizer code is defined by a set of parity-check operators, which are…
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…
We give an overview of moduli stabilization in compactifications of string theory. We summarize current methods for construction and analysis of vacua with stabilized moduli, and we describe applications to cosmology and particle physics.…
We present a general framework of quantum error-correcting codes (QECCs) as a subspace of a complex Hilbert space and the corresponding error models. Then we illustrate how QECCs can be constructed using techniques from algebraic coding…
Recently, operator quantum error-correcting codes have been proposed to unify and generalize decoherence free subspaces, noiseless subsystems, and quantum error-correcting codes. This note introduces a natural construction of such codes in…
In previous work, we have shown that pseudocodewords can be used to characterize the behavior of decoders not only for classical codes but also for quantum stabilizer codes. With the insights obtained from this pseudocodewords-based…
Using the notion of generalized weight we improve estimates on the parameters of quantum codes obtained by Steane's construction from binary codes. This yields several new families of quantum codes.
We study general maps from the space of rational CFTs with a fixed chiral algebra and associated Chern-Simons (CS) theories to the space of qudit stabilizer codes with a fixed generalized Pauli group. We consider certain natural constraints…
One formidable difficulty in quantum communication and computation is to protect information-carrying quantum states against undesired interactions with the environment. In past years, many good quantum error-correcting codes had been…