Related papers: Quantum self-dual codes and symmetric matrices
We compute the code parameters for binary linear codes obtained by greedy constructing the parity check matrix. Then we show that these codes improve the Gilbert-Varshamov (GV) bound on the code size and rate. This result counter proves the…
We construct explicit algebraic geometry codes built from the Garcia-Stichtenoth function field tower beating the Gilbert-Varshamov bound for alphabet sizes at least 192. Messages are identied with functions in certain Riemann-Roch spaces…
We present several results on quantum codes over general alphabets (that is, in which the fundamental units may have more than 2 states). In particular, we consider codes derived from finite symplectic geometry assumed to have additional…
In this paper, we define dual codes over arbitrary finite rings with respect to arbitrary bilinear forms and provide a generalization of Hayden's theorem (Bridges, Hall, and Hayden, 1981). Building on this foundation, we introduce the…
Xu [Jianwei Xu, J. Phys. A: Math. Theor. 45 405304 (2012)] generalized geometric quantum discord [B.Dakic, V. Vedral, and C . Brukner, Phys. Rev. Lett. 105 190502 (2010)] to multipartite states and proposed the geometric global quantum…
We present two constructions for binary self-orthogonal codes. It turns out that our constructions yield a constructive bound on binary self-orthogonal codes. In particular, when the information rate R=1/2, by our constructive lower bound,…
In the present paper, we show that if the dimension of an arbitrary algebraic geometry code over a finite field of even characters is slightly less than half of its length, then it is equivalent to an Euclidean self-orthogonal code.…
Cumulative weight enumerators of random linear codes are introduced, their asymptotic properties are studied, and very sharp thresholds are exhibited; as a consequence, it is shown that the asymptotic Gilbert-Varshamov bound is a very sharp…
We prove that the natural isomorphism between GF(2^h) and GF(2)^h induces a bijection between stabiliser codes on n quqits with local dimension q=2^h and binary stabiliser codes on hn qubits. This allows us to describe these codes…
The Gilbert-Varshamov bound states that the maximum size A_2(n,d) of a binary code of length n and minimum distance d satisfies A_2(n,d) >= 2^n/V(n,d-1) where V(n,d) stands for the volume of a Hamming ball of radius d. Recently Jiang and…
Recent results of the authors on quantum bounded symmetric domains and quantum Harish-Chandra modules are expounded.
Gleason's 1970 theorem on weight enumerators of self-dual codes has played a crucial role for research in coding theory during the last four decades. Plenty of generalizations have been proved but, to our knowledge, they are all based on…
The recent article [arXiv:2307.12552] gave local topological order (LTO) axioms for a quantum spin system, showed they held in Kitaev's Toric Code and in Levin-Wen string net models, and gave a bulk boundary correspondence to describe bulk…
The Gilbert-Varshamov (GV) lower bound on the maximum cardinality of a q-ary code of length n with minimum Hamming distance at least d can be obtained by application of Turan's theorem to the graph with vertex set {0,1,..,q-1}^n in which…
Following a suggestion by Vafa, we present a quantum-mechanical model for S-duality symmetries observed in the quantum theories of fields, strings and branes. Our formalism may be understood as the topological limit of Berezin's metric…
We investigate stabilizer codes with carrier qudits of equal dimension $D$, an arbitrary integer greater than 1. We prove that there is a direct relation between the dimension of a qudit stabilizer code and the size of its corresponding…
We develop a geometric approach toward an interplay between a pair of quantum Schur algebras of arbitrary finite type. Then by Beilinson-Lusztig-MacPherson's stabilization procedure in the setting of partial flag varieties of type A (resp.…
Performing active quantum error correction to protect fragile quantum states highly depends on the correctness of error information--error syndromes. To obtain reliable error syndromes using imperfect physical circuits, we propose the idea…
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…
This paper has been withdrawn by the authors, due to a flaw in the proof of Theorem 1. This preprint is superseded by quant-ph/0610027, where a correct proof can be found. Thanks to Rainer Siegmund-Schultze for spotting the error.