Searcharxiv⌕ Search

arXiv subjects

Guangqi Zhao

Publications and source records attributed to Guangqi Zhao.

4 recordsLinked to original sources

Proxima: Optimizing Syndrome Extraction Circuit Scheduling for Practical Quantum LDPC Codes

The fault-tolerant performance of quantum error correction codes relies critically on the scheduling of parity checks in syndrome extraction circuits (SECs). For general CSS-type quantum low-density parity-check (qLDPC) codes, the vast scheduling space and intricate error-propagation patterns make it computationally prohibitive to directly optimize the logical error rate (LER) or the exact circuit-level distance ($d_{\mathrm{circ}}$). To address this challenge, we introduce Proxima, a highly effective automated SEC scheduling framework guided by a distance-related metric termed proximity. Defined directly on the detector error model (DEM), proximity quantifies the minimum number of additional faults required to complete a seed fault to an undetectable logical failure, naturally capturing arbitrary circuit-level fault mechanisms and bounding $d_{\mathrm{circ}}$ from above. Proxima synthesizes a pool of valid schedules at a target depth and ranks them by evaluating proximity within small, graph-local DEM fault subsets, progressively enlarging the subset only to break ties among top-ranked candidates. Across a broad spectrum of qLDPC code families, Proxima consistently attains low circuit depths and high circuit-level distance bounds, reducing LER by 1.4--2.6$\times$ over the strongest automated baseline and up to $40\times$ over others while generalizing robustly across noise models and decoders. Furthermore, by exploiting translational symmetry via a compact monomial representation, Proxima discovers depth-8 uniform schedules for bivariate bicycle codes that surpass even IBM's depth-7 reference schedule [Nature, 2024] by 2.1--5.1$\times$, establishing the DEM-level proximity as a practical objective for fault-tolerant compilation.

quant-ph↗

Improved energy barrier in higher-dimensional hypergraph product codes

Single-shot error correction outperforms conventional approaches by requiring only one round of stabilizer measurements for decoding, even in the presence of measurement errors. This capability relates to the confinement property of codes, which provides an energy barrier lower bound. Earlier research established a confinement property for higher-dimensional hypergraph product (HHGP) codes (Quintavalle et al. 2021 PRX Quantum), yielding an energy barrier lower bound for these codes. In this work, by analyzing the structure of logical operators, we show an improved energy barrier lower bound for HHGP codes with low-density parity-check (LDPC) property. Our bound exceeds results derived from confinement alone, and unlike standard hypergraph product codes, these higher dimensional variants can possess macroscopic energy barriers even when the underlying classical codes lack this property. Specifically, our analysis shows that the energy barrier of LDPC HHGP codes is lower bounded by the distance of the underlying classical codes. This bound is tight if the underlying classical codes exhibit system size-dependent distances but constant energy barriers, like 3D and 4D toric codes.

quant-ph↗

A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes

Quantum low-density parity-check codes reduce quantum error correction overhead but require dense, long-range connectivity that challenges hardware implementation, particularly for superconducting processors. We address this problem by demonstrating that long-range connections can be reduced at the cost of increased syndrome extraction circuit depth. Our approach is based on the observation that X and Z ancilla qubits form short loops with data qubits - a property that holds for any quantum code. This enables implementing stabilizer measurement circuits by routing data qubit information through ancilla qubits when direct connections are unavailable. For bivariate bicycle codes, we remove up to 50% of long-range connections while approximately doubling the circuit depth, with the circuit-level distance remaining largely preserved. This method can also be applied to surface codes, achieving the same hexagonal connectivity requirement as McEwen et al. (Quantum 7, 1172 (2023)). Our routing approach for designing syndrome extraction circuits is applicable to diverse quantum codes, offering a practical pathway toward their implementation on hardware with connectivity constraints.

quant-ph↗

On the energy barrier of hypergraph product codes

A macroscopic energy barrier is a necessary condition for self-correcting quantum memory. In this paper, we prove tight bounds on the energy barrier applicable to any quantum code obtained from the hypergraph product of two classical codes. If the underlying classical codes are low-density parity-check codes (LDPC), the energy barrier of the quantum code is shown to be the minimum energy barrier of the underlying classical codes (and their transposes) up to an additive $O(1)$ constant.

quant-ph↗