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

International Journal of Modern Physics B

ON TWO PROBLEMS OF ASYMMETRIC QUANTUM CODES

Ruihu Li, Genqi Xu, Luobin Guo

Published Dec 6, 2013• 11 citations
Publisher

Abstract

In this paper, we discuss two problems on asymmetric quantum error-correcting codes (AQECCs). The first one is on the construction of a [[12, 1, 5/3]]2asymmetric quantum code, we show an impure [[12, 1, 5/3 ]]2exists. The second one is on the construction of AQECCs from binary cyclic codes, we construct many families of new asymmetric quantum codes with dz> δmax+1 from binary primitive cyclic codes of length n = 2m-1, where δmax= 2⌈m/2⌉-1 is the maximal designed distance of dual containing narrow sense BCH code of length n = 2m-1. A number of known codes are special cases of the codes given here. Some of these AQECCs have parameters better than the ones available in the literature.

DOI
10.1142/s0217979214500179

Related papers

Dual Containing BCH Codes and New Asymmetric Quantum Codes

Yuena Ma, Xiaoyi Feng, Liangdong Lv +1 more

In this paper, we discuss the problem on the construction of asymmetric quantum codes [[n,k,dz /dx]]4from primitive narrow sense BCH codes. Take advantage of dual containing BCH codes of length n = 4m- 1 where m = 2l and mm =2l±1 , we construct two families of new asymmetric quantum codes with dz≥ δmax+1, where δmaxis the maximal designed distance of dual containing narrow sense BCH code. Our asymmetric quantum codes are new ones, and are not included in the known literature.

International Conference on Instrumentation and Measurement, Computer, Communication and Control (IMCCC)•Sep 1, 2015•2 citations

Asymmetric Quantum Codes of Large Z - Distance Constructed from a Class of Quaternary Imprimitive BCH Codes

Ruihu Li, Genqi Xu, Qiang Fu +1 more

In this paper, we focus on construction of asymmetric quantum error-correcting codes (AQECCs) from quaternary narrow-sense BCH codes of code length n = 4m-1/3(m≥3 is an integer) via Calderbank-Shor-Steane construction. By a careful analysis on properties of cyclotomic cosets in the defining sets of two ingredient BCH codes B(n, δ1)4and B(n,δ2)4that satisfies B⊥h(n,δ1)4⊆ B(n,δ2)4used for constructing AQECCs, we derive new families of AQECCs with dz> δmaxs+ 1, and thus we can eliminate the unreasonable restriction dz≤ δmaxdevised in previous literature and obtain new AQECCs with greater asymmetry compared with the known results. Here δmaxsis the maximal designed distance of Hermitian dual-containing narrow-sense BCH codes of length n = 4m-1/3.

International Conference on Instrumentation and Measurement, Computer, Communication and Control (IMCCC)•Sep 1, 2015•0 citations

Asymmetric quantum BCH codes

Salah A. Aly

Recently, the theory of quantum error control codes has been extended to include quantum codes over asymmetric quantum channels - qubit-flip and phase-shift errors may have equal or different probabilities. Previous work in constructing quantum error control codes has focused on code constructions for symmetric quantum channels. In this paper we establish a method to construct asymmetric quantum codes based on classical codes. We derive, once again, families of asymmetric quantum codes from classical BCH and RS codes over finite fields. Particularly, we present interesting asymmetric quantum codes based on nonprimitive narrow-sense BCH codes with parameters [[n, k, dz/dx]]qfor certain values of code lengths, dimensions, and various minimum distance. Finally, our constructions are well explained by an illustrative example.

International Conference on Computer Engineering & Systems (ICCES)•Nov 1, 2008•40 citations

New nonbinary quantum codes with larger distance constructed from BCH codes over 𝔽q2

Genqi Xu, Ruihu Li, Qiang Fu +2 more

This paper concentrates on construction of new nonbinary quantum error-correcting codes (QECCs) from three classes of narrow-sense imprimitive BCH codes over finite field [Formula: see text] ([Formula: see text] is an odd prime power). By a careful analysis on properties of cyclotomic cosets in defining set [Formula: see text] of these BCH codes, the improved maximal designed distance of these narrow-sense imprimitive Hermitian dual-containing BCH codes is determined to be much larger than the result given according to Aly et al. [S. A. Aly, A. Klappenecker and P. K. Sarvepalli, IEEE Trans. Inf. Theory 53, 1183 (2007)] for each different code length. Thus families of new nonbinary QECCs are constructed, and the newly obtained QECCs have larger distance than those in previous literature.

International Journal of Modern Physics B•Dec 1, 2016•1 citation

NONBINARY QUANTUM CODES DERIVED FROM REPEATED-ROOT CYCLIC CODES

Jianfa Qian, LINA ZHANG

Many good quantum error-correcting codes were constructed from cyclic codes. However, it is a difficult problem to determine the true minimum distance of quantum cyclic codes for large length n. In this work, we construct nonbinary quantum cyclic codes and asymmetric quantum cyclic codes that are derived from repeated-root cyclic codes for an arbitrary length ps, and determine the true minimum distance of all those codes. Some proposed quantum cyclic codes are optimal. Additionally, some proposed asymmetric quantum cyclic codes have better parameters than the ones available in the literature.

Modern Physics Letters B•Mar 4, 2013•7 citations

SYMMETRIC AND ASYMMETRIC QUANTUM CODES

Kenza Guenda, Thomas Aaron Gulliver

The asymmetric CSS construction is extended to the Hermitian dual case. New infinite families of quantum symmetric and asymmetric codes are constructed. In particular, new quantum codes are obtained from binary BCH codes and MDS codes. These codes have known minimum distances and thus the relationship between the rate gain and minimum distance is given explicitly. The codes obtained are shown to have parameters better than those of previous codes. A number of known codes are special cases of the codes given here.

International Journal of Quantum Information•Aug 1, 2013•11 citations
In this paper, we discuss two problems on asymmetric quantum error-correcting codes (AQECCs). The first one is on the construction of a [[12, 1, 5/3]]2asymmetric quantum code, we show an impure [[12, 1, 5/3 ]]2exists. The second one is on the construction of AQECCs from binary cyclic codes, we construct many families of new asymmetric quantum codes with dz> δmax+1 from binary primitive cyclic codes of length n = 2m-1, where δmax= 2⌈m/2⌉-1 is the maximal designed distance of dual containing narrow sense BCH code of length n = 2m-1. A number of known codes are special cases of the codes given here. Some of these AQECCs have parameters better than the ones available in the literature.
In this paper, we focus on construction of asymmetric quantum error-correcting codes (AQECCs) from quaternary narrow-sense BCH codes of code length n = 4m-1/3(m≥3 is an integer) via Calderbank-Shor-Steane construction. By a careful analysis on properties of cyclotomic cosets in the defining sets of two ingredient BCH codes B(n, δ1)4and B(n,δ2)4that satisfies B⊥h(n,δ1)4⊆ B(n,δ2)4used for constructing AQECCs, we derive new families of AQECCs with dz> δmaxs+ 1, and thus we can eliminate the unreasonable restriction dz≤ δmaxdevised in previous literature and obtain new AQECCs with greater asymmetry compared with the known results. Here δmaxsis the maximal designed distance of Hermitian dual-containing narrow-sense BCH codes of length n = 4m-1/3.
Recently, the theory of quantum error control codes has been extended to include quantum codes over asymmetric quantum channels - qubit-flip and phase-shift errors may have equal or different probabilities. Previous work in constructing quantum error control codes has focused on code constructions for symmetric quantum channels. In this paper we establish a method to construct asymmetric quantum codes based on classical codes. We derive, once again, families of asymmetric quantum codes from classical BCH and RS codes over finite fields. Particularly, we present interesting asymmetric quantum codes based on nonprimitive narrow-sense BCH codes with parameters [[n, k, dz/dx]]qfor certain values of code lengths, dimensions, and various minimum distance. Finally, our constructions are well explained by an illustrative example.
This paper concentrates on construction of new nonbinary quantum error-correcting codes (QECCs) from three classes of narrow-sense imprimitive BCH codes over finite field [Formula: see text] ([Formula: see text] is an odd prime power). By a careful analysis on properties of cyclotomic cosets in defining set [Formula: see text] of these BCH codes, the improved maximal designed distance of these narrow-sense imprimitive Hermitian dual-containing BCH codes is determined to be much larger than the result given according to Aly et al. [S. A. Aly, A. Klappenecker and P. K. Sarvepalli, IEEE Trans. Inf. Theory 53, 1183 (2007)] for each different code length. Thus families of new nonbinary QECCs are constructed, and the newly obtained QECCs have larger distance than those in previous literature.
Many good quantum error-correcting codes were constructed from cyclic codes. However, it is a difficult problem to determine the true minimum distance of quantum cyclic codes for large length n. In this work, we construct nonbinary quantum cyclic codes and asymmetric quantum cyclic codes that are derived from repeated-root cyclic codes for an arbitrary length ps, and determine the true minimum distance of all those codes. Some proposed quantum cyclic codes are optimal. Additionally, some proposed asymmetric quantum cyclic codes have better parameters than the ones available in the literature.
The asymmetric CSS construction is extended to the Hermitian dual case. New infinite families of quantum symmetric and asymmetric codes are constructed. In particular, new quantum codes are obtained from binary BCH codes and MDS codes. These codes have known minimum distances and thus the relationship between the rate gain and minimum distance is given explicitly. The codes obtained are shown to have parameters better than those of previous codes. A number of known codes are special cases of the codes given here.