Alex B. Grilo
where else to find them
no profile links on file
what they talk about
where they keep going back
no series more than once — all 4 in the filters
on a stage with
- Aarthi Sundaramonce
- Dorit Aharonovonce
- Igor C. Oliveiraonce
all 5 in the filters
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Quantum Learning Algorithms Imply Circuit Lower Bounds | Lower Bounds, Learning, and Average-Case Complexity | 2023-02-13 |
Shows a concrete implication: any quantum learner that beats the two trivial learners (full truth-table queries or the sampling-based 1/2 − 2^{-n/2} advantage)… | ||
| Quantum Learning Algorithms Imply Circuit Lower Bounds | Quantum Wave in Computing Reunion 2021 | 2021-07-15 |
Claim: nontrivial quantum learners for a circuit class C (produce a quantum hypothesis with error 1/2−γ in time roughly γ^2·2^n/n) imply uniform circuit lower… | ||
| Two combinatorial MA-complete problems | ITCS 2021 | 2021-01-06 |
Two new combinatorial problems are shown MA-complete: SetCSP is MA-hard for inverse-polynomial ε, and an implicit-graph problem ACAC is in MA via random-walk… | ||
| Quantum PCPs Meet Derandomization | Quantum Protocols: Testing & Quantum PCPs | 2020-03-30 |
Conjecture: a gap-amplifying map from general local Hamiltonians to stochastic uniform Hamiltonians exists if and only if randomized verification class MA… | ||
| nothing matches | ||