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 Digital Content Technology and its Applications

Asymmetric Quantum Codes Derived From Linear over Finite Rings

Jianfa Qian, Wang Zhen

Published Nov 19, 2012• 0 citations
Publisher
DOI
10.4156/jdcta.vol6.issue20.10

Related papers

Quantum codes from linear codes over finite chain rings

Xiusheng Liu, Hualu Liu

arXiv:1704.06375•Quantum Information Processing•Aug 20, 2017•39 citations

New optimal asymmetric quantum codes and quantum convolutional codes derived from constacyclic codes

Jian‐Zhang Chen, Youqin Chen, Yuanyuan Huang +1 more

Quantum Information Processing•Dec 31, 2018•21 citations

Quantum codes from cyclic codes over F3 + vF3

Mohammad Ashraf, Ghulam Mohammad

Let R = F3 + vF3 be a finite commutative ring, where v2 = 1. It is a finite semi-local ring, not a chain ring. In this paper, we give a construction for quantum codes from cyclic codes over R. We derive self-orthogonal codes over F3 as Gray images of linear and cyclic codes over R. In particular, we use two codes associated with a cyclic code over R of arbitrary length to determine the parameters of the corresponding quantum code.

International Journal of Quantum Information•Sep 1, 2014•58 citations

NONBINARY QUANTUM CODES DERIVED FROM GROUP CHARACTER CODES

Jianfa Qian, Lina Zhang

Most of quantum codes have been constructed by using classical linear codes over finite field. However, little is known about the construction of quantum codes via group character codes. In this work, we present the constructions of nonbinary quantum and asymmetric quantum codes based on group character codes, and give explicit parameters for infinite families of nonbinary quantum codes and asymmetric quantum codes. Furthermore, we present families of optimal quantum codes which derived from group character codes.

International Journal of Quantum Information•Jun 1, 2012•10 citations

On the Construction of Asymmetric Quantum Codes

Giuliano G. La Guardia

International Journal of Theoretical Physics•Feb 4, 2014•21 citations

Asymmetric quantum codes: constructions, bounds and performance

Pradeep Kiran Sarvepalli, Andreas Klappenecker, Martin Rötteler

Recently, quantum error-correcting codes have been proposed that capitalize on the fact that many physical error models lead to a significant asymmetry between the probabilities for bit- and phase-flip errors. An example for a channel that exhibits such asymmetry is the combined amplitude damping and dephasing channel, where the probabilities of bit and phase flips can be related to relaxation and dephasing time, respectively. We study asymmetric quantum codes that are obtained from the Calderbank–Shor–Steane (CSS) construction. For such codes, we derive upper bounds on the code parameters using linear programming. A central result of this paper is the explicit construction of some new families of asymmetric quantum stabilizer codes from pairs of nested classical codes. For instance, we derive asymmetric codes using a combination of Bose–Chaudhuri–Hocquenghem (BCH) and finite geometry low-density parity-check (LDPC) codes. We show that the asymmetric quantum codes offer two advantages, namely to allow a higher rate without sacrificing performance when compared with symmetric codes and vice versa to allow a higher performance when compared with symmetric codes of comparable rates. Our approach is based on a CSS construction that combines BCH and finite geometry LDPC codes.

Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences•Mar 4, 2009•144 citations
Most of quantum codes have been constructed by using classical linear codes over finite field. However, little is known about the construction of quantum codes via group character codes. In this work, we present the constructions of nonbinary quantum and asymmetric quantum codes based on group character codes, and give explicit parameters for infinite families of nonbinary quantum codes and asymmetric quantum codes. Furthermore, we present families of optimal quantum codes which derived from group character codes.
Recently, quantum error-correcting codes have been proposed that capitalize on the fact that many physical error models lead to a significant asymmetry between the probabilities for bit- and phase-flip errors. An example for a channel that exhibits such asymmetry is the combined amplitude damping and dephasing channel, where the probabilities of bit and phase flips can be related to relaxation and dephasing time, respectively. We study asymmetric quantum codes that are obtained from the Calderbank–Shor–Steane (CSS) construction. For such codes, we derive upper bounds on the code parameters using linear programming. A central result of this paper is the explicit construction of some new families of asymmetric quantum stabilizer codes from pairs of nested classical codes. For instance, we derive asymmetric codes using a combination of Bose–Chaudhuri–Hocquenghem (BCH) and finite geometry low-density parity-check (LDPC) codes. We show that the asymmetric quantum codes offer two advantages, namely to allow a higher rate without sacrificing performance when compared with symmetric codes and vice versa to allow a higher performance when compared with symmetric codes of comparable rates. Our approach is based on a CSS construction that combines BCH and finite geometry LDPC codes.