Skip to content

Author

Thomas Huffstutler

1 paper 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 Nov 2026

A short proof of the Aaronson-Ambainis Conjecture via the completion framework

We give a short proof of the Aaronson-Ambainis conjecture. If a partial Boolean function $f$ is defined on a $\delta$-fraction of all $n$-bit strings and have quantum query complexity $Q(f)$, then, for every $0<\epsilon<1$, a deterministic algorithm computes $f$ correctly on at least a $1-\epsilon$ fraction of its doma...

Thomas Huffstutler, David Miloschewsky, Supartha Podder · 0 citations

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