dorsal/arxiv
View SchemaTowards Minimal Fault-tolerant Error-Correction Sequence with Quantum Hamming Codes
| Authors | Sha Shi, Xiao-Yang Xu, Min-Quan Cheng, Dong-Sheng Wang, Yun-Jiang Wang |
|---|---|
| Categories | |
| ArXiv ID | 2601.10042vv1 |
| URL | https://arxiv.org/abs/2601.10042 |
| License | http://creativecommons.org/licenses/by-nc-sa/4.0/ |
Abstract
The high overhead of fault-tolerant measurement sequences (FTMSs) poses a major challenge for implementing quantum stabilizer codes. Here, we address this problem by constructing efficient FTMSs for the class of quantum Hamming codes $[\![2^r-1, 2^r-1-2r, 3]\!]$ with $r=3k+1$ ($k \in \mathbb{Z}^+$). Our key result demonstrates that the sequence length can be reduced to exactly $2r+1$-only one additional measurement beyond the original non-fault-tolerant sequence, establishing a tight lower bound. The proposed method leverages cyclic matrix transformations to systematically combine rows of the initial stabilizer matrix and preserving a self-dual CSS-like symmetry analogous to that of the original quantum Hamming codes. This induced symmetry enables hardware-efficient circuit reuse: the measurement circuits for the first $r$ stabilizers are transformed into circuits for the remaining $r$ stabilizers simply by toggling boundary Hadamard gates, eliminating redundant hardware. For distance-3 fault-tolerant error correction, our approach simultaneously reduces the time overhead via shorting the FTMS length and the hardware overhead through symmetry-enabled circuit multiplexing. These results provide an important advance towards the important open problem regarding the design of minimal FTMSs for quantum Hamming codes and may shed light on similar challenges in other quantum stabilizer codes.
{
"annotation_id": "285a47e4-7078-45c1-bbef-dcbc58bf6052",
"date_created": "2026-02-17T05:53:23.794000Z",
"date_modified": "2026-02-17T05:53:23.794000Z",
"file_hash": "b10bb388c44d9916ab0d01c8528b2755ef4aeb0c6543a9c0db5df8a597e5a670",
"private": false,
"record": {
"abstract": "The high overhead of fault-tolerant measurement sequences (FTMSs) poses a major challenge for implementing quantum stabilizer codes. Here, we address this problem by constructing efficient FTMSs for the class of quantum Hamming codes $[\\![2^r-1, 2^r-1-2r, 3]\\!]$ with $r=3k+1$ ($k \\in \\mathbb{Z}^+$). Our key result demonstrates that the sequence length can be reduced to exactly $2r+1$-only one additional measurement beyond the original non-fault-tolerant sequence, establishing a tight lower bound. The proposed method leverages cyclic matrix transformations to systematically combine rows of the initial stabilizer matrix and preserving a self-dual CSS-like symmetry analogous to that of the original quantum Hamming codes. This induced symmetry enables hardware-efficient circuit reuse: the measurement circuits for the first $r$ stabilizers are transformed into circuits for the remaining $r$ stabilizers simply by toggling boundary Hadamard gates, eliminating redundant hardware. For distance-3 fault-tolerant error correction, our approach simultaneously reduces the time overhead via shorting the FTMS length and the hardware overhead through symmetry-enabled circuit multiplexing. These results provide an important advance towards the important open problem regarding the design of minimal FTMSs for quantum Hamming codes and may shed light on similar challenges in other quantum stabilizer codes.",
"arxiv_id": "2601.10042",
"authors": [
"Sha Shi",
"Xiao-Yang Xu",
"Min-Quan Cheng",
"Dong-Sheng Wang",
"Yun-Jiang Wang"
],
"categories": [
"quant-ph"
],
"license": "http://creativecommons.org/licenses/by-nc-sa/4.0/",
"title": "Towards Minimal Fault-tolerant Error-Correction Sequence with Quantum Hamming Codes",
"url": "https://arxiv.org/abs/2601.10042",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "f1634ac0-1606-4d72-9273-1cbd93ddf6a8",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}