GPU-Based Parallel BP Decoding for Quantum LDPC Memory

Ming Wang; Yanbo Zhao; Ang Li; Frank Mueller

Home/Archive/arXiv

arXiv · 2610.13879

GPU-Based Parallel BP Decoding for Quantum LDPC Memory

Ming Wang·Yanbo Zhao·Ang Li·Frank Mueller

View original source ↗Read source document ↗Export metadata ↓

Abstract

Quantum low-density parity-check (qLDPC) decoding requires reliable corrections and low latency over long syndrome histories. We extend BP-SF, an oscillation-guided belief-propagation (BP) decoder with independent syndrome-flip trials, by introducing windowed and streaming operations. Our CUDA implementation combines disordered-memory retries, sliding windows, correlation-aware graphs, and layered scheduling. Circuit-level simulations test fixed-basis memory and complete logical Pauli-frame recovery. On the [[144,12,12]] bivariate bicycle code at physical error rate p = 0.002, parallel BP-SF reduces 99.9th-percentile call latency by a factor of 13.15 relative to an eight-chain Relay-BP GPU baseline on 100,000 matched samples for which every tested method's initial BP stage fails within 80 iterations. Windowed BP-SF maintains a flat logical error rate and nearly constant per-round compute time through 512 rounds, reaching a 17.1-fold speedup over monolithic decoding. In 512-round full-frame streaming decoding with 2.97-ms syndrome arrivals, layered BP-SF on a transformed joint graph with 20 retries reduces 99.9th-percentile correction-release age from 166.29 to 36.25 ms relative to the joint graph with flooding updates and 100 retries. These results connect parallel BP post-processing to lower decoding costs and earlier correction release in streaming quantum memory.

Explore related subjects

quant-ph cs.IT math.IT

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Ming Wang, Yanbo Zhao, Ang Li, Frank Mueller. 2026-10-09. GPU-Based Parallel BP Decoding for Quantum LDPC Memory. https://arxiv.org/abs/2610.13879

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Phase-space representation of classical simulability for arbitrary bosonic encodings

Phase-space representations can be used to reveal resources for quantum computational advantage. In odd-dimensional qudit systems, states and operations admitting non-negative quasi-probability representations are efficiently classically simulable, and analogous conclusions hold for bosonic systems, usually represented in quadrature phase space. However, when quantum information is encoded in bosonic systems, the link between physical phase-space representations and computational resources becomes nontrivial: large negativities may arise in the physical space even when the encoded model remains efficiently simulable. We establish a general framework connecting physical phase spaces of bosonic systems to the effective computational phase spaces associated with arbitrary encodings. We show that bosonic Hilbert spaces with finitely many modes can always be exactly encoded on a quantum computer, without truncation or approximations, and that for any encoding there exists an adapted physical phase-space representation in which all provably classically simulable states and protocols are non-negative. Conversely, negativity can always persist in physical representations for arbitrary encodings. Our results formalize the operational meaning of phase-space negativity in bosonic quantum information and its relation with computational resources.

quant-ph↗

arXiv2026

Helical Dirac Current with Local Coupling to a Chiral Potential

We show that a propagating electron wave in the lowest cylindrical channel carries a spin-resolved helical conserved current, and connect this current texture to its local chiral coupling. In a weakly relativistic positive-energy Dirac projection, the two sectors have the same azimuthally symmetric charge density and opposite circulation superposed on longitudinal flow, even though their nonrelativistic orbital harmonic is $l=0$. The current is radially distributed and extends into the evanescent tail. A scalar screw potential couples these modes through a derived vertex expressed by the \emph{chiral current overlap}, $\mathcal J_χ$. Both spatial textures determine the coupling: the environmental radial profile weights the electronic circulation, while the screw harmonic selects correlated changes of spin sector and longitudinal momentum. For a uniform static harmonic, elastic energy conservation makes the first-order spin-flip amplitude vanish within the same transverse mode. Environmental energy exchange is therefore required to activate these selected channels. The same current overlap supplies the spatial kernel for heliciton-assisted inelastic scattering in a companion study and for a subsequent transport treatment of chirality-induced spin selectivity (CISS).

quant-ph↗

arXiv2026

Magic Gate Teleportation: Structure, Useful Resource States, and Simpler Feedforward

Quantum gate teleportation is a key technique in fault-tolerant quantum computation that uses resource states to implement logical gates. Here, we develop a theory of magic gate teleportation (MGT), a form of quantum gate teleportation that uses non-stabilizer resource states to implement non-Clifford unitary gates on arbitrary input states without revealing information about those states. This setting is motivated by the canonical approach to implementing logical non-Clifford gates in fault-tolerant quantum computation. We uncover a hidden structure within MGT---after backpropagating the Pauli measurements, MGT protocols can be viewed as encoding the input state into a stabilizer code heralded by the measurement outcomes, followed by a logical non-Clifford gate. Using this structure, we construct MGT protocols for any resource state obtained by applying commuting Pauli rotations to a stabilizer state, and provide an efficient algorithm for synthesizing their circuit implementations. Conversely, we prove that directly useful single-qubit resource states are necessarily Clifford-equivalent to diagonal states, and establish the same constraint for multi-qubit resource states used in a broad class of MGT protocols. In particular, the output state distilled from the $[\![5, 1, 3]\!]$ protocol is not directly useful for any MGT protocols, though it can be probabilistically converted into directly useful states. Finally, we identify conditions under which the feedforward operators can be implemented by Pauli operators, shedding light on the paradigm of algorithmic fault tolerance and simplifying the feedforward operations needed for quantum computing.

quant-ph↗