Fault tolerance of quantum circuits with tensor networks and symplectic geometry
Abstract
We develop an operator-algebraic framework for analyzing fault tolerance in quantum circuits and establish necessary and sufficient conditions for exact recovery of the ideal computation under a prescribed noise model. For prescribed circuit families and noise models, we derive a semidefinite program (SDP) based test whose infeasibility certifies that there does not exist any recovery map restoring its intended operation. For non-adaptive stabilizer circuits, analyzing the stabilizer symmetries of its components with symplectic geometry, we obtain closed-form detection and logical-effect matrices that characterize circuit distance algebraically. Applied to a finite Hastings--Haah honeycomb Floquet-code circuit, these matrices certify the dynamical encoding of two logical qubits and distance four under Pauli noise including measurement errors. Using these matrices, we then derive MacWilliams identities for circuit weight enumerators and obtain linear-programming (LP) upper bounds on circuit distance. Output-code constraints give additional Singleton-like bounds. Under independent and identically distributed (i.i.d.) depolarizing noise, the weight enumerators determine decoder failure probabilities and yield upper bounds on circuit pseudothresholds. Finally, we derive LP distance bounds for families of flag syndrome-extraction circuits specified by their CNOT orderings, by incorporating the t-flag criterion as additional linear constraints to the distance-bounding LP. An analytical CSS Hamming-code benchmark yields a tight distance-three bound attained by the Chao--Reichardt one-flag construction.
Related
- Synthetic twist geometry in mesoscopic quantum circuits: geometric capacitance and chiral mode splitting
- Online Scheduling and Distribution of Quantum Circuits over Quantum Networks
- Distributing Quantum Circuits Using Pre-Distributed Entanglement Pairs over Quantum Networks
- When Expressivity Is Not Enough: Discrete Routing Geometry in Variational Quantum Circuits
- Simulating and sampling from quantum circuits with 2D tensor networks
BibTeX
@misc{ghosh2026fault,
title = {{Fault tolerance of quantum circuits with tensor networks and symplectic geometry}},
author = {Soham Ghosh and Holger Boche and Andrew Tanggara},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.03429},
eprint = {2610.03429},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.03429},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Fault tolerance of quantum circuits with tensor networks and symplectic geometry
AU - Soham Ghosh
AU - Holger Boche
AU - Andrew Tanggara
PY - 2026
DA - 2026/10/29
PB - arXiv
DO - 10.48550/arxiv.2610.03429
UR - https://arxiv.org/abs/2610.03429
AB - We develop an operator-algebraic framework for analyzing fault tolerance in quantum circuits and establish necessary and sufficient conditions for exact recovery of the ideal computation under a prescribed noise model. For prescribed circuit families and noise models, we derive a semidefinite program (SDP) based test whose infeasibility certifies that there does not exist any recovery map restoring its intended operation. For non-adaptive stabilizer circuits, analyzing the stabilizer symmetries of its components with symplectic geometry, we obtain closed-form detection and logical-effect matrices that characterize circuit distance algebraically. Applied to a finite Hastings--Haah honeycomb Floquet-code circuit, these matrices certify the dynamical encoding of two logical qubits and distance four under Pauli noise including measurement errors. Using these matrices, we then derive MacWilliams identities for circuit weight enumerators and obtain linear-programming (LP) upper bounds on circuit distance. Output-code constraints give additional Singleton-like bounds. Under independent and identically distributed (i.i.d.) depolarizing noise, the weight enumerators determine decoder failure probabilities and yield upper bounds on circuit pseudothresholds. Finally, we derive LP distance bounds for families of flag syndrome-extraction circuits specified by their CNOT orderings, by incorporating the t-flag criterion as additional linear constraints to the distance-bounding LP. An analytical CSS Hamming-code benchmark yields a tight distance-three bound attained by the Chao--Reichardt one-flag construction.
ER -