1 citations · 1 across the 9 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
quant-ph2026
Quantum Speedups Require Structure or Depth
Guy Blanc, Jordan Docter, Carmen Strassle +1
One of the most basic conjectures in quantum complexity theory states that every -query quantum algorithm can be simulated on most inputs by a -query classical…
stat.ML2026
Boosting with List-Decodable Codes
Addison Prairie, Li-Yang Tan
Boosting is a fundamental technique for generically improving the accuracy of learning algorithms (Schapire 1989). Existing boosting algorithms construct a strong learner using $O(…