8 problems

A quantum low-density parity-check code is a quantum error-correcting code with sparse parity checks, and an adversarial error is an error chosen without a probabilistic restrictio…

Let $D$ denote the embedding dimension, and let a color route be the finite sequence of points in the qubit grid $[L]^{D-2}$ used to route a pair of qubits within the support of an…

Optimal constant-queue routing conjecture. The 3D Layer Code can be generalized using an optimal routing algorithm with $O(1)$ queue: all $X$ checks can be routed in parallel in on…

Consider the constructed planar quantum low-density parity-check codes, which preserve geometric locality and the LDPC structure. Let the (pseudo)-threshold denote the noise thresh…

The code families are planar quantum low-density parity-check codes whose logical dimension is $k$ and whose code distance is $d$. Their stabilizers have a range determined by the…

Let $p$ be prime, and let $SL(2,\mathbb{Z}_p)$ denote the group of $2\times 2$ matrices over $\mathbb{Z}_p$ with determinant one. Consider quantum Margulis codes constructed from t…

A quantum low-density parity-check (QLDPC) code is a quantum error-correcting code represented by a sparse stabilizer parity-check matrix, and weak symmetry informally means that t…

Let LSD denote the localized statistics decoding algorithm for quantum low-density parity-check codes, with clusters initialized and grown using input reliabilities. LSD's erasure-…