IEEE Journal on Selected Areas in Communications · 2024 · 14 citations · 29 references
Natural SciencesComputer SciencePhysicsFault-tolerant ComputingQuantum ComputingQuantum MechanicsCoding TheoryError-correcting CodesChannelsLogical Error RatesQuantum Error-correcting CodesStabilizer CodesSurface CodesWeight Distribution
Surface codes are versatile quantum error-correcting codes known for their planar geometry, making them ideal for practical implementations. While the original proposal used Pauli <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">X</i> or Pauli <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Z</i> operators in a square structure, these codes can be improved by rotating the lattice or incorporating a mix of generators in the XZZX variant. However, a comprehensive theoretical analysis of the logical error rate for these variants has been lacking. To address this gap, we present theoretical formulas based on recent advancements in understanding the weight distribution of stabilizer codes. For example, over an asymmetric channel with asymmetry <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">A</i> = 10 and a physical error rate <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">p</i> → 0, we observe that the logical error rate asymptotically approaches <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">p</i> <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">L</sub> → 10 <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">p</i> <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> for the rotated [[9, 1, 3]] XZZX code and <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">p</i> <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">L</sub> → 18.3 <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">p</i> <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> for the [[13, 1, 3]] surface code. Additionally, we observe a particular behavior regarding rectangular lattices in the presence of asymmetric channels. Our findings demonstrate that implementing both rotation and XZZX modifications simultaneously can lead to suboptimal performance. Thus, in scenarios involving a rectangular lattice, it is advisable to avoid using both modifications simultaneously.
29
H. J. Kimble · Nature · 2008 · 5.8K citations · Full text
Scheme for reducing decoherence in quantum computer memory
Peter W. Shor · Physical Review A · 1995 · 4.5K citations
Computing, Computer Science, Physics +13
Surface codes: Towards practical large-scale quantum computation
Austin G. Fowler, M. Mariantoni, John M. Martinis et al. · Physical Review A · 2012 · 3K citations · Full text
Computing, Computer Science, Physics +17
Quantum error correction for quantum memories
Barbara M. Terhal · Reviews of Modern Physics · 2015 · 1.4K citations · Full text
Computing, Computer Science, Physics +17
Suppressing quantum errors by scaling a surface code logical qubit
Rajeev Acharya, I. L. Aleǐner, R. M. Allen et al. · Nature · 2023 · 1.1K citations · Full text