Dense packing of the surface code: code deformation procedures and hook-error-avoiding gate scheduling
arXiv:2511.06758 · doi:10.1103/7lm4-3bnh
Abstract
The surface code is one of the leading quantum error correction codes for realizing large-scale fault-tolerant quantum computing (FTQC). One major challenge in realizing surface-code-based FTQC is the extremely large number of qubits required. To mitigate this problem, fusing multiple codewords of the surface code into a densely packed configuration has been proposed. It is known that by using dense packing, the number of physical qubits required per logical qubit can be reduced to approximately three-fourths compared to simply placing surface-code patches side by side. Despite its potential, concrete deformation procedures and quantitative error-rate analyses have remained largely unexplored. In this work, we present a detailed code-deformation procedure that transforms multiple standard surface code patches into a densely packed, connected configuration, along with a conceptual microarchitecture to utilize this dense packing. We also propose a CNOT gate-scheduling for stabilizer measurement circuits that suppresses hook errors in the densely packed surface code. We performed circuit-level Monte Carlo noise simulation of densely packed surface codes using this gate scheduling. The numerical results demonstrate that as the code distance of the densely packed surface code increases and the physical error rate decreases, the logical error rate of the densely packed surface code becomes lower than that of the standard surface code. Furthermore, we find that only when employing hook-error-avoiding syndrome extraction can the densely packed surface code achieve a lower logical error rate than the standard surface code, while simultaneously reducing the space overhead.
17 pages, 18 figures. Published in Phys. Rev. A 113, 042412 (2026)
References in corpus (21)
- Fault-tolerant quantum computation by anyons
- Surface codes: Towards practical large-scale quantum computation
- Quantum Error Correction for Quantum Memories
- Reliable Quantum Computers
- Quantum algorithms for quantum chemistry and quantum materials science
- How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
- Quantum error correction below the surface code threshold
- Surface code quantum computing by lattice surgery
- Computing with spin qubits at the surface code error threshold
- A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
- Stim: a fast stabilizer circuit simulator
- Low-distance Surface Codes under Realistic Quantum Noise
- Even more efficient quantum computations of chemistry through tensor hypercontraction
- Optimal Resources for Topological 2D Stabilizer Codes: Comparative Study
- Sparse Blossom: correcting a million errors per core second with minimum-weight matching
- Quantum Measurements and Gates by Code Deformation
- Universal quantum computing with twist-free and temporally encoded lattice surgery
- Lattice Surgery with a Twist: Simplifying Clifford Gates of Surface Codes
- Surface code compilation via edge-disjoint paths
- A circuit-level protocol and analysis for twist-based lattice surgery
- State injection, lattice surgery and dense packing of the deformation-based surface code