Lattice surgery-based logical state teleportation via noisy links
arXiv:2504.15747 · doi:10.1103/ppng-vbqj
Abstract
For planar architectures surface code-based quantum error correction is one of the most promising approaches to fault-tolerant quantum computation. This is partially due to the variety of fault-tolerant logical protocols that can be implemented in two dimensions using local operations. One such protocol is the lattice surgery-based logical state teleportation, which transfers a logical quantum state from an initial location on a quantum chip to a target location through a linking region of qubits. This protocol serves as a basis for higher-level routines, such as the entangling CNOT gate or magic state injection. In this work we investigate the correctability phase diagram of this protocol for distinct error rates inside the surface code patches and within the linking region. We adopt techniques from statistical physics to describe the numerically observed crossover regime between correctable and uncorrectable quantum error correction phases, where the correctability depends on the separation between the initial and target locations. We find that inside the crossover regime the correctability-threshold lines decay as a power law with increasing separation, which we explain accurately using a finite-size scaling analysis. Our results indicate that the logical state teleportation protocol can tolerate much higher noise rates in the linking region compared to the bulk of the surface code patches, provided the separation between the positions is relatively small.
References in corpus (35)
- Fault-tolerant quantum computation by anyons
- Surface codes: Towards practical large-scale quantum computation
- Topological quantum memory
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- Suppressing quantum errors by scaling a surface code logical qubit
- Logical quantum processor based on reconfigurable atom arrays
- Quantum error correction below the surface code threshold
- Surface code quantum computing by lattice surgery
- A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
- Stim: a fast stabilizer circuit simulator
- Critical properties of the measurement-induced transition in random quantum circuits
- Magic state distillation with low overhead
- Confinement-Higgs transition in a disordered gauge theory and the accuracy threshold for quantum memory
- Optimal Resources for Topological 2D Stabilizer Codes: Comparative Study
- Strong Resilience of Topological Codes to Depolarization
- Logical-qubit operations in an error-detecting surface code
- Entangling logical qubits with lattice surgery
- Error Threshold for Color Codes and Random 3-Body Ising Models
- Poking holes and cutting corners to achieve Clifford gates with the surface code
- Encoding a magic state with beyond break-even fidelity
- Sparse Blossom: correcting a million errors per core second with minimum-weight matching
- Statistical mechanical models for quantum codes with correlated noise
- Universal quantum computing with twist-free and temporally encoded lattice surgery
- A fault-tolerant non-Clifford gate for the surface code in two dimensions
- Logical blocks for fault-tolerant topological quantum computation
- Experimental Demonstration of Logical Magic State Distillation
- Scaling and logic in the color code on a superconducting quantum processor
- A circuit-level protocol and analysis for twist-based lattice surgery
- Creating entangled logical qubits in the heavy-hex lattice with topological codes
- Inplace Access to the Surface Code Y Basis
- Error-corrected Hadamard gate simulated at the circuit level
- Universal quantum computation in the surface code using non-Abelian islands
- Fundamental thresholds of realistic quantum error correction circuits from classical spin models
- Characterization of errors in a CNOT between surface code patches
- Rare Events and Griffiths Phases in Topological Quantum Error Correction