Logical Magic State Preparation with Fidelity beyond the Distillation Threshold on a Superconducting Quantum Processor
Yangsen Ye, Tan He, He-Liang Huang, Zuolin Wei, Yiming Zhang, Youwei Zhao, Dachao Wu, Qingling Zhu, Huijie Guan, Sirui Cao, Fusheng Chen, Tung-Hsun Chung, Hui Deng, Daojin Fan, Ming Gong, Cheng Guo, Shaojun Guo, Lianchen Han, Na Li, Shaowei Li, Yuan Li, Futian Liang, Jin Lin, Haoran Qian, Hao Rong, Hong Su, Shiyu Wang, Yulin Wu, Yu Xu, Chong Ying, Jiale Yu, Chen Zha, Kaili Zhang, Yong-Heng Huo, Chao-Yang Lu, Cheng-Zhi Peng, Xiaobo Zhu, Jian-Wei Pan
DOI 10.1103/PhysRevLett.131.210603 · Physical Review Letters
Active bibliographic source — not scientific approval
Bibliographic access preserves source history; it does not approve extracted materials or validate reported claims. Review warnings on each occurrence separately.
Abstract
Fault-tolerant quantum computing based on surface code has emerged as an attractive candidate for practical large-scale quantum computers to achieve robust noise resistance. To achieve universality, magic states preparation is a commonly approach for introducing non-Clifford gates. Here, we present a hardware-efficient and scalable protocol for arbitrary logical state preparation for the rotated surface code, and further experimentally implement it on the Zuchongzhi 2.1 superconducting quantum processor. An average of 0.8983±0.0002 logical fidelity at different logical states with distance three is achieved, taking into account both state preparation and measurement errors. In particular, the logical magic states |Aπ/4⟩L, |H⟩L, and |T⟩L are prepared nondestructively with logical fidelities of 0.8771±0.0009, 0.9090±0.0009, and 0.8890±0.0010, respectively, which are higher than the state distillation protocol threshold, 0.859 (for H-type magic state) and 0.827 (for T-type magic state). Our work provides a viable and efficient avenue for generating high-fidelity raw logical magic states, which is essential for realizing non-Clifford logical gates in the surface code.
Similar papers
Realization of an Error-Correcting Surface Code with Superconducting Qubits
similarity 0.90Youwei Zhao et al.
Source status unknown — claims are unverified
Logic gates at the surface code threshold: Superconducting qubits poised for fault-tolerant quantum computing
similarity 0.89R. Barends et al. · 2014 · arXiv:1402.4848
Source status unknown — claims are unverified
Robust and Fast Holonomic Quantum Gates with Encoding on Superconducting Circuits
similarity 0.88Tao Chen et al.
Source status unknown — claims are unverified
Time-optimal universal quantum gates on superconducting circuits
similarity 0.87Ze Li et al.
Source status unknown — claims are unverified
Scalable nonadiabatic holonomic quantum computation on a superconducting qubit lattice
similarity 0.86Li-Na Ji et al.
Source status unknown — claims are unverified
State preservation by repetitive error detection in a superconducting quantum circuit
similarity 0.86J. Kelly et al. · 2014 · arXiv:1411.7403
Source status unknown — claims are unverified