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:2003.00668 · IEEE Transactions on Quantum Engineering

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

Ryutaroh Matsumoto

Published Jan 1, 2020• 6 citations
arXivHTMLPDF

Abstract

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

Related papers

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

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 Gilbert-Varshamov bound through symplectic self-orthogonal codes

Lingfei Jin, Chaoping Xing

It is well known that quantum codes can be constructed through classical symplectic self-orthogonal codes. In this paper, we give a kind of Gilbert-Varshamov bound for symplectic self-orthogonal codes first and then obtain the Gilbert-Varshamov bound for quantum codes. The idea of obtaining the Gilbert-Varshamov bound for symplectic self-orthogonal codes follows from counting arguments.

arXiv:1308.3578•IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2011•16 citations

Entanglement-assisted quantum error-correcting codes over arbitrary finite fields

Carlos Galindo, Fernando Hernando, Ryutaroh Matsumoto +1 more

We prove that the known formulae for computing the optimal number of maximally entangled pairs required for entanglement-assisted quantum error-correcting codes (EAQECCs) over the binary field hold for codes over arbitrary finite fields as well. We also give a Gilbert-Varshamov bound for EAQECCs and constructions of EAQECCs coming from punctured self-orthogonal linear codes which are valid for any finite field.

•Jan 1, 2019•23 citations

Entanglement-assisted quantum error-correcting codes over arbitrary finite fields

Carlos Galindo, Fernando Hernando, Ryutaroh Matsumoto +1 more

Abstract We prove that the known formulae for computing the optimal number of maximally entangled pairs required for entanglement-assisted quantum error-correcting codes (EAQECCs) over the binary field hold for codes over arbitrary finite fields as well. We also give a Gilbert–Varshamov bound for EAQECCs and constructions of EAQECCs coming from punctured self-orthogonal linear codes which are valid for any finite field.

arXiv:1812.05312•Quantum Information Processing•Mar 4, 2019•108 citations

Error Correction in Quantum Communication

ARTUR K. EKERT, Chiara Macchiavello

We show how procedures which can correct phase and amplitude errors can be directly applied to correct errors due to quantum entanglement. We specify general criteria for quantum error correction, introduce quantum versions of the Hamming and the Gilbert-Varshamov bounds and comment on the practical implementation of quantum codes.

arXiv:quant-ph/9602022•Feb 29, 1996•41 citations