A survey on quantum channel capacities
Quantum information processing exploits the quantum nature of information. It offers
fundamentally new solutions in the field of computer science and extends the possibilities to …
fundamentally new solutions in the field of computer science and extends the possibilities to …
Quantum channels and memory effects
Any physical process can be represented as a quantum channel mapping an initial state to a
final state. Hence it can be characterized from the point of view of communication theory, ie …
final state. Hence it can be characterized from the point of view of communication theory, ie …
The XZZX surface code
Performing large calculations with a quantum computer will likely require a fault-tolerant
architecture based on quantum error-correcting codes. The challenge is to design practical …
architecture based on quantum error-correcting codes. The challenge is to design practical …
Decoding algorithms for surface codes
Quantum technologies have the potential to solve certain computationally hard problems
with polynomial or super-polynomial speedups when compared to classical methods …
with polynomial or super-polynomial speedups when compared to classical methods …
Quantum LDPC codes with positive rate and minimum distance proportional to the square root of the blocklength
JP Tillich, G Zémor - IEEE Transactions on Information Theory, 2013 - ieeexplore.ieee.org
The current best asymptotic lower bound on the minimum distance of quantum LDPC codes
with a fixed non-zero rate is logarithmic in the blocklength. We propose a construction of …
with a fixed non-zero rate is logarithmic in the blocklength. We propose a construction of …
On the iterative decoding of sparse quantum codes
D Poulin, Y Chung - arXiv preprint arXiv:0801.1241, 2008 - arxiv.org
We address the problem of decoding sparse quantum error correction codes. For Pauli
channels, this task can be accomplished by a version of the belief propagation algorithm …
channels, this task can be accomplished by a version of the belief propagation algorithm …
Foliated quantum error-correcting codes
We show how to construct a large class of quantum error-correcting codes, known as
Calderbank-Steane-Shor codes, from highly entangled cluster states. This becomes a …
Calderbank-Steane-Shor codes, from highly entangled cluster states. This becomes a …
Duality of quantum and classical error correction codes: Design principles and examples
Quantum error correction codes (QECCs) can be constructed from the known classical
coding paradigm by exploiting the inherent isomorphism between the classical and quantum …
coding paradigm by exploiting the inherent isomorphism between the classical and quantum …
Entanglement-assisted quantum turbo codes
An unexpected breakdown in the existing theory of quantum serial turbo coding is that a
quantum convolutional encoder cannot simultaneously be recursive and non-catastrophic …
quantum convolutional encoder cannot simultaneously be recursive and non-catastrophic …
Universal decoding of quantum stabilizer codes via classical guesswork
A universal decoding scheme is conceived for quantum stabilizer codes (QSCs) by
appropriately adapting the 'guessing random additive noise decoding'(GRAND) philosophy …
appropriately adapting the 'guessing random additive noise decoding'(GRAND) philosophy …