2014/04/30 by Yu Tomita, Krysta M. Svore · 5 citations
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Amplitude #Code (set theory) #Computational physics #Computer science #Mathematics #Noise (video) #Pauli exclusion principle #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum and electron transport phenomena #Quantum computer #Quantum error correction #Quantum mechanics #Qubit #Surface (topology) #cs.ET #quant-ph
paper · pdf · doi:10.1103/physreva.90.062320
published as Phys.Rev. A.90, 062320 (2014) · 15 pages, 15 figures, 4 tables, comments welcome
arxiv created 2014/05/02 · openalex publication_date 2014/12/11 · arxiv updated 2014/12/12 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
Experimental implementation of the surface code will be a significant milestone for quantum computing. We develop a circuit and a decoder targeted for near-term implementation of a distance-3 surface code. We simulate the code under amplitude and phase damping and compare the threshold to a Pauli-twirl approximation. We find that the approximation yields a pessimistic threshold estimate. From numerical Monte Carlo simulations, we identify the gate and measurement speeds required to achieve reliable error correction. For superconductor devices, a qubit encoded in a 17-qubit surface code demonstrates a lower error rate than an unencoded qubit assuming gate times of 5--40 ns and T1 times of at least 1--2 \ensuremathμs. If T1\ensuremath≥10 ns, the difference is significant and can be experimentally measured, allowing near-term implementation and verification of a small surface code. For ion trap devices, gates times of 1 \ensuremathμs and T1\ensuremath≥40 ms admit measurable differences in error rate.