Homological Thresholds in Randomly Monitored Quantum Error-Correcting Codes
Abstract
Random projective measurements are an effective tool to model the interlinked phenomenology of monitoring, inferring, and decoding highly entangled states such as quantum error-correcting codes. At the same time, the study of such monitored dynamics has opened a new arena for critical phenomena, renewing longstanding questions in disordered statistical mechanics, including percolation, random-bond models, and Nishimori physics. Here we investigate the robustness of stabilizer quantum error-correcting codes under a single round of independently sampled single-qubit Pauli measurements and demonstrate that their threshold behavior falls into two broad categories - geometric and homological percolation transitions, with the toric code and color code being the principal examples for each class. We establish the distinct character of these two threshold theories by analyzing the logical-support criteria of these codes and by providing numerical estimates of their respective critical exponents obtained from optimized stabilizer simulations of large-scale systems with over one million qubits. Our framework extends to non-CSS, subsystem, higher-dimensional, and Floquet stabilizer codes and allows us to determine their respective threshold phase diagrams. We exemplify how the latter provide quantitative and qualitative guidance for the computationally more demanding problems of tunable learning and maximum-likelihood decoding. As a practical application of our framework, we discuss the robustness of the gross code.
Related
- Topological Quantum Error-Correcting Thresholds of a Symmetry-Enriched Toric Code
- Arithmetic of Bohr Frequencies Governs Uniform Mixing in Randomly Timed Quantum Spin Chains
- Temporal Interference from Topological Transitions in Monitored Quantum Dynamics
- Monitored quantum transport through a disordered one-dimensional conductor
- Sampling isometric tensor network states with monitored quantum circuits
BibTeX
@misc{watanabe2026homological,
title = {{Homological Thresholds in Randomly Monitored Quantum Error-Correcting Codes}},
author = {Yoshito Watanabe and Daiki Sasamoto and Bo Han and Simon Trebst},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.02310},
eprint = {2610.02310},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.02310},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Homological Thresholds in Randomly Monitored Quantum Error-Correcting Codes
AU - Yoshito Watanabe
AU - Daiki Sasamoto
AU - Bo Han
AU - Simon Trebst
PY - 2026
DA - 2026/10/01
PB - arXiv
DO - 10.48550/arxiv.2610.02310
UR - https://arxiv.org/abs/2610.02310
AB - Random projective measurements are an effective tool to model the interlinked phenomenology of monitoring, inferring, and decoding highly entangled states such as quantum error-correcting codes. At the same time, the study of such monitored dynamics has opened a new arena for critical phenomena, renewing longstanding questions in disordered statistical mechanics, including percolation, random-bond models, and Nishimori physics. Here we investigate the robustness of stabilizer quantum error-correcting codes under a single round of independently sampled single-qubit Pauli measurements and demonstrate that their threshold behavior falls into two broad categories - geometric and homological percolation transitions, with the toric code and color code being the principal examples for each class. We establish the distinct character of these two threshold theories by analyzing the logical-support criteria of these codes and by providing numerical estimates of their respective critical exponents obtained from optimized stabilizer simulations of large-scale systems with over one million qubits. Our framework extends to non-CSS, subsystem, higher-dimensional, and Floquet stabilizer codes and allows us to determine their respective threshold phase diagrams. We exemplify how the latter provide quantitative and qualitative guidance for the computationally more demanding problems of tunable learning and maximum-likelihood decoding. As a practical application of our framework, we discuss the robustness of the gross code.
ER -