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

Designs Codes and Cryptography

Entanglement-assisted quantum error-correcting codes using matrix-product codes

Meng Cao, Fuchuan Wei, Gaojun Luo

Published Jul 9, 2025• 8 citations
Publisher
DOI
10.1007/s10623-025-01685-x

Related papers

Entanglement-assisted quantum error-correcting codes based on the circulant permutation matrix.

Mihoko Wada, Keisuke Kodaira, Tomoharu Shibuya

International Symposium on Information Theory and its Applications•Jan 1, 2014•3 citations

Entanglement-Assisted Quantum Error-Correcting Codes

Igor Devetak, Todd A. Brun, Min-Hsiu Hsieh

New Trends in Mathematical Physics•Jan 1, 2009•22 citations

Classical Codes and Quantum Codes Involving the σ Inner Product

Meng Cao, Yang Li, Shixin Zhu

In 2019, Carletet al. introduced the concept of σ duals of linear codes involving the σ inner product, which generalizes the Euclidean, Hermitian and ℓ-Galois cases. This paper focuses on constructing new and improved classical codes and quantum codes within the framework of the σ inner product. We derive some general properties of linear codes, including matrix-product (MP) codes, with respect to the σ inner product. We develop general methods and design effective routes involving certain optimization problems for constructing σ self-orthogonal (SO) and σ dual-containing (DC) MP codes. Our schemes efficiently generate numerous such codes with new or optimal parameters. We establish the σ construction of quantum stabilizer codes from classical codes. We propose a unified method for constructing two general classes of entanglement-assisted quantum error-correcting codes (EAQECCs) based on the σ hulls of general linear codes. This further yields six types of EAQECCs with flexible parameters based on propagation rules using MP codes under the Euclidean and Hermitian cases. Compared to the best-known ternary EAQECCs, we obtain 17 new ones and 13 of them have improved parameters. Finally, we present two infinite families of q-ary EAQECCs with lengths (q2− 1)(q+ 2) andq2(q+2), respectively. These families include many q-ary QECCs that are not only new according to Grassl’s online database but also surpass those listed in Edel’s online database.

IEEE Transactions on Information Theory•Jul 31, 2025•3 citations

Steane enlargement of entanglement-assisted quantum error-correcting codes

Carlos Galindo, Fernando Hernando, Ryutaroh Matsumoto

Abstract We introduce a Steane-like enlargement procedure for entanglement-assisted quantum error-correcting codes (EAQECCs) obtained by considering Euclidean inner product. We give formulae for the parameters of these enlarged codes and apply our results to explicitly compute the parameters of enlarged EAQECCs coming from some BCH codes.

arXiv:2303.03079•Computational and Applied Mathematics•Aug 7, 2023•0 citations

Entanglement-assisted quantum codes from matrix-product codes

Xiusheng Liu, Hualu Liu, Long Yu

Quantum Information Processing•May 4, 2019•33 citations

An algorithmic approach to entanglement-assisted quantum error-correcting codes from the Hermitian curve

René Bødker Christensen, Carlos Munuera, Francisco Revson F. Pereira +2 more

We study entanglement-assisted quantum error-correcting codes (EAQECCs) arising from classical one-point algebraic geometry codes from the Hermitian curve with respect to the Hermitian inner product. Their only unknown parameter is $ c $, the number of required maximally entangled quantum states since the Hermitian dual of an AG code is unknown. In this article, we present an efficient algorithmic approach for computing $ c $ for this family of EAQECCs. As a result, this algorithm allows us to provide EAQECCs with excellent parameters over any field size.

arXiv:2105.02166•Advances in Mathematics of Communications•Jan 12, 2022•2 citations
In 2019, Carletet al. introduced the concept of σ duals of linear codes involving the σ inner product, which generalizes the Euclidean, Hermitian and ℓ-Galois cases. This paper focuses on constructing new and improved classical codes and quantum codes within the framework of the σ inner product. We derive some general properties of linear codes, including matrix-product (MP) codes, with respect to the σ inner product. We develop general methods and design effective routes involving certain optimization problems for constructing σ self-orthogonal (SO) and σ dual-containing (DC) MP codes. Our schemes efficiently generate numerous such codes with new or optimal parameters. We establish the σ construction of quantum stabilizer codes from classical codes. We propose a unified method for constructing two general classes of entanglement-assisted quantum error-correcting codes (EAQECCs) based on the σ hulls of general linear codes. This further yields six types of EAQECCs with flexible parameters based on propagation rules using MP codes under the Euclidean and Hermitian cases. Compared to the best-known ternary EAQECCs, we obtain 17 new ones and 13 of them have improved parameters. Finally, we present two infinite families of q-ary EAQECCs with lengths (q2− 1)(q+ 2) andq2(q+2), respectively. These families include many q-ary QECCs that are not only new according to Grassl’s online database but also surpass those listed in Edel’s online database.
We study entanglement-assisted quantum error-correcting codes (EAQECCs) arising from classical one-point algebraic geometry codes from the Hermitian curve with respect to the Hermitian inner product. Their only unknown parameter is $ c $, the number of required maximally entangled quantum states since the Hermitian dual of an AG code is unknown. In this article, we present an efficient algorithmic approach for computing $ c $ for this family of EAQECCs. As a result, this algorithm allows us to provide EAQECCs with excellent parameters over any field size.