7 problems

Fix $t$, and let $n$ be large enough that the parameters $m_2,\ldots,m_t$ defined by … where $c\in(-1,1)$ is chosen so that $\sum_i m_i=n+1$. Let $H$ be the Tanner-code parity-chec…

Refined Singleton-bound conjecture. The minimum distance satisfies

Let $X$) be a weighted projective variety with orbifold singularities, and let $C$ be a quantum stabilizer code constructed from self-orthogonal algebraic geometry codes on $X$. Wr…

Distance bound conjecture. The distance of an $[[n,1,d]]$ $M_3$-code satisfies $d<d_{\max}$, with

Graph theory conjecture. There exists a partition

An $\left[\!\left[n,k\!:\!m,d\!:\!c\right]\!\right]_{q}$ hybrid stabilizer code has length $n$, quantum dimension $k$, classical dimension $m$, quantum minimum distance $d$, and cl…

Arbitrary finite-field homological distance conjecture. For any pair of bounded chain complexes of vector spaces over a finite field, the homological distances…