相关论文: Quantum self-dual codes and symmetric matrices
Classical $(r,\delta)$-locally recoverable codes are designed for avoiding loss of information in large scale distributed and cloud storage systems. We introduce the quantum counterpart of those codes by defining quantum…
This is a generalization of the classic work of Beilinson, Lusztig and MacPherson. In this paper (and an Appendix) we show that the quantum algebras obtained via a BLM-type stabilization procedure in the setting of partial flag varieties of…
The following open problems, which concern a fundamental limit on coding properties of quantum codes with realistic physical constraints, are analyzed and partially answered here: (a) the upper bound on code distances of quantum…
One of the main objectives of quantum error-correction theory is to construct quantum codes with optimal parameters and properties. In this paper, we propose a class of 2-generator quasi-cyclic codes and study their applications in the…
Let $q$ be a prime power. Let $\lambda>1$ be a divisor of $q-1$, and let $\tau>1$ and $\rho>1$ be divisors of $q+1$. Under certain conditions we prove that there exists an MDS stabilizer quantum code with length $n=\lambda \tau \sigma$…
Following up on the recent work on lower Ricci curvature bounds for quantum systems, we introduce two noncommutative versions of curvature-dimension bounds for symmetric quantum Markov semigroups over matrix algebras. Under suitable such…
Mixed codes, which are error-correcting codes in the Cartesian product of different-sized spaces, model degrading storage systems well. While such codes have previously been studied for their algebraic properties (e.g., existence of perfect…
Proving the quantum Hamming bound for degenerate nonbinary stabilizer codes has been an open problem for a decade. In this note, I prove this bound for double error-correcting degenerate stabilizer codes. Also, I compute the maximum length…
We introduce homothetic-BCH codes. These are a family of $q^2$-ary classical codes $\mathcal{C}$ of length $\lambda n_1$, where $\lambda$ and $n_1$ are suitable positive integers such that the punctured code $\mathcal{B}$ of $\mathcal{C}$…
Additive codes and some nonadditive codes use the single and multiple invariant subspaces of the stabilizer G, respectively, to construct quantum codes, so the selection of the invariant subspaces is a key problem. In this paper, I provide…
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…
Quantum geometry is a differential geometry based on quantum mechanics. It is related to various transport and optical properties in condensed matter physics. The Zeeman quantum geometry is a generalization of quantum geometry including the…
The stabilizer formalism for quantum error-correcting codes has been, without doubt, the most successful at producing examples of quantum codes with strong error-correcting properties. In this paper, we discuss strong automorphism groups of…
We show that any stabilizer code over a finite field is equivalent to a graphical quantum code. Furthermore we prove that a graphical quantum code over a finite field is a stabilizer code. The technique used in the proof establishes a new…
We propose a covariant entropy bound in gravitational theories beyond general relativity (GR), using Wald-Jacobson-Myers entropy instead of Bekenstein-Hawking entropy. We first extend the proof of the bound known in 4-dimensional GR to…
While stabilizer tableaus have proven useful as a descriptive tool for additive quantum codes, they otherwise offer little guidance for concrete constructions or algorithm analysis. We introduce a representation of stabilizer codes as…
The Bell-Clauser-Horne-Shimony-Holt inequality can be used to show that no local hidden-variable theory can reproduce the correlations predicted by quantum mechanics (QM). It can be proved that certain QM correlations lead to a violation of…
Convolutional stabilizer codes promise to make quantum communication more reliable with attractive online encoding and decoding algorithms. This paper introduces a new approach to convolutional stabilizer codes based on direct limit…
The purpose of this paper is two-fold. First, we characterize the existence of binary self-orthogonal codes meeting the Griesmer bound by employing Solomon-Stiffler codes and some related residual codes. Second, using such a…
I show how applying a symplectic Gram-Schmidt orthogonalization to the normalizer of a quantum code gives a different way of determining the code's logical operators. This approach may be more natural in the setting where we produce a…