The surface code is a promising route towards large-scale quantum computing, requiring only nearest-neighbour gates amenable to superconducting hardware. However, surface codes incur large qubit overheads. Novel quantum low-density parity check (qLDPC) codes promise to reduce overheads but require long-range connections that are difficult to achieve on superconducting platforms. Here, we introduce "Vine Codes" - qLDPC codes that are implementable on a planar square grid through nearest-neighbour, two-qubit gates native to superconducting platforms (iSWAP and CZ). Our approach generalises "Directional Codes" recently introduced by Gehér et. al. (2025) which are constrained to a torus. In contrast, vine codes have open boundary conditions constructed with the aid of routing qubits. We perform extensive numeric searches and find promising candidate vine codes, e.g. [[121,4,6]], [[221,6,7]], and [[234,9,6]] codes. We verify the circuit distances and show that data and measure qubits required can be reduced by up to ~28% relative to the surface code at a circuit distance of 7. Even including routing qubits, vine codes require fewer total qubits than the surface code (e.g. ~18% reduction at circuit distance 10) and benefits are expected to increase at higher distances. We perform circuit-level noise simulations to demonstrate that under a realistic noise model and at a near-term noise rate of
10−3, vine codes can perform better than the surface code while using fewer qubits. We give an exhaustive list of all unique vine codes up to stabiliser-weight 9. We additionally introduce "Flip-Vine Codes" which possess single-qubit transversal Clifford gates useful for fault-tolerant logic and magic state cultivation. We furthermore construct examples of generalised open boundaries for vine codes that go beyond the familiar X/Z boundaries of the surface and tile codes.
Belief propagation (BP) combined with ordered statistics decoding (OSD) provides a good balance between accuracy and complexity for many quantum error correction (QEC) codes, making it nearly universal. However, the complexity of OSD can limit real-time decoding, particularly for superconducting qubits, and the limits of classical hardware decoders have not been fully explored. Therefore, it is important to assess the architecture of OSD for different code families, such as surface codes and bicycle bivariate codes, under realistic assumptions like the detector error model. This paper introduces a BP + OSD parallel architecture implemented on FPGA and ASIC for surface codes (distances 3–21) and bicycle bivariate codes (distances 6–24). Results show that for surface codes up to distance 9, the OSD post-processor fits into a single VCU129 FPGA, achieving a frequency of 200 MHz with a worst-case latency of 134 μ s. For bicycle bivariate codes, the limit is distance 12, with a frequency of 244 MHz and a worst-case latency of 84 μ s. In ASIC, with 45 nm technology, latency improves by 31%, but area resources grow significantly, making parallel implementation beyond distance 12 impractical on a single chip. The designs were verified using a hardware emulator, ensuring that the decoder’s behavior matches software simulations and revealing interesting results like potential error floors at low logical error rates.
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{\mu}\mathrm{s}$. If ${T}_{1}\ensuremath{\ge}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{\mu}\mathrm{s}$ and ${T}_{1}\ensuremath{\ge}40$ ms admit measurable differences in error rate.