Synchronizable hybrid subsystem codes

TL;DR

This paper introduces a new class of quantum error-correcting codes called synchronizable hybrid subsystem codes, which can correct errors in quantum information and block synchronization simultaneously.

Contribution

It establishes connections between quantum synchronizable, subsystem, and hybrid codes, and proposes methods to construct codes that correct both quantum and synchronization errors.

Findings

Constructed codes that correct both Pauli and synchronization errors.

Codes are resilient to gauge errors due to the subsystem structure.

Methods to construct hybrid and hybrid subsystem codes from classical codes.

Abstract

Quantum synchronizable codes are quantum error correcting codes that can correct not only Pauli errors but also errors in block synchronization. The code can be constructed from two classical cyclic codes $\mathcal{C}$, $\mathcal{D}$ satisfying $\mathcal{C}^{\perp} \subset \mathcal{C} \subset \mathcal{D}$ through the Calderbank-Shor-Steane (CSS) code construction. In this work, we establish connections between quantum synchronizable codes, subsystem codes, and hybrid codes constructed from the same pair of classical cyclic codes. We also propose a method to construct a synchronizable hybrid subsystem code which can correct both Pauli and synchronization errors, is resilient to gauge errors by virtue of the subsystem structure, and can transmit both classical and quantum information, all at the same time. The trade-offs between the number of synchronization errors that the code can correct, the number of gauge qubits, and the number of logical classical bits of the code are also established. In addition, we propose general methods to construct hybrid and hybrid subsystem codes of CSS type from classical codes, which cover relevant codes from our main construction.