Error per single-qubit gate below $10^{-4}$ in a superconducting qubit
Zhiyuan Li, Pei Liu, Peng Zhao, Zhenyu Mi, Huikai Xu, Xuehui Liang,, Tang Su, Weijie Sun, Guangming Xue, Jing-Ning Zhang, Weiyang Liu, Yirong Jin,, and Haifeng Yu

TL;DR
This paper demonstrates single-qubit gates in a superconducting transmon qubit with error rates below 10^{-4}, achieving high fidelity essential for reliable quantum computing.
Contribution
The work fabricates a transmon qubit with long coherence times and achieves record low single-qubit gate errors below 10^{-4}, advancing quantum gate fidelity.
Findings
Average gate error below 10^{-4} achieved
Error budget includes decoherence and leakage errors
Non-Markovian behavior observed in long-sequence GST
Abstract
Implementing arbitrary single-qubit gates with near perfect fidelity is among the most fundamental requirements in gate-based quantum information processing. In this work, we fabric a transmon qubit with long coherence times and demonstrate single-qubit gates with the average gate error below , i.e. by randomized benchmarking (RB). To understand the error sources, we experimentally obtain an error budget, consisting of the decoherence errors lower bounded by and the leakage rate per gate of . Moreover, we reconstruct the process matrices for the single-qubit gates by the gate set tomography (GST), with which we simulate RB sequences and obtain single-qubit fedlities consistent with experimental results. We also observe non-Markovian behavior in the experiment of long-sequence GST, which may…
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 · Neural Networks and Reservoir Computing
