
Quantum Proofs of Proximity
We initiate the systematic study of QMA algorithms in the setting of pro...
read it

Streaming Verification for Graph Problems: Optimal Tradeoffs and Nonlinear Sketches
We study graph computations in an enhanced data streaming setting, where...
read it

Relative Error Streaming Quantiles
Approximating ranks, quantiles, and distributions over streaming data is...
read it

Improved Approximate Degree Bounds For kdistinctness
An open problem that is widely regarded as one of the most important in ...
read it

VanishingError Approximate Degree and QMA Complexity
The ϵapproximate degree of a function f X →{0, 1} is the least degree o...
read it

Approximate degree, secret sharing, and concentration phenomena
The ϵapproximate degree deg_ϵ(f) of a Boolean function f is the least d...
read it

Quantum Lower Bounds for Approximate Counting via Laurent Polynomials
This paper proves new limitations on the power of quantum computers to s...
read it

SignRank Can Increase Under Intersection
The communication class UPP^cc is a communication analog of the Turing M...
read it

Quantum algorithms and approximating polynomials for composed functions with shared inputs
We give new quantum algorithms for evaluating composed functions whose i...
read it

The Polynomial Method Strikes Back: Tight Quantum Query Bounds via Dual Polynomials
The approximate degree of a Boolean function f is the least degree of a ...
read it
Justin Thaler
is this you? claim profile