4 problems

Let $L,k\in\mathbb{N}$, and consider the optimization problem in which an optimal set $S$ is sought for the worst-case decoding probability in Eq. (worst-prob). Boolean optimal-set…

Let $L,k\in\mathbb{N}$, and let $P^*_{\rm Q}(L,k)$ denote the optimal worst-case decoding success probability of an $(L,k)$-QRAC. Mančinska–Vidick's conjectured bound. The worst-ca…

Let $q=2$. For each dimension $k$, let $\mathcal{G}_k=\mathcal{F}\cup\mathcal{N}$ be the point set in $\mathrm{PG}(k-1,2)$ consisting of the fundamental points…

The paper considers the operational information-processing task defined by its parity-oblivious $d$-level random access code protocol, and the associated noncontextuality inequalit…