Dense packing of the surface code: code deformation procedures and hook-error-avoiding gate scheduling

TL;DR

This paper introduces a detailed deformation procedure and a hook-error-avoiding gate scheduling for densely packed surface codes, reducing qubit overhead and improving logical error rates in fault-tolerant quantum computing.

Contribution

It presents a concrete code-deformation method and a novel gate scheduling scheme that suppresses hook errors in densely packed surface codes, with quantitative error analysis.

Findings

Densely packed surface codes can achieve lower logical error rates than standard codes.

Hook-error-avoiding syndrome extraction is essential for improved performance.

Numerical simulations confirm benefits increase with code distance and lower physical error rates.

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.