<inline-formula><tex-math id="M1">$ t_1 $</tex-math></inline-formula>-partitioned Euclidean orthogonal MP codes and their application to asymmetric quantum codes

In this paper, we first give the definition of $ t_1 $-partitioned Euclidean orthogonal matrix-product (MP) codes over finite fields. We then provide a criterion for $ t_1 $-partitioned Euclidean orthogonal MP codes over finite fields to be Euclidean dual-containing. Further, we exhibit a new construction method for asymmetric quantum codes by using this criterion. This construction is applied to obtain six new infinite families of asymmetric quantum codes. In addition, we compare our asymmetric quantum codes with previously known asymmetric quantum codes or quantum codes available in the literature. As can be seen, our obtained asymmetric quantum codes have better parameters than the asymmetric quantum codes or quantum codes available in the literature.

Authors

Institutions

Publication Details

Journal
Advances in Mathematics of Communications
Published
2025-08-18
DOI
https://doi.org/10.3934/amc.2025039
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

<inline-formula><tex-math id="M1">$ t_1 $</tex-math></inline-formula>-partitioned Euclidean orthogonal MP codes and their application to asymmetric quantum codes

Xiusheng Liu, Ye Cai Guo, Peng Hu
Advances in Mathematics of Communications
Quantum Computing Algorithms and Architecture
article

<inline-formula><tex-math id="M1">$ t_1 $</tex-math></inline-formula>-partitioned Euclidean orthogonal MP codes and their application to asymmetric quantum codes

Xiusheng Liu, Ye Cai Guo, Peng Hu
article en

Abstract

In this paper, we first give the definition of $ t_1 $-partitioned Euclidean orthogonal matrix-product (MP) codes over finite fields. We then provide a criterion for $ t_1 $-partitioned Euclidean orthogonal MP codes over finite fields to be Euclidean dual-containing. Further, we exhibit a new construction method for asymmetric quantum codes by using this criterion. This construction is applied to obtain six new infinite families of asymmetric quantum codes. In addition, we compare our asymmetric quantum codes with previously known asymmetric quantum codes or quantum codes available in the literature. As can be seen, our obtained asymmetric quantum codes have better parameters than the asymmetric quantum codes or quantum codes available in the literature.

Advances in Mathematics of CommunicationsVol. 21(0)
Hubei University of Arts and Science (CN), Hubei Polytechnic University (CN)
Hubei Polytechnic University
Openalex Percentile: Top 89%
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.