9 problems

Let the quantum preferential attachment (QPA) model have parameter $alpha>1$, and let the classical random (CR) model use parameter $r=1$ at the corresponding value of $alpha$. As…

Let $(G_n)$ be a sequence of graphs, and let AGME denote asymptotically genuine multipartite entanglement for the corresponding quantum networks. The bounded-diameter conjecture. I…

In a graph-braided anyon model, charge conservation for a subset of particles imposes diagonality conditions on the corresponding braiding exchange operator in a basis where that s…

Consider the trijunction $\Gamma_T$ and the simplified anyon models whose symbols have at most four labels. Let $N_0(\Gamma_T)$ denote the particle number beyond which all consiste…

Let $\Gamma$ be a graph, and let $N_0(\Gamma)$ be a number such that the consistency relations for all particle numbers $N>N_0(\Gamma)$ are satisfied by solutions of the consistenc…

A graph-braided anyon fusion model assigns braiding exchange operators to graph-braid generators and satisfies polygon equations expressing compatibility between fusion and braidin…

Let $\mu$ be the dodecahedron protocol, and let $g(C,\mu)$ and $\gamma_2(C,\mu)$ denote its verification quantities. An intelligent direction is a direction specified by the vector…

Let $M\geq3$ be an integer and let $0\leq C\leq1$. For the polygon protocol, $g(C,M)$ denotes its optimal verification value. Polygon protocol conjecture. … Numerical calculation i…

Cacciapuoti's graph-decoupling conjecture. The graph decouples in the vicinity of the energy threshold.