相关论文: Stabilizer quantum codes from $J$-affine variety c…
In [Phys. Rev. A 58, 1833 (1998)] a family of polynomial invariants which separate the orbits of multi-qubit density operators $\rho$ under the action of the local unitary group was presented. We consider this family of invariants for the…
Rate-(n-2)/n unrestricted and CSS-type quantum convolutional codes with up to 4096 states and minimum distances up to 10 are constructed as stabilizer codes from classical self-orthogonal rate-1/n F_4-linear and binary linear convolutional…
This paper proposes new propagation rules on quantum codes in the entanglement-assisted and in quantum subsystem scenarios. The rules lead to new families of such quantum codes whose parameters are demonstrably optimal. To obtain the…
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…
Using the Weyl commutation relations over a finite field we introduce a family of error-correcting quantum stabilizer codes based on a class of symmetric matrices over the finite field satisfying certain natural conditions. When the field…
The CSS code construction is a powerful framework used to express features of a quantum code in terms of a pair of underlying classical codes. Its subsystem extension allows for similar expressions, but the general case has not been fully…
We use multidimensional circulant approach to construct new qutrit stabilizer $\dsb{\ell, 0, d}$ codes with parameters $(\ell, d) \in \{(51, 16), (52, 16), (54, 17), (55, 17), (57, 17)\}$ through symplectic self-dual additive codes over…
With respect to the transversal gate group (an invariant of quantum codes), we demonstrate that non-additive codes can outperform stabilizer codes. We do this by constructing spin codes that correspond to permutation-invariant multiqubit…
We introduce a new class of evaluation linear codes by evaluating polynomials at the roots of a suitable trace function. We give conditions for self-orthogonality of these codes and their subfield-subcodes with respect to the Hermitian…
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…
The entanglement-assisted stabilizer formalism can transform arbitrary classical linear codes into entanglement-assisted quantum error correcting codes (EAQECCs). In this work, we construct some new entanglement-assisted quantum MDS…
Quantum states are very delicate, so it is likely some sort of quantum error correction will be necessary to build reliable quantum computers. The theory of quantum error-correcting codes has some close ties to and some striking differences…
We construct new families of multi-error-correcting quantum codes for the amplitude damping channel. Our key observation is that, with proper encoding, two uses of the amplitude damping channel simulate a quantum erasure channel. This…
Quantum error-correcting codes are used to protect quantum information from decoherence. A raw state is mapped, by an encoding circuit, to a codeword so that the most likely quantum errors from a noisy quantum channel can be removed after a…
In this paper, we examine algebraic geometric (AG) codes associated with curves generated by separated polynomials, and we create AG codes and quantum stabilizer codes from these curves by varying their parameters. Our research involves a…
In this work, we explore a new approach to designing both algorithms and error detection codes for preparing approximate ground states of molecules. We propose a classical algorithm to find the optimal stabilizer state by using excitations…
The surface code is a two-dimensional stabiliser code with parameters $[[n,1,\Theta(\sqrt{n})]]$. To this day, no stabiliser code with growing distance is know to live in less than two dimensions. In this note we show that no such code can…
Up to now every good quantum error-correcting code discovered has had the structure of an eigenspace of an Abelian group generated by tensor products of Pauli matrices; such codes are known as stabilizer or additive codes. In this letter we…
Coherent errors, which arise from collective couplings, are a dominant form of noise in many realistic quantum systems, and are more damaging than oft considered stochastic errors. Here, we propose integrating stabilizer codes with…
We extend the stabilizer formalism to a class of non-additive quantum codes which are constructed from non-linear classical codes. As an example, we present infinite families of non-additive codes which are derived from Goethals and…