Type: Preprint
Publication Date: 2024-12-09
Citations: 0
DOI: https://doi.org/10.48550/arxiv.2412.06744
Lacking quantum error correction (QEC) schemes for Hamiltonian-based quantum computations due to their continuous-time nature, energetically penalizing the errors is an effective error suppression technique. In this work, we construct families of distance-$2$ quantum error detection codes (QEDCs) using Bravyi's $A$ matrix framework, tailored for penalty-protection schemes. We identify a family of codes achieving the maximum code rate and, by slightly relaxing this constraint, uncover a broader spectrum of codes with enhanced physical locality, increasing their practical applicability. Additionally, we propose an algorithm to map the required connectivity into more hardware-feasible configurations, offering insights for quantum hardware design. Finally, we provide a systematic framework to evaluate the performance of these codes in terms of code rate, physical locality, graph properties, and penalty gap, enabling informed selection of codes for specific quantum computing applications.
Action | Title | Year | Authors |
---|
Action | Title | Year | Authors |
---|