Anthony Ostuni

activity

20232026

most citedA tight lower bound on non-adaptive group testing estimation

2 citations · 2 across the 8 of their papers we have counts for

collaborators

Showing 2025Show all

3 papers · 1 filter

cs.CC2025

Symmetric Distributions from Shallow Circuits

Daniel M. Kane, Anthony Ostuni, Kewen Wu

We characterize the symmetric distributions that can be (approximately) generated by shallow Boolean circuits. More precisely, let $f : {0, 1}^{m} \to {0, 1}^{n}$ be a Boolean fu…

cs.CC2025

Quantum Advantage from Sampling Shallow Circuits: Beyond Hardness of Marginals

Daniel Grier, Daniel M. Kane, Jackson Morris +2

We construct a family of distributions ${D_{n}}_{n}$ with $D_{n}$ over ${0, 1}^{n}$ and a family of depth- $7$ quantum circuits ${C_{n}}_{n}$ such that $D_{n}$ …

math.CO2025

Quasipolynomial bounds for the corners theorem

Michael Jaber, Yang P. Liu, Shachar Lovett +2

Let $G$ be a finite abelian group and $A$ be a subset of $G \times G$ which is corner--free, meaning that there are no $x, y \in G$ and $d \in G ∖ {0}$ such that $(x, y)$ …