Magic State Distillation using Asymptotically Good Codes on Qudits
Michael J. Cervia, Henry Lamm, Diyi Liu, Edison M. Murairi, and Shuchen Zhu

TL;DR
This paper introduces a new family of good triorthogonal qudit codes that enable efficient magic state distillation at lower qudit dimensions, advancing quantum error correction and fault-tolerant quantum computing.
Contribution
The authors construct the first family of asymptotically good triorthogonal codes on qudits with dimensions as low as 64, surpassing previous parameter limitations.
Findings
Achieved constant space overhead magic state distillation with qudits of size 64.
Constructed a promising [[42,14,6]] code over qudits of size 64.
Demonstrated reduction of CCZ states across different qudit dimensions with constant-depth circuits.
Abstract
Qudits offer the potential for low-overhead magic state distillation, although previous results for asymptotically good codes have required qudit dimension or code length . These parameters far exceed experimental demonstrations of qudit platforms, and thus motivate the search for better codes. Using a novel lifting procedure, we construct the first family of good triorthogonal codes on the alphabet with that lies above the Tsfasman-Vladut-Zink bound. These codes yield a family of asymptotically good quantum codes with transversal CCZ gates, enabling constant space overhead magic state distillation with qudit dimension as small as . Further, we identify a promising code with parameters . Finally, we show that a distilled can be reduced to a state for…
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 Computing Algorithms and Architecture · Quantum Information and Cryptography · Coding theory and cryptography
