
Quantum Pseudorandomness and Classical Complexity
We construct a quantum oracle relative to which π‘π°π― = π°π¬π but cryptograp...
read it

The Quantum Supremacy Tsirelson Inequality
A leading proposal for verifying nearterm quantum supremacy experiments...
read it

Symmetries, graph properties, and quantum speedups
Aaronson and Ambainis (2009) and Chailloux (2018) showed that fully symm...
read it

Lower Bounding the ANDOR Tree via Symmetrization
We prove a nearly tight lower bound on the approximate degree of the two...
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

QMA Lower Bounds for Approximate Counting
We prove a query complexity lower bound for QMA protocols that solve app...
read it

Structured Factored Inference: A Framework for Automated Reasoning in Probabilistic Programming Languages
Reasoning on large and complex realworld models is a computationally di...
read it
William Kretschmer
is this you? claim profile