Identifying Logical Operations from Syndrome Histories for qLDPC Codes
Abstract
Syndrome histories are normally used to detect and correct errors in fault-tolerant quantum computation, but they can also reveal information about the logical operations executed during computation. We study logical-operation identification using syndrome histories alone or together with other classical measurement outcomes. We develop an exact inference method and a scalable approximation that account for unknown circuit faults and ideal measurement randomness. We evaluate automorphisms, logical Pauli measurements, T injections, and logical circuits combining these instructions on [[18,4,2]] and [[72,12,6]] bivariate bicycle (BB) codes under multiple noise models and error rates. A single logical instruction can be identified with over 94\% accuracy under circuit-level noise with error rates between 10−5 and 10−3. We also achieve over 99\% accuracy for automorphism-based logical circuits and 78.32\% for logical circuits combining all three instructions. We further analyze identification ambiguities arising from insufficient or indistinguishable measurement information, fault timing, and approximation inference. Together, these results extend the role of syndromes beyond error decoding to identifying executed logical operations and circuits during fault-tolerant quantum computation. They also suggest that access to syndrome histories and related classical measurement outcomes may unintentionally reveal information about the executed computation.
Related
- Quantum Secret Sharing from CSS qLDPC Codes: Computable Access Structures, Accessible Logical Dimension, and Topology-Aware Network Cost
- Individually Addressed Logical Pauli Measurements by QLDPC Surgery on a Trapped Ion Quantum Computer
- Learning Logical Operations for Arbitrary Quantum Error Correction Codes
- Fault-Tolerant Logical Operations and Efficient State Preparation in Modular Quantum Architectures with Noisy Interfaces
- Modular optical fault-tolerant quantum computation via an interface between verified resources and online logical operations
BibTeX
@misc{tan2026identifying,
title = {{Identifying Logical Operations from Syndrome Histories for qLDPC Codes}},
author = {Yizhuo Tan and Shifan Xu and Yongshan Ding and Jakub Szefer},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.40052},
eprint = {2610.40052},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.40052},
}
RIS
TY - UNPB
TI - Identifying Logical Operations from Syndrome Histories for qLDPC Codes
AU - Yizhuo Tan
AU - Shifan Xu
AU - Yongshan Ding
AU - Jakub Szefer
PY - 2026
DA - 2026/10/29
PB - arXiv
DO - 10.48550/arxiv.2610.40052
UR - https://arxiv.org/abs/2610.40052
AB - Syndrome histories are normally used to detect and correct errors in fault-tolerant quantum computation, but they can also reveal information about the logical operations executed during computation. We study logical-operation identification using syndrome histories alone or together with other classical measurement outcomes. We develop an exact inference method and a scalable approximation that account for unknown circuit faults and ideal measurement randomness. We evaluate automorphisms, logical Pauli measurements, T injections, and logical circuits combining these instructions on [[18,4,2]] and [[72,12,6]] bivariate bicycle (BB) codes under multiple noise models and error rates. A single logical instruction can be identified with over 94\% accuracy under circuit-level noise with error rates between 10^−5 and 10^−3. We also achieve over 99\% accuracy for automorphism-based logical circuits and 78.32\% for logical circuits combining all three instructions. We further analyze identification ambiguities arising from insufficient or indistinguishable measurement information, fault timing, and approximation inference. Together, these results extend the role of syndromes beyond error decoding to identifying executed logical operations and circuits during fault-tolerant quantum computation. They also suggest that access to syndrome histories and related classical measurement outcomes may unintentionally reveal information about the executed computation.
ER -