Author

Li-Yang Tan

h-index 3 View on Semantic Scholar

We have 2 of 11 papers

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 Aug 2026

Quantum Speedups Require Structure or Depth

This work settles this conjecture for parallel quantum algorithms, showing that every $t-query $d-round quantum algorithm can be simulated on most inputs with $t^{O(d^2)}$ classical queries, suggesting that for unstructured problems, superpolynomial speedups would require quantum circuits of superconstant depth, and ex...

Guy Blanc, Jordan Docter, Carmen Strassle et al. · 2 citations · ⚡1

Conference Jul 2026

Boosting with List-Decodable Codes

This work presents a new boosting algorithm that, for any class $\mathcal{F}$ closed under $O(\log \frac{1}{\gamma})$-XOR, strong learns $\mathcal{F}$ using $O(\log \frac{1}{\epsilon})$ calls to a $\gamma$-advantage weak learner and a single batch of $\tilde{O}(\log(\frac{1}{\epsilon

Addison Prairie, Li-Yang Tan · Annual Conference Computatio... · 0 citations