Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

QUANTUM SELF-DUAL CODES AND SYMMETRIC MATRICES

Vladimir D. Tonchev

Published Dec 1, 2000• 0 citations
Publisher

Abstract

It is proved that a subclass of self-dual quantum-error-correcting codes of length n obtained from binary linear codes of length 2n defined by symmetric matrices, contains codes that meet the Gilbert-Varshamov bound.
DOI
10.1142/9789812791962_0012

Related papers

A Varshamov-Gilbert bound for a class of formally self-dual codes and related quantum codes

Vladimir D. Tonchev

It is proved that a class of q-ary (2n,n) formally self-dual codes obtained from symmetric matrices over GF (q), contains codes that meet the Varshamov-Gilbert bound. The codes are self-dual with respect to the symplectic inner product and yield quantum codes encoding one state with n q-ary qubits and having minimum distance proportional to n.

IEEE Transactions on Information Theory•Apr 1, 2002•2 citations

Quantum self-dual codes and symmetric matrices

Vladimir D. Tonchev

This paper has been withdrawn since a Gilbert-Varshamov bound for general quantum codes has already appeared in Ekert and Macchiavello, Prys. Rev. Lett. 77, p. 2585, and a Gilbert-Varshamov bound for stabilizer codes connected with orthogonal geometry, or equivalently, with symmetric matrices as in this paper, has been proved by Calredbank, Rains, Shor and Sloane, Phys. Rev. Lett. 78, p. 405. I would like to thank Robert Calderbank for pointing out these references to me.

arXiv:quant-ph/9711047•Nov 20, 1997•0 citations

Symmetric matrices and quantum codes

Vladimir D. Tonchev

This paper has been withdrawn since a Gilbert-Varshamov bound for general quantum codes has already appeared in Ekert and Macchiavello, Prys. Rev. Lett. 77, p. 2585, and a Gilbert-Varshamov bound for stabilizer codes connected with orthogonal geometry, or equivalently, with symmetric matrices as in this paper, has been proved by Calredbank, Rains, Shor and Sloane, Phys. Rev. Lett. 78, p. 405. I would like to thank Robert Calderbank for pointing out these references to me.

arXiv:alg-geom/9711026•Nov 20, 1997•0 citations

Good self-dual quasi-cyclic codes exist

San Ling, Patrick Solé

We show that there are long binary quasi-cyclic self-dual (either Type I or Type II) codes satisfying the Gilbert-Varshamov bound.

IEEE Transactions on Information Theory•Apr 1, 2003•73 citations

Two Gilbert–Varshamov-type existential bounds for asymmetric quantum error-correcting codes

Ryutaroh Matsumoto

In this note, we report two versions of Gilbert-Varshamov-type existential bounds for asymmetric quantum error-correcting codes.

arXiv:1705.04087•Quantum Information Processing•Oct 23, 2017•11 citations

Quantum error-correcting codes from matrix-product codes related to quasi-orthogonal and quasi-unitary matrices

Cao, Meng

Matrix-product codes over finite fields are an important class of long linear codes by combining several commensurate shorter linear codes with a defining matrix over finite fields. The construction of matrix-product codes with certain self-orthogonality over finite fields is an effective way to obtain good $q$-ary quantum codes of large length. This article has two purposes: the first is to summarize some results of this topic obtained by the author of this article and his cooperators in [10-12]; the second is to add some new results on quasi-orthogonal matrices (resp. quasi-unitary matrices), Euclidean dual-containing (resp. Hermitian dual-containing) matrix-product codes and $q$-ary quantum codes derived from these matrix-product codes.

arXiv:2012.15691•Dec 31, 2020•0 citations
Matrix-product codes over finite fields are an important class of long linear codes by combining several commensurate shorter linear codes with a defining matrix over finite fields. The construction of matrix-product codes with certain self-orthogonality over finite fields is an effective way to obtain good qqq-ary quantum codes of large length. This article has two purposes: the first is to summarize some results of this topic obtained by the author of this article and his cooperators in [10-12]; the second is to add some new results on quasi-orthogonal matrices (resp. quasi-unitary matrices), Euclidean dual-containing (resp. Hermitian dual-containing) matrix-product codes and qqq-ary quantum codes derived from these matrix-product codes.