research
∙
06/02/2023
Discreteness of asymptotic tensor ranks
Tensor parameters that are amortized or regularized over large tensor po...
share
research
∙
02/06/2023
Noisy decoding by shallow circuits with parities: classical and quantum
We consider the problem of decoding corrupted error correcting codes wit...
research
∙
12/16/2022
Grothendieck inequalities characterize converses to the polynomial method
A surprising 'converse to the polynomial method' of Aaronson et al. (CCC...
research
∙
04/26/2022
On converses to the polynomial method
A surprising 'converse to the polynomial method' of Aaronson et al. (CCC...
research
∙
12/21/2018
Round elimination in exact communication complexity
We study two basic graph parameters, the chromatic number and the orthog...
research
∙
11/20/2017
Quantum Query Algorithms are Completely Bounded Forms
We prove a characterization of t-query quantum algorithms in terms of th...
research
∙
11/15/2017
