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

arXiv:1705.04087 · Quantum Information Processing

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

Ryutaroh Matsumoto

Published Oct 23, 2017• 11 citations
arXivHTMLPDF

Abstract

In this note, we report two versions of Gilbert-Varshamov-type existential bounds for asymmetric quantum error-correcting codes.
DOI
10.1007/s11128-017-1748-y

Related papers

Improved Gilbert–Varshamov Bound for Entanglement-Assisted Asymmetric Quantum Error Correction by Symplectic Orthogonality

Ryutaroh Matsumoto

We propose and prove an existential theorem for entanglement-assisted asymmetric quantum error correction. Then, we demonstrate its superiority over the conventional one.

arXiv:2003.00668•IEEE Transactions on Quantum Engineering•Jan 1, 2020•6 citations

Improved Gilbert–Varshamov Bound for Entanglement-Assisted Asymmetric Quantum Error Correction by Symplectic Orthogonality

Ryutaro Yamashita

IEEE Transactions on Quantum Engineering•Apr 22, 2020•0 citations

Lee Weight for Nonbinary Quantum Error Correction

Ryutaroh Matsumoto

We propose the quantum Lee weight for quantum errors, provide a Gilbert-Varshamov type bound, and a code construction for the proposed weight.

arXiv:2105.12354•May 26, 2021•0 citations

QUANTUM SELF-DUAL CODES AND SYMMETRIC MATRICES

Vladimir D. Tonchev

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.

•Dec 1, 2000•0 citations

A Finite Gilbert–Varshamov Bound for Pure Stabilizer Quantum Codes

Kai Feng, Zhi Ma

A finite Gilbert-Varshamov (GV) bound for pure stabilizer (binary and nonbinary) quantum error correcting codes is presented in analogy to the GV bound for classical codes by using several enumerative results in finite unitary geometry. From this quantum GV bound we obtain several new binary quantum codes in a nonconstructive way having better parameters than the known codes.

IEEE Transactions on Information Theory•Nov 30, 2004•110 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