Affiliation:
1. Quantum Architectures and Computation Group, Microsoft Research, Redmond, WA 98052, USA
2. Station Q, Microsoft Research, Santa Barbara, CA 93106-6105, USA
Abstract
We present several different codes and protocols to distill T, controlled-S, and Toffoli (or CCZ) gates. One construction is based on codes that generalize the triorthogonal codes, allowing any of these gates to be induced at the logical level by transversal T. We present a randomized construction of generalized triorthogonal codes obtaining an asymptotic distillation efficiency γ→1. We also present a Reed-Muller based construction of these codes which obtains a worse γ but performs well at small sizes. Additionally, we present protocols based on checking the stabilizers of CCZ magic states at the logical level by transversal gates applied to codes; these protocols generalize the protocols of. Several examples, including a Reed-Muller code for T-to-Toffoli distillation, punctured Reed-Muller codes for T-gate distillation, and some of the check based protocols, require a lower ratio of input gates to output gates than other known protocols at the given order of error correction for the given code size. In particular, we find a 512 T-gate to 10 Toffoli gate code with distance 8 as well as triorthogonal codes with parameters [[887,137,5]],[[912,112,6]],[[937,87,7]] with very low prefactors in front of the leading order error terms in those codes.
Publisher
Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften
Subject
Physics and Astronomy (miscellaneous),Atomic and Molecular Physics, and Optics
Reference31 articles.
1. S. Bravyi and J. Haah, ``Magic-state distillation with low overhead,'' Physical Review A 86, 052329 (2012), 1209.2426.
2. J. Haah, M. B. Hastings, D. Poulin, and D. Wecker, ``Magic state distillation with low space overhead and optimal asymptotic input count,'' Quantum 1, 31 (2017), 1703.07847v1.
3. E. Knill, ``Fault-tolerant postselected quantum computation: Schemes,'' (2004a), quant-ph/0402171v1.
4. E. Knill, ``Fault-tolerant postselected quantum computation: Threshold analysis,'' (2004b), quant-ph/0404104v1.
5. S. Bravyi and A. Kitaev, ``Universal quantum computation with ideal Clifford gates and noisy ancillas,'' Phys. Rev. A 71, 022316 (2005), quant-ph/0403025.
Cited by
41 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献