Towards a Unified Framework for Approximate Quantum Error Correction

TL;DR

This paper develops a unified framework for approximate quantum error correction by extending conditions and recovery methods from subspace codes to subsystem codes, enhancing noise resilience in quantum information storage.

Contribution

It introduces checkable conditions for approximate subsystem codes and validates the transpose channel as an effective recovery method for certain noise models.

Findings

Sufficient conditions for approximate subsystem code existence

Transpose channel performs nearly optimally for specific noise processes

Generalization of previous subspace code correction methods

Abstract

Recent work on approximate quantum error correction (QEC) has opened up the possibility of constructing subspace codes that protect information with high fidelity in scenarios where perfect error correction is impossible. Motivated by this, we investigate the problem of approximate subsystem codes. Subsystem codes extend the standard formalism of subspace QEC to codes in which only a subsystem within a subspace of states is used to store information in a noise-resilient fashion. Here, we demonstrate easily checkable sufficient conditions for the existence of approximate subsystem codes. Furthermore, for certain classes of subsystem codes and noise processes, we prove the efficacy of the transpose channel as a simple-to-construct recovery map that works nearly as well as the optimal recovery channel. This work generalizes our earlier approach [H.K. Ng and P. Mandayam, Phys. Rev. A 81 062342 (2010)] of using the transpose channel for approximate correction of subspace codes to the case of subsystem codes, and brings us closer to a unifying framework for approximate QEC.