Iteratively decoded magic state distillation
Kwok Ho Wan

TL;DR
This paper demonstrates efficient iterative decoding of magic state distillation circuits using surface codes, achieving rapid error suppression and providing benchmarking methods for stabiliser proxies.
Contribution
It introduces a fast, re-configurable architecture for magic state distillation with iterative decoding, confirmed to suppress errors effectively.
Findings
Distillation circuits suppress input error rate to cubic order
Fast distillation achievable in constant code cycles
ZX-calculus and Pauli webs used for benchmarking
Abstract
We present numerical simulation results for the 7-to-1 and 15-to-1 state distillation circuits, constructed using transversal CNOTs acting on multiple surface code patches. The distillation circuits are decoded iteratively using the method outlined in [arXiv:2407.20976]. We show that, with a re-configurable qubit architecture, we can perform fast magic state distillation in code cycles. We confirm that both circuits suppress an injected input error rate to in the presence of additional circuit-level noise. We also outline how ZX-calculus and Pauli webs can be used to benchmark stabiliser proxies for these distillation circuits.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum, superfluid, helium dynamics · Time Series Analysis and Forecasting · Paranormal Experiences and Beliefs
