- complexity
- cryptography
- algorithms
- quantum
- circuits
- upcoming
•
•
•
•
•
-
Limitations of Linear Cross-Entropy as a Measure of Quantum Advantage
Chi-Ning Chou
-
A better-than-3 log n depth lower bound for De Morgan formulas with restrictions on top gates
Anastasia Sofronova
-
Why we couldn't prove SETH hardness of CVP for even norms, Subset-SUM, and Many more!
Rajendra Kumar
-
Improved Quantum Query Upper Bounds Based on Classical Decision Trees
Nikhil Mande
-
Interior Point Methods for Nearly Linear Time Algorithms
Aaron Sidford