128 research outputs found
A Class of Quantum LDPC Codes Constructed From Finite Geometries
Low-density parity check (LDPC) codes are a significant class of classical
codes with many applications. Several good LDPC codes have been constructed
using random, algebraic, and finite geometries approaches, with containing
cycles of length at least six in their Tanner graphs. However, it is impossible
to design a self-orthogonal parity check matrix of an LDPC code without
introducing cycles of length four.
In this paper, a new class of quantum LDPC codes based on lines and points of
finite geometries is constructed. The parity check matrices of these codes are
adapted to be self-orthogonal with containing only one cycle of length four.
Also, the column and row weights, and bounds on the minimum distance of these
codes are given. As a consequence, the encoding and decoding algorithms of
these codes as well as their performance over various quantum depolarizing
channels will be investigated.Comment: 5pages, 2 figure
Entanglement-assisted quantum low-density parity-check codes
This paper develops a general method for constructing entanglement-assisted
quantum low-density parity-check (LDPC) codes, which is based on combinatorial
design theory. Explicit constructions are given for entanglement-assisted
quantum error-correcting codes (EAQECCs) with many desirable properties. These
properties include the requirement of only one initial entanglement bit, high
error correction performance, high rates, and low decoding complexity. The
proposed method produces infinitely many new codes with a wide variety of
parameters and entanglement requirements. Our framework encompasses various
codes including the previously known entanglement-assisted quantum LDPC codes
having the best error correction performance and many new codes with better
block error rates in simulations over the depolarizing channel. We also
determine important parameters of several well-known classes of quantum and
classical LDPC codes for previously unsettled cases.Comment: 20 pages, 5 figures. Final version appearing in Physical Review
Adaptively correcting quantum errors with entanglement
Contrary to the assumption that most quantum error-correcting codes (QECC)
make, it is expected that phase errors are much more likely than bit errors in
physical devices. By employing the entanglement-assisted stabilizer formalism,
we develop a new kind of error-correcting protocol which can flexibly trade
error correction abilities between the two types of errors, such that high
error correction performance is achieved both in symmetric and in asymmetric
situations. The characteristics of the QECCs can be optimized in an adaptive
manner during information transmission. The proposed entanglement-assisted
QECCs require only one ebit regardless of the degree of asymmetry at a given
moment and can be decoded in polynomial time.Comment: 5 pages, final submission to ISIT 2011, Saint-Petersburg, Russi
An Adaptive Entanglement Distillation Scheme Using Quantum Low Density Parity Check Codes
Quantum low density parity check (QLDPC) codes are useful primitives for
quantum information processing because they can be encoded and decoded
efficiently. Besides, the error correcting capability of a few QLDPC codes
exceeds the quantum Gilbert-Varshamov bound. Here, we report a numerical
performance analysis of an adaptive entanglement distillation scheme using
QLDPC codes. In particular, we find that the expected yield of our adaptive
distillation scheme to combat depolarization errors exceed that of Leung and
Shor whenever the error probability is less than about 0.07 or greater than
about 0.28. This finding illustrates the effectiveness of using QLDPC codes in
entanglement distillation.Comment: 12 pages, 6 figure
High performance entanglement-assisted quantum LDPC codes need little entanglement
Though the entanglement-assisted formalism provides a universal connection
between a classical linear code and an entanglement-assisted quantum
error-correcting code (EAQECC), the issue of maintaining large amount of pure
maximally entangled states in constructing EAQECCs is a practical obstacle to
its use. It is also conjectured that the power of entanglement-assisted
formalism to convert those good classical codes comes from massive consumption
of maximally entangled states. We show that the above conjecture is wrong by
providing families of EAQECCs with an entanglement consumption rate that
diminishes linearly as a function of the code length. Notably, two families of
EAQECCs constructed in the paper require only one copy of maximally entangled
state no matter how large the code length is. These families of EAQECCs that
are constructed from classical finite geometric LDPC codes perform very well
according to our numerical simulations. Our work indicates that EAQECCs are not
only theoretically interesting, but also physically implementable. Finally,
these high performance entanglement-assisted LDPC codes with low entanglement
consumption rates allow one to construct high-performance standard QECCs with
very similar parameters.Comment: 8 pages, 5 figures. Published versio
The Road From Classical to Quantum Codes: A Hashing Bound Approaching Design Procedure
Powerful Quantum Error Correction Codes (QECCs) are required for stabilizing
and protecting fragile qubits against the undesirable effects of quantum
decoherence. Similar to classical codes, hashing bound approaching QECCs may be
designed by exploiting a concatenated code structure, which invokes iterative
decoding. Therefore, in this paper we provide an extensive step-by-step
tutorial for designing EXtrinsic Information Transfer (EXIT) chart aided
concatenated quantum codes based on the underlying quantum-to-classical
isomorphism. These design lessons are then exemplified in the context of our
proposed Quantum Irregular Convolutional Code (QIRCC), which constitutes the
outer component of a concatenated quantum code. The proposed QIRCC can be
dynamically adapted to match any given inner code using EXIT charts, hence
achieving a performance close to the hashing bound. It is demonstrated that our
QIRCC-based optimized design is capable of operating within 0.4 dB of the noise
limit
- …