Computing with qLDPC Codes by Climbing the Chain Map Hierarchy
Abstract
We develop a framework for logical computation with qLDPC codes that places logical Pauli, Clifford, and non-Clifford operations on the same footing. This brings the simple homological description of Pauli logicals to the patchwork landscape of logical Clifford and non-Clifford operations, providing a tool for the discovery of new logical gates. In particular, we define the chain map hierarchy: a family of chain complexes whose homology classes encode logical unitary and code surgery operations at any level of the Clifford hierarchy, precisely analogous to the chain complex description of Pauli logicals. Consequently, intuition for Pauli logicals can be leveraged to discover new logical operations on qLDPC codes. For instance, the familiar ability to deform Pauli logicals with stabilizers---i.e. boundaries of the chain complex---becomes a way to search for constant-depth unitary implementations of (non-)Clifford logical gates. Using this strategy, we discover constant-depth unitary implementations of the full logical Clifford group on any number of blocks of the 2D toric code, including within a single block, and addressable logical CCZ gates on any triple of logical qubits on any number of blocks of the 3D toric code. Beyond manifold codes, we find addressable non-Clifford gates on codes with many encoded qubits. The chain map hierarchy naturally encompasses and extends other constructions of logical gadgets, for instance providing a universal parameterization of cup products. As such, our work provides a unified, useful, and intuitive language for computing with qLDPC codes.
Related
- Climbing the Fusion Tree: Center Ordering and Decoding Hierarchy in Non-Abelian Mixed States
- 2 Fast 2 Surgery: Fast surgery on QLDPC codes with Õ(n(k + d)) space overhead
- Fast computational primitives for La-cross qLDPC codes
- Towards Optimal Routing Strategies for qLDPC codes on Silicon Spin Qubits
- Chromatic Block-Gibbs p-Bit Decoding of QLDPC Codes
BibTeX
@misc{sahay2026computing,
title = {{Computing with qLDPC Codes by Climbing the Chain Map Hierarchy}},
author = {Rahul Sahay and David M. Long and Vedika Khemani},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.02999},
eprint = {2609.02999},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.02999},
}
RIS
TY - UNPB
TI - Computing with qLDPC Codes by Climbing the Chain Map Hierarchy
AU - Rahul Sahay
AU - David M. Long
AU - Vedika Khemani
PY - 2026
DA - 2026/09/02
PB - arXiv
DO - 10.48550/arxiv.2609.02999
UR - https://arxiv.org/abs/2609.02999
AB - We develop a framework for logical computation with qLDPC codes that places logical Pauli, Clifford, and non-Clifford operations on the same footing. This brings the simple homological description of Pauli logicals to the patchwork landscape of logical Clifford and non-Clifford operations, providing a tool for the discovery of new logical gates. In particular, we define the chain map hierarchy: a family of chain complexes whose homology classes encode logical unitary and code surgery operations at any level of the Clifford hierarchy, precisely analogous to the chain complex description of Pauli logicals. Consequently, intuition for Pauli logicals can be leveraged to discover new logical operations on qLDPC codes. For instance, the familiar ability to deform Pauli logicals with stabilizers---i.e. boundaries of the chain complex---becomes a way to search for constant-depth unitary implementations of (non-)Clifford logical gates. Using this strategy, we discover constant-depth unitary implementations of the full logical Clifford group on any number of blocks of the 2D toric code, including within a single block, and addressable logical CCZ gates on any triple of logical qubits on any number of blocks of the 3D toric code. Beyond manifold codes, we find addressable non-Clifford gates on codes with many encoded qubits. The chain map hierarchy naturally encompasses and extends other constructions of logical gadgets, for instance providing a universal parameterization of cup products. As such, our work provides a unified, useful, and intuitive language for computing with qLDPC codes.
ER -