Canonical Form and Finite Blocklength Bounds for Stabilizer Codes
Abstract
First, a canonical form for stabilizer parity check matrices of arbitrary size and rank is derived. Next, it is shown that the closely related canonical form of the Clifford group can be computed in timeO(n3) fornqubits, which improves upon the previously known timeO(n6). Finally, the related problem of finite blocklength bounds for stabilizer codes and Pauli noise is studied. A finite blocklength refinement of the hashing bound is derived, and it is shown that no argument that uses guessing the error as a substitute for guessing the coset can lead to a significantly better achievability bound.
Fields of Study & Subjects
Advanced Numerical Methods in Computational Mathematics
Induction Heating and Inverter Technology
Advanced Control Systems Optimization
Publication details
- Journal / source
- IEEE Transactions on Information Theory
- Volume
- 72
- Issue
- 6
- Pages
- 3979–4000
- Publication date
- 27 April 2026
- Language
- EN