Asymmetric quantum codes: constructions, bounds and performance Academic Article uri icon


  • 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 CalderbankShorSteane (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 BoseChaudhuriHocquenghem (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.

published proceedings


altmetric score

  • 3

author list (cited authors)

  • Sarvepalli, P. K., Klappenecker, A., & Roetteler, M.

citation count

  • 84

complete list of authors

  • Sarvepalli, Pradeep Kiran||Klappenecker, Andreas||Roetteler, Martin

publication date

  • May 2009