Compressing Syndrome Measurement Sequences

Abstract

In this work, we analyze a framework for constructing fault-tolerant measurement schedules of varying lengths by combining stabilizer generators, and prove results about the distance of such schedules by combining according to classical codes. Using this framework, we produce explicit measurement schedules sufficient for fault-tolerant error correction of quantum codes of distance $d$ with $r$ independent stabilizer generators using only $O(d \log{r})$ measurements if the code is LDPC, and $O(d \log d \log r)$ measurements if the code is produced via concatenating a smaller code with itself $O(\log d)$ times. In both of these cases the number of measurements can be asymptotically fewer than the number of stabilizer generators which define the code. Although optimizing our construction to use the fewest measurements produces high-weight stabilizers, we also show that we can reduce the number of measurements used for specific examples while maintaining low-weight stabilizer measurements. We numerically examine the performance of our construction on the surface code under several noise models and demonstrate the exponential error suppression with increasing distance which is characteristic of weak fault tolerance.