Skip to content

Author

Joseph Slote

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

Polynomial Bohnenblust--Hille bounds for product of cyclic groups

Fix an integer $K\ge2$, and let $C_K^n =\{(e^{\frac{2\pi ij}{K}})_{j=0}^{K-1}\}^n$ be the product of cyclic groups of order $K$. For a Fourier character $\chi_\alpha$, let $s(\alpha)$ be the number of active coordinates. We give a self-contained proposed proof that the dimension-free Bohnenblust--Hille constants governed by interaction order grow polynomially: if $p_d=2d/(d+1)$ and \[ \gamma_2=\frac12, \qquad \gamma_K=\frac{K\log(K-1)}{4(K-2)}\quad(K\ge3), \] then the $\ell^{p_d}$ norm of Fourier coefficients $\{\hat f(\alpha)\}$ is bounded by $L^\infty$ norm of $f$ multiplied by $C(K) d^{4\gamma_K+5}$. The constant $C(K)$ is actually at most of the order $K^{5/2}$.

Joseph Slote, Alexander Volberg · 1 citation
Preprint Aug 2026

Unconditional Certified Randomness without Structure

We obtain a certified randomness protocol in the quantum random oracle model. The protocol is non-interactive and publicly verifiable with a classical verifier, and is based on Yamakawa and Zhandry's proof of quantumness [JACM'24]. We prove unconditional security of this protocol against adversaries making subexponentially-many adaptive quantum queries to the random oracle. Prior work on certified randomness relative to a random oracle additionally assumed the Aaronson--Ambainis conjecture or proved security only against low query-depth adversaries.

A. Coladangelo, Dakshita Khurana, Saachi Mutreja et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.