Quantum-capacity-approaching codes for the detected-jump channel

Markus Grassl, Zhengfeng Ji, Zhaohui Wei, Bei ZengPhysical 2010 · DOI · arXiv

Abstract: The quantum-channel capacity gives the ultimate limit for the rate at which quantum data can be reliably transmitted through a noisy quantum channel. Degradable quantum channels are among the few channels whose quantum capacities are known. Given the quantum capacity of a degradable channel, it remains challenging to find a practical coding scheme which approaches capacity. Here we discuss code designs for the detected-jump channel, a degradable channel with practical relevance describing the physics of spontaneous decay of atoms with detected photon emission. We show that this channel can be used to simulate a binary classical channel with both erasures and bit flips. The capacity of the simulated classical channel gives a lower bound on the quantum capacity of the detected-jump channel. When the jump probability is small, it almost equals the quantum capacity. Hence using a classical capacity-approaching code for the simulated classical channel yields a quantum code which approaches the quantum capacity of the detected-jump channel.

Introduction

In quantum information theory, the quantum capacity defines the ultimate rate at which quantum data can be reliably transmitted through a noisy channel. While mathematical formulations for these limits exist, designing practical "capacity-approaching" codes remains a significant challenge. This work focuses on the detected-jump (DJ) channel, which models the physical process of an atom decaying from an excited state to a ground state where the emitted photon is detected. As a degradable channel, its capacity is known, but practical coding schemes have been elusive.

Mapping Quantum Noise to Classical Channels

The researchers propose a novel approach by analyzing the DJ channel in the Hadamard basis ($|+\rangle, |-\rangle$). They demonstrate that in this basis, the quantum noise simplifies into a combination of two well-understood classical noise types: erasures and bit-flips.

The detected-jump channel simulated as a classical channel with erasure (E) and bit-flip probabilities.

By establishing this "classical bridge," any classical code designed for these specific errors can be transformed into a quantum code for the DJ channel. This is achieved by applying a Hadamard transform to classical codewords. This insight allows the application of mature classical coding techniques, such as LDPC or Polar codes, to quantum systems.

Capacity Bounds and Convergence

A key finding is that the capacity of the simulated classical channel provides a lower bound on the quantum capacity of the DJ channel. Numerical analysis reveals that this bound is particularly tight when the jump probability ($\gamma$) is small.

Numerical comparison showing the tightness of the classical capacity bound as the jump probability approaches zero.

As shown in the figures, the gap between the classical simulation and the true quantum capacity vanishes as $\gamma \to 0$. This suggests that for many practical physical systems where decay rates are low, classical coding techniques are essentially optimal. Furthermore, the authors proved that a classical code with minimum distance $d$ can create a quantum code correcting errors up to $O(\gamma^{d-1})$.

Conclusion and Future Directions

This methodology provides a concrete path for designing high-performance quantum codes for the DJ channel. While the current mapping is specific to the structure of the detected-jump channel, it suggests a broader strategy: investigating whether other degradable quantum channels can be mapped to classical channels in alternative bases. Future work will likely focus on implementing these codes using modern techniques like Turbo codes and exploring their performance in realistic quantum environments.

Summary updated

Abstract

The quantum-channel capacity gives the ultimate limit for the rate at which quantum data can be reliably transmitted through a noisy quantum channel. Degradable quantum channels are among the few channels whose quantum capacities are known. Given the quantum capacity of a degradable channel, it remains challenging to find a practical coding scheme which approaches capacity. Here we discuss code designs for the detected-jump channel, a degradable channel with practical relevance describing the physics of spontaneous decay of atoms with detected photon emission. We show that this channel can be used to simulate a binary classical channel with both erasures and bit flips. The capacity of the simulated classical channel gives a lower bound on the quantum capacity of the detected-jump channel. When the jump probability is small, it almost equals the quantum capacity. Hence using a classical capacity-approaching code for the simulated classical channel yields a quantum code which approaches the quantum capacity of the detected-jump channel.
BibTeX
@inproceedings{grassl2010quantum,
  author = {Markus Grassl and Zhengfeng Ji and Zhaohui Wei and Bei Zeng},
  title = {{Quantum-capacity-approaching codes for the detected-jump channel}},
  booktitle = {Physical},
  year = {2010},
  doi = {10.1103/physreva.82.062324},
}
Figure