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:2105.12354

Lee Weight for Nonbinary Quantum Error Correction

Ryutaroh Matsumoto

Published May 26, 2021• 1 citation
arXivHTMLPDF

Abstract

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

Related papers

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

Nonbinary Quantum Goppa Codes Exceeding the Quantum Gilbert-Varshamov Bound

Annika Niehage

Quantum Information Processing•Dec 11, 2006•9 citations

Quantum Error Correction for Communication

ARTUR K. EKERT, Chiara Macchiavello

We show how procedures which can correct phase and amplitude errors are in themselves sufficient to correct errors due to quantum entanglement, generalizing earlier results. We specify general criteria for quantum error correction, introduce quantum versions of the Hamming and the Gilbert-Varshamov bounds, and comment on the practical implementations of quantum codes.

arXiv:quant-ph/9602022•Physical Review Letters•Sep 16, 1996•315 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

Finite-Degree Quantum LDPC Codes Reaching the Gilbert-Varshamov Bound

Kenta Kasai

•Jan 1, 2026•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•113 citations