activity
20212026
most citedBohnenblust--Hille inequality for cyclic groups

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

collaborators

21 papers

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…

quant-ph2025

Quantum precomputation: parallelizing cascade circuits and the Moore-Nilsson conjecture is false

Adam Bene Watts, Charles R. Chen, J. William Helton +1

Parallelization is a major challenge in quantum algorithms due to physical constraints like no-cloning. This is vividly illustrated by the conjecture of Moore and Nilsson from thei…

quant-ph2025

Lower Bounds for Learning Hamiltonians from Time Evolution

Ziyun Chen, Jerry Li, Joseph Slote

Learning about a Hamiltonian from its time evolution is a fundamental task in quantum science. A flurry of recent work has developed powerful new algorithms with pro…

quant-ph2025

Approximating the operator norm of local Hamiltonians via few quantum states

Lars Becker, Joseph Slote, Alexander Volberg +1

Consider a Hermitian operator acting on a complex Hilbert space of dimension . We show that when has small degree in the Pauli expansion, or in other words, is a l…

math.NT2024

Fourier growth of degree polynomials

Lars Becker, Joseph Slote, Alexander Volberg +1

We prove bounds for the absolute sum of all level- Fourier coefficients for , where polynomial is of degree or degree .

quant-ph2024

Coherence in Property Testing: Quantum-Classical Collapses and Separations

Fernando Granha Jeronimo, Nir Magrafta, Joseph Slote +1

Understanding the power and limitations of classical and quantum information and how they differ is a fundamental endeavor. In property testing of distributions, a tester is given…

quant-ph2024

Testing classical properties from quantum data

Matthias C. Caro, Preksha Naik, Joseph Slote

Properties of Boolean functions can often be tested much faster than the functions can be learned. However, this advantage usually disappears when testers are limited to random sam…

math.FA2024

Noncommutative Bohnenblust--Hille Inequality for qudit systems

Joseph Slote, Alexander Volberg, Haonan Zhang

Previous noncommutative Bohnenblust--Hille (BH) inequalities addressed operator decompositions in the tensor-product space ; \emph{i.e.,} for systems o…

quant-ph2023

Parity vs. AC0 with simple quantum preprocessing

Joseph Slote

A recent line of work has shown the unconditional advantage of constant-depth quantum computation, or , over , , and related models of…

math.FA2023

Dimension-free discretizations of the uniform norm by small product sets

Lars Becker, Ohad Klein, Joseph Slote +2

Let be an analytic polynomial of degree at most . A classical inequality of Bernstein compares the supremum norm of over the unit circle to its supremum norm over the…

math.CA2023

A dimension-free discrete Remez-type inequality on the polytorus

Joseph Slote, Alexander Volberg, Haonan Zhang

Consider a function from the -fold product of multiplicative cyclic groups of order . Any such may be extended via its Fourier expansion to an an…

math.FA2023★ 3 cited

Bohnenblust--Hille inequality for cyclic groups

Joseph Slote, Alexander Volberg, Haonan Zhang

For any and the multiplicative cyclic group of order , consider any function and its Fourier expansion $f(z)=\sum_{α\in\{0,1,\ldots,K-1\}^n}a_…

math.AP2023

Quantum and classical low-degree learning via a dimension-free Remez inequality

Ohad Klein, Joseph Slote, Alexander Volberg +1

Recent efforts in Analysis of Boolean Functions aim to extend core results to new spaces, including to the slice , the hypergrid , and noncommutative spaces…

math.GT2021

Knot Embeddings in Improper Foldings

Joseph Slote, Thomas Bertschinger

Simple closed curves in the plane can be mapped to nontrivial knots under the action of origami foldings that allow the paper to self-intersect. We show all tame knot types may be…