QGPU: Parallel logic in quantum LDPC codes

TL;DR

This paper introduces clustered-cyclic quantum LDPC codes with a new parallel measurement protocol, enabling high parallelism and fault-tolerant logical operations, advancing scalable quantum error correction.

Contribution

It proposes clustered-cyclic codes with directly addressable logical bases and a parallel product surgery method, improving parallelism and fault-tolerance in quantum error correction.

Findings

Clustered-cyclic codes are competitive with state-of-the-art codes.

Parallel product surgery achieves surface-code-style maximal parallelism.

The approach preserves code distance and enables fault-tolerant logical gates.

Abstract

Quantum error correction is critical to the design and manufacture of scalable quantum computing systems. Recently, there has been growing interest in quantum low-density parity-check codes as a resource-efficient alternative to surface codes. Their adoption is hindered by the difficulty of compiling fault-tolerant logical operations. A key challenge is that logical qubits do not necessarily map to disjoint sets of physical qubits, which limits parallelism. We introduce clustered-cyclic codes, a quantum low-density parity-check code family with finite-size instances such as [[136,8,14]] and [[198,18,10]] that are competitive with state-of-the-art constructions. These codes admit a directly addressable logical basis, enabling highly parallel logical measurement layers. To leverage this structure, we propose parallel product surgery for quantum product codes. Using an auxiliary copy of the data patch and an engineered product-connection structure, the protocol performs many logical Pauli-product measurements in a single surgery round with small, fixed overhead. For clustered-cyclic codes, this yields surface-code-style maximal parallelism: up to k/2 disjoint Pauli-product measurements per round under explicit algebraic conditions. We prove that parallel product surgery preserves the code distance for hypergraph product codes and numerically verify distance preservation for the listed clustered-cyclic instances with k = 8. Finally, for the [[24,8,3]] clustered-cyclic code, treating half of the logical qubits as auxiliaries enables arbitrary parallel CNOTs on disjoint pairs; combined with symmetry-derived operations, these gates generate the full Clifford group fault-tolerantly.