Skip to content

Author

Jonas Kamminga

1 paper indexed here

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.

Sep 2026

Degree Balance as a Fine-Grained Complexity Boundary for Quantum SAT

The upper and lower bounds establish a fine-grained complexity dichotomy for quantum satisfiability, by showing that, assuming (Q)SETH, quantum 5-SAT admits no non-trivial worst-case speedup and demonstrating that the dependence of the authors' algorithms on regularity is in some sense nearly optimal.

Atsuya Hasegawa, Jonas Kamminga, François Le Gall et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.