Error correction of transversal CNOT gates for scalable surface code computation: Part 2

ORAL

Abstract

Recent experimental advances have made it possible to implement logical multi-qubit transversal gates on surface codes in a multitude of platforms. A transversal controlled-NOT (tCNOT) gate on two surface codes introduces correlated errors across the code blocks and thus requires modified decoding compared to established methods of decoding surface code quantum memory (SCQM) or lattice surgery operations. Here, we examine and benchmark the performance of different decoding strategies for the tCNOT for scalable, fault-tolerant quantum computation. In particular, we present a low-complexity decoder based on minimum-weight perfect matching (MWPM) that achieves the same threshold as the SCQM MWPM decoder, and discuss analytical threshold bounds for this approach. We extend our analysis with a study of tailored decoding of a transversal teleportation circuit, along with a comparison between the performance of lattice surgery and transversal operations under Pauli and erasure noise models. Our investigation builds towards systematic estimation of the cost of implementing large-scale quantum algorithms based on transversal gates in the surface code.

*This work was supported by the National Science Foundation (QLCI grant OMA2120757). Any opinions, findings, and conclusions or recommendations expressed in this publication are those of the authors and do not necessarily reflect the views of NSF.

Publication: https://arxiv.org/abs/2408.01393

Presenters

  • Yingjia Lin

    • Duke University

Authors

  • Yingjia Lin

    • Duke University
  • Kaavya Sahay

    • Yale University
  • Shilin Huang

    • Yale University
    • Duke University
  • Kenneth R Brown

    • Duke University
    • Duke
  • Shruti Puri

    • Yale University