Vine codes generalize directional codes to open planar boundaries, delivering up to 28% fewer data/measure qubits at circuit distance 7 and better simulated performance than the surface code at 10^{-3} noise while using fewer total qubits.
Title resolution pending
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
citation-role summary
dataset 1
citation-polarity summary
fields
quant-ph 5verdicts
UNVERDICTED 5roles
dataset 1polarities
use dataset 1representative citing papers
HAL heuristic produces explicit layouts for bivariate bicycle, tile, radial, and Tanner qLDPC codes on multilayer superconducting hardware, demonstrating that open-boundary designs reduce hardware demands with only moderate loss in logical efficiency.
BBS code dimension equals the algebraic multiplicity of finite nonzero common roots of the defining bivariate polynomials, enabling a root-based prescription for arbitrary boundary shapes that avoids corner corrections when edge conditions hold.
Compactification of a single higher-dimensional hypergraph-product fracton model yields a broad family of translation-invariant quantum LDPC codes that includes fracton models and all A2BGA codes such as BB codes.
CAbLECAR provides a robotics-inspired shuttle scheduler that enables QLDPC codes on tileable spin-qubit hardware, yielding up to 86% faster schedules and orders-of-magnitude gains in encoding efficiency and logical error rates over surface codes.
citing papers explorer
-
Vine Codes: Low-Overhead Quantum LDPC Codes on a Planar Square Grid
Vine codes generalize directional codes to open planar boundaries, delivering up to 28% fewer data/measure qubits at circuit distance 7 and better simulated performance than the surface code at 10^{-3} noise while using fewer total qubits.
-
Placing and routing quantum LDPC codes in multilayer superconducting hardware
HAL heuristic produces explicit layouts for bivariate bicycle, tile, radial, and Tanner qLDPC codes on multilayer superconducting hardware, demonstrating that open-boundary designs reduce hardware demands with only moderate loss in logical efficiency.
-
Algebra of Bivariate-Bicycle Surface Codes
BBS code dimension equals the algebraic multiplicity of finite nonzero common roots of the defining bivariate polynomials, enabling a root-based prescription for arbitrary boundary shapes that avoids corner corrections when edge conditions hold.
-
Translation-invariant quantum low-density parity-check codes from compactified fracton models
Compactification of a single higher-dimensional hypergraph-product fracton model yields a broad family of translation-invariant quantum LDPC codes that includes fracton models and all A2BGA codes such as BB codes.
-
CAbLECAR: efficiently scheduling QLDPC codes on a tileable spin qubit chip with shuttling
CAbLECAR provides a robotics-inspired shuttle scheduler that enables QLDPC codes on tileable spin-qubit hardware, yielding up to 86% faster schedules and orders-of-magnitude gains in encoding efficiency and logical error rates over surface codes.