collection

Bivariate bicycle code

A translation-invariant CSS qLDPC family built from two sparse binary polynomials on a finite two-dimensional torus. Each polynomial becomes a cyclic-shift matrix; placing the two matrices in H_X=[A|B] and the swapped transposes in H_Z=[B^T|A^T] makes commutation follow from the abelian polynomial algebra. Representative finite blocks trade planar nearest-neighbor layout for a second coupling layer and encode many logical qubits at moderate distance.

Scoped completion

Completion belongs to an entity, not the whole page

Reader-Contract complete

The full research, intuition, derivation, reproduction, and guided-tour packet is present pending human taste review.

One orienting visual

Orienting view

Inspect constructor-derived qubits, stabilizers, and logical paths without leaving the entry. Visual instance: gross

ViewStabilizersPauli
100%Drag to pan · wheel/pinch to zoom

↔ top/bottom and ↕ left/right edges are identified with matching color and arrow direction.

At a glance

Executable-target parameters

form: collection formal target: css formal target: qldpc

Constructor variables

l
positive cyclic order of x
m
positive cyclic order of y
a_terms
integer exponent pairs for the monomials of A, reduced modulo (l,m)
b_terms
integer exponent pairs for the monomials of B, reduced modulo (l,m)

Reference instances

Instancenkd
grossn=144 verifiedk=12 verifiedd=12 bounded
toric_L3n=18 verifiedk=2 verifiedd=3 verified

Scientific scope

Source, page, and formal object are separate identities

Primary entity: eczoo-entity:qcga#collection. Formalization target: eczoo-entity:qcga#collection. Legacy vocabulary: exact class projection.

Source/entity binding: clean.

Progressive disclosure

Explore this code

Choose the question you want answered; detail stays one click away.