Synchronizable hybrid subsystem codes
<|reference_start|>Synchronizable hybrid subsystem codes: 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.<|reference_end|>
@article{tansuwannont2024synchronizable,
    title={Synchronizable hybrid subsystem codes},
    author={Theerapat Tansuwannont, Andrew Nemec},
    journal={arXiv preprint arXiv:2409.11312},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.11312},
    primaryClass={quant-ph cs.IT math.IT}
}