Skip to content

Author

François Le Gall

6 papers 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.

Preprint Nov 2026

Breaking the quantum barriers for Graph Collision

In the graph collision problem, the task is to decide whether a known graph on $n$ vertices contains an edge with both endpoints marked, given query access to the input bits specifying the marked vertices. We first refute the conjectured $\Omega(n^{2/3})$ query lower bound with a bounded error quantum algorithm using $...

A. Cornelissen, Amin Shiraz Gilani, Shiva Kintali et al. · 0 citations
Preprint Sep 2026

Improved Quantum Algorithms for Black-Box Abelian Group Decomposition

This work gives a quantum algorithm for decomposing finite Abelian black-box groups by adapting the quantum sampling and classical lattice-reduction method of Regev's factoring algorithm, and proves that the integer relation lattices used in the algorithm admit, with high probability, integral bases whose vectors have...

Jun Luo, Yi-Nan Li, François Le Gall · 0 citations
Preprint Sep 2026

Improved Quantum Algorithms for Black-Box Abelian Group Decomposition

Decomposing finite Abelian black-box groups into cyclic factors is a basic problem in quantum computation. We give a quantum algorithm for decomposing finite Abelian black-box groups by adapting the quantum sampling and classical lattice-reduction method of Regev's factoring algorithm. The algorithm computes an invaria...

Jun Luo, Yi-Nan Li, François Le Gall · 0 citations
Preprint Sep 2026

Improved Quantum Query Bounds for Boolean Matrix Product Verification

We prove the first non-trivial upper bound for the quantum query complexity of Boolean Matrix Product Verification ($\mathsf{BMPV}$), answering a longstanding open question in quantum query complexity. For $n\times n$ matrices, our upper bound is $\widetilde O(n^{17/12})$, improving on the standard $O(n^{3/2})$ bound o...

Amin Shiraz Gilani, François Le Gall, Xing-Yu Zhou · 0 citations
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
Sep 2026

Near-Optimal Bounds on the Density of Low-Energy States of k-Local Hamiltonians and Faster Quantum Algorithms

Low-energy estimation and state preparation for general $k$-local Hamiltonians are fundamental challenges in quantum complexity theory. Buhrman et al.~ [BGLGST, PRL 2025] recently broke the natural Grover bound $O^\ast(2^{n/2})$ for both problems, with the improvement depending on the relative accuracy $\varepsilon$ an...

Sevag Gharibian, François Le Gall, Ranitha Mataraarachchi 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.