Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published October 27, 2020 | Supplemental Material + Published
Journal Article Open

Very low overhead fault-tolerant magic state preparation using redundant ancilla encoding and flag qubits

Abstract

Fault-tolerant quantum computing promises significant computational speedup over classical computing for a variety of important problems. One of the biggest challenges for realizing fault-tolerant quantum computing is preparing magic states with sufficiently low error rates. Magic state distillation is one of the most efficient schemes for preparing high-quality magic states. However, since magic state distillation circuits are not fault-tolerant, all the operations in the distillation circuits must be encoded in a large distance error-correcting code, resulting in a significant resource overhead. Here, we propose a fault-tolerant scheme for directly preparing high-quality magic states, which makes magic state distillation unnecessary. In particular, we introduce a concept that we call redundant ancilla encoding. The latter combined with flag qubits allows for circuits to both measure stabilizer generators of some code, while also being able to measure global operators to fault-tolerantly prepare magic states, all using nearest neighbor interactions. We apply such schemes to a planar architecture of the triangular color code family and demonstrate that our scheme requires at least an order of magnitude fewer qubits and space–time overhead compared to the most competitive magic state distillation schemes. Since our scheme requires only nearest-neighbor interactions in a planar architecture, it is suitable for various quantum computing platforms currently under development.

Additional Information

© The Author(s) 2020. This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/. Received 30 April 2020; Accepted 10 September 2020; Published 27 October 2020. C.C. acknowledges Yihe Tang and Milan Cvitkovic for their help in setting up the computing resources with the AWS clusters that were used for performing all the numerical simulations in this work. We would like to thank Earl Campbell, Aleksander Kubica and Fernando Brandao for useful discussions. We thank Simone Severini, Bill Vass and Dominique L'Eplattenier for their guidance and help with submitting the paper. We also thank Kevin Dothager for his help with IP. Data availability: All the data used to generate the results of our work can be found in the public repository https://github.com/einsteinchris/MagicStatePrep.git under the file name DataMagicStatePrepSim.nb. Code availability: The code used to generate the data in this work cannot be shared due to proprietary reasons. Author Contributions: C.C. and K.N. conceived the idea of redundant ancilla encoding, designed the fault-tolerant circuits for both syndrome extraction and measuring Hadamard, and proved the fault-tolerant properties of the magic state preparation protocol. C.C. performed the numerics and overhead analysis. C.C. and K.N. wrote the manuscript. The authors declare no competing interests.

Attached Files

Published - s41534-020-00319-5.pdf

Supplemental Material - 41534_2020_319_MOESM1_ESM.pdf

Files

41534_2020_319_MOESM1_ESM.pdf
Files (2.9 MB)
Name Size Download all
md5:3016fb827e67196617bcfda5b30104d6
1.4 MB Preview Download
md5:72e7e51c982b82e0ce01852d41837dfd
1.5 MB Preview Download

Additional details

Created:
August 22, 2023
Modified:
October 23, 2023