Pith. sign in

REVIEW 7 cited by

Quantum two-block group algebra codes

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2306.16400 v1 pith:F2A5RNXM submitted 2023-06-28 quant-ph math-phmath.MP

Quantum two-block group algebra codes

classification quant-ph math-phmath.MP
keywords codesgroupgroupsquantumabelianalgebraclassicalnon-abelian
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
abstract

We consider quantum two-block group algebra (2BGA) codes, a previously unstudied family of smallest lifted-product (LP) codes. These codes are related to generalized-bicycle (GB) codes, except a cyclic group is replaced with an arbitrary finite group, generally non-abelian. As special cases, 2BGA codes include a subset of square-matrix LP codes over abelian groups, including quasi-cyclic codes, and all square-matrix hypergraph-product codes constructed from a pair of classical group codes. We establish criteria for permutation equivalence of 2BGA codes and give bounds for their parameters, both explicit and in relation to other quantum and classical codes. We also enumerate the optimal parameters of all inequivalent connected 2BGA codes with stabilizer generator weights $W \le 8$, of length $n \le 100$ for abelian groups, and $n \le 200$ for non-abelian groups.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 7 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Logical Spectroscopy: Lifted-Product Codes with Addressable Bases

    quant-ph 2026-07 accept novelty 7.0

    Logical spectroscopy decomposes Abelian lifted-product codes into Frobenius packets, builds a complete addressable conjugate logical basis by finite-field algebra plus idempotent lifts, and supplies design diagnostics...

  2. Evolutionary Discovery of Bivariate Bicycle Codes with LLM-Guided Search

    quant-ph 2026-06 unverdicted novelty 7.0

    An LLM-guided evolutionary workflow discovers 465 distinct bivariate bicycle and perturbed quantum LDPC codes at n ≤ 360, recovering known codes and reporting new examples such as [[288,16,12]].

  3. Fast and Parallel High-Rate STAR Architecture for Megaquop Quantum Simulation

    quant-ph 2026-06 unverdicted novelty 6.0

    A symmetry-co-designed high-rate QEC architecture with parallel STAR injection on bivariate bicycle codes achieves ~5.5x space savings for TFIM and Fermi-Hubbard simulations versus surface-code STAR.

  4. Algebra of Bivariate-Bicycle Surface Codes

    quant-ph 2026-06 unverdicted novelty 6.0

    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 correction...

  5. Translation-invariant quantum low-density parity-check codes from compactified fracton models

    quant-ph 2026-05 unverdicted novelty 6.0

    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.

  6. Louvre: Relaxing Hardware Requirements of Quantum LDPC Codes by Routing with Expanded Quantum Instruction Set

    quant-ph 2025-08 conditional novelty 6.0

    Louvre cuts the qubit connectivity degree of generalized bicycle codes by up to one-third using iSWAP-based routing, achieving comparable simulated logical error rates.

  7. Multivariate Multicycle Codes for Complete Single-Shot Decoding

    quant-ph 2026-01 conditional novelty 5.0

    Koszul complexes built from four polynomial generators over cyclic group rings yield CSS codes with both X and Z metachecks, giving small, high-confinement, single-shot-decodable quantum codes.