Presentation
Syndrome Extraction Circuits with Near-Optimal Depths for Practical Quantum Error Correcting Code Families
DescriptionFault-tolerant quantum computing relies on low-depth and high-fidelity syndrome extraction in quantum error correcting codes. We propose a scheduling strategy for syndrome extraction circuits in the broad class of quasi-abelian lifted-product codes, encompassing both hypergraph product and bivariate bicycle codes. Our approach constructs syndrome extraction circuits with CNOT depths no more than one layer above the fundamental lower bound, frequently achieving optimal depth. A pipelined variant further reduces the average depth per round, and the strategy generalizes naturally to higher-dimensional product codes. This scheduling framework enables computational speedups for quantum computing architectures built on these codes, all while preserving high-fidelity error correction.
Event Type
Research Manuscript
TimeTuesday, July 281:30pm - 1:42pm PDT
LocationMtg Room 203AB
