activity
20212026
most citedBohnenblust--Hille inequality for cyclic groups

3 citations · 3 across the 18 of their papers we have counts for

collaborators
Showing 2026Show all

8 papers · 1 filter

cs.IT2026

An Bohnenblust--Hille Bound on the Boolean Cube

Joseph Slote, Chun-Kai Tseng, Alexander Volberg

Let and put \[ β_0=\frac{3}{2}+\frac{1}{\log 2}=2.9426950408\ldots, \] where is the natural logarithm. We give a proof scheme showing that, for every $\vareps…

math.CA2026

Polynomial Bohnenblust--Hille bounds for product of cyclic groups

Joseph Slote, Alexander Volberg

Fix an integer , and let be the product of cyclic groups of order . For a Fourier character , let be the numbe…

quant-ph2026

Unconditional Certified Randomness without Structure

Andrea Coladangelo, Dakshita Khurana, Saachi Mutreja +3

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 Yam…

math.AP2026

Tightness of and counterexamples to several quantum estimates

Joseph Slote, Alexander Volberg, Haonan Zhang

We prove here several tightness results for such quantum inequalities as 1) the comparison of operator norm and product norm of -local hamiltonians, 2) Bohnenblust--Hille inequa…

math.FA2026

Dense Hamiltonians at the Parseval Limit: The Noncommutative BH Constant is Exponential and the Quantum FEI Conjecture is False

Joseph Slote

For each we construct a norm-1 Hermitian operator whose Pauli expansion contains terms, each of degree and magnitude - the largest…

quant-ph2026

Robust quantum state certification and uncertainty principles for total influence

Andrea Coladangelo, Jerry Li, Joseph Slote

We show that nonadaptive single-qubit Pauli measurements suffice to test whether an unknown -qubit state is -close to or -far from an ideal targ…

cs.CC2026

The estimates for Boolean surface area of polynomial threshold functions

Fan Chang, Joseph Slote, Alexander Volberg +2

Polynomial threshold functions (PTFs) are an important low-complexity class of Boolean functions, with strong connections to learning theory and approximation theory. Recent work o…

quant-ph2026

The Power of Two Bases: Robust and copy-optimal certification of nearly all quantum states with few-qubit measurements

Andrea Coladangelo, Jerry Li, Joseph Slote +1

A central task in quantum information science is state certification: testing whether an unknown state is -close to a fixed target state, or -far. Recent work has shown t…