Asymmetric Quantum Concatenated and Tensor Product Codes with Large Z-Distances

by   Jihao Fan, et al.

In many quantum channels, dephasing errors occur more frequently than the amplitude errors - a phenomenon that has been exploited for performance gains and other benefits through asymmetric quantum codes (AQCs). In this paper, we present a new construction of AQCs by combining classical concatenated codes (CCs) with tensor product codes (TPCs), called asymmetric quantum concatenated and tensor product codes (AQCTPCs) which have the following three advantages. First, only the outer codes in AQCTPCs need to satisfy the orthogonal constraint in quantum codes, and any classical linear code can be used for the inner, which makes AQCTPCs very easy to construct. Second, most AQCTPCs are highly degenerate, which means they can correct many more errors than their classical TPC counterparts. Consequently, we construct several families of AQCs with better parameters than known results in the literature. Especially, we derive a first family of binary AQCs with the Z-distance larger than half the block length. Third, AQCTPCs can be efficiently decoded although they



There are no comments yet.


page 1

page 2

page 3

page 4


Quantum LDPC Codes with Almost Linear Minimum Distance

We give a construction of quantum LDPC codes of dimension Θ(log N) and d...

Infinite Families of Quantum-Classical Hybrid Codes

Hybrid codes simultaneously encode both quantum and classical informatio...

Quantum LDPC codes with Ω(√(n)log^kn) distance, for any k

In this work we construct quantum LDPC codes of distance √(n)log^k n for...

Optimizing short stabilizer codes for asymmetric channels

For a number of quantum channels of interest, phase-flip errors occur fa...

On inverse product cannibalisation: a new Lotka-Volterra model for asymmetric competition in the ICTs

Product cannibalisation is a well-known phenomenon in marketing and tech...

Two New Families of Quantum Synchronizable Codes

In this paper, we present two ways of synchronization coding and enrich ...

Towards a better understanding of the matrix product function approximation algorithm in application to quantum physics

We recently introduced a method to approximate functions of Hermitian Ma...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.