Quantum Weakly Nondeterministic Communication Complexity. - François Le Gall (MFCS, 2006)

Exponential separation of quantum and classical online space complexity. - François Le Gall (SPAA, 2006)

Dihedral Hidden Subgroup Problem: A Survey. - Hirotada Kobayashi; François Le Gall (Inf. Media Technol., 2006)

Efficient quantum algorithms for the hidden subgroup problem over semi-direct product groups. - Yoshifumi Inui; François Le Gall (Quantum Inf. Comput., 2007)

Quantum Property Testing of Group Solvability. - Yoshifumi Inui; François Le Gall (LATIN, 2008)

General Scheme for Perfect Quantum Network Coding with Free Classical Communication. - Hirotada Kobayashi; François Le Gall; Harumichi Nishimura; Martin Rötteler (ICALP (1), 2009)

Efficient Isomorphism Testing for a Class of Group Extensions. - François Le Gall (STACS, 2009)

The One-Way Communication Complexity of Group Membership - Scott Aaronson; François Le Gall; Alexander Russell; Seiichiro Tani (CoRR, 2009)

Perfect quantum network communication protocol based on classical network coding. - Hirotada Kobayashi; François Le Gall; Harumichi Nishimura; Martin Rötteler (ISIT, 2010)

An Efficient Quantum Algorithm for Some Instances of the Group Isomorphism Problem. - François Le Gall (STACS, 2010)

The quantum query complexity of certification. - Andris Ambainis; Andrew M. Childs; François Le Gall; Seiichiro Tani (Quantum Inf. Comput., 2010)

Property Testing for Cyclic Groups and Beyond. - François Le Gall; Yuichi Yoshida (COCOON, 2011)

Constructing quantum network coding schemes from classical nonlinear protocols. - Hirotada Kobayashi; Francois Le Gall; Harumichi Nishimura; Martin Rötteler (ISIT, 2011)

The One-Way Communication Complexity of Subgroup Membership. - Scott Aaronson; François Le Gall; Alexander Russell; Seiichiro Tani (Chic. J. Theor. Comput. Sci., 2011)

Faster Algorithms for Rectangular Matrix Multiplication. - François Le Gall (FOCS, 2012)

A Time-Efficient Output-Sensitive Quantum Algorithm for Boolean Matrix Multiplication. - François Le Gall (ISAAC, 2012)

Improved output-sensitive quantum algorithms for Boolean matrix multiplication. - François Le Gall (SODA, 2012)

Reconstructing Strings from Substrings with Quantum Queries. - Richard Cleve; Kazuo Iwama; François Le Gall; Harumichi Nishimura; Seiichiro Tani; Junichi Teruyama; Shigeru Yamashita (SWAT, 2012)

Improved Time-Efficient Output-Sensitive Quantum Algorithms for Boolean Matrix Multiplication - François Le Gall (CoRR, 2012)

On the distance between non-isomorphic groups. - Gábor Ivanyos; François Le Gall; Yuichi Yoshida (Eur. J. Comb., 2012)

On QMA protocols with two short quantum proofs. - François Le Gall; Shota Nakagawa; Harumichi Nishimura (Quantum Inf. Comput., 2012)

Quantum Private Information Retrieval with Sublinear Communication Complexity. - François Le Gall (Theory Comput., 2012)

Stronger methods of making quantum interactive proofs perfectly complete. - Hirotada Kobayashi; François Le Gall; Harumichi Nishimura (ITCS, 2013)

Quantum Algorithms for Finding Constant-sized Sub-hypergraphs over 3-uniform Hypergraphs. - François Le Gall; Harumichi Nishimura; Seiichiro Tani (CoRR, 2013)

Quantum Complexity of Boolean Matrix Multiplication and Related Problems. - François Le Gall (Computing with New Resources, 2014)

Quantum Algorithms for Finding Constant-Sized Sub-hypergraphs. - François Le Gall; Harumichi Nishimura; Seiichiro Tani (COCOON, 2014)

Improved Quantum Algorithm for Triangle Finding via Combinatorial Arguments. - François Le Gall (FOCS, 2014)

Algebraic complexity theory and matrix multiplication. - François Le Gall (ISSAC, 2014)

Powers of tensors and fast matrix multiplication. - François Le Gall (ISSAC, 2014)

Quantum Algorithms for Matrix Products over Semirings. - François Le Gall; Harumichi Nishimura (SWAT, 2014)

Privacy in Quantum Communication Complexity. - Iordanis Kerenidis; Mathieu Laurière; François Le Gall; Mathys Rennela (CoRR, 2014)

Fast Matrix Multiplication: Limitations of the Laser Method. - Andris Ambainis; Yuval Filmus; François Le Gall (Electron. Colloquium Comput. Complex., 2014)

Generalized Quantum Arthur-Merlin Games. - Hirotada Kobayashi; François Le Gall; Harumichi Nishimura (CCC, 2015)

Quantum Algorithm for Triangle Finding in Sparse Graphs. - François Le Gall; Shogo Nakajima (ISAAC, 2015)

Fast Matrix Multiplication: Limitations of the Coppersmith-Winograd Method. - Andris Ambainis; Yuval Filmus; François Le Gall (STOC, 2015)

Quantum Communication Complexity of Distributed Set Joins. - Stacey Jeffery; François Le Gall (MFCS, 2016)

Further Algebraic Algorithms in the Congested Clique Model and Applications to Graph-Theoretic Problems. - François Le Gall (DISC, 2016)

Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision. - Stacey Jeffery; Robin Kothari; François Le Gall; Frédéric Magniez (Algorithmica, 2016)

Solving Laplacian Systems in Logarithmic Space. - François Le Gall (CoRR, 2016)

On the Group and Color Isomorphism Problems. - François Le Gall; David J. Rosenbaum 001 (CoRR, 2016)

Modified group non-membership is in AWPP. - Tomoyuki Morimae; Harumichi Nishimura; Francois Le Gall (CoRR, 2016)

Information cost of quantum communication protocols. - Iordanis Kerenidis; Mathieu Laurière; Francois Le Gall; Mathys Rennela (Quantum Inf. Comput., 2016)

Probabilistic Logarithmic-Space Algorithms for Laplacian Solvers. - Dean Doron; François Le Gall; Amnon Ta-Shma (APPROX-RANDOM, 2017)

Quantum Query Complexity of Unitary Operator Discrimination. - Akinori Kawachi; Kenichi Kawano; François Le Gall; Suguru Tamaki (COCOON, 2017)

Triangle Finding and Listing in CONGEST Networks. - Taisuke Izumi; François Le Gall (PODC, 2017)

Multiparty Quantum Communication Complexity of Triangle Finding. - François Le Gall; Shogo Nakajima (TQC, 2017)

Modified Group Non-Membership is in Promise-AWPP relative to group oracles. - Tomoyuki Morimae; Harumichi Nishimura; Francois Le Gall (Quantum Inf. Comput., 2017)

Interactive Proofs with Polynomial-Time Quantum Prover for Computing the Order of Solvable Groups. - François Le Gall; Tomoyuki Morimae; Harumichi Nishimura; Yuki Takeuchi (MFCS, 2018)

Sublinear-Time Quantum Computation of the Diameter in CONGEST Networks. - François Le Gall; Frédéric Magniez (PODC, 2018)

Improved Rectangular Matrix Multiplication using Powers of the Coppersmith-Winograd Tensor. - Francois Le Gall; Florent Urrutia (SODA, 2018)

Average-Case Quantum Advantage with Shallow Circuits. - François Le Gall (CCC, 2019)

Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in the CONGEST-CLIQUE Model. - Taisuke Izumi; François Le Gall (PODC, 2019)

Quantum Advantage for the LOCAL Model in Distributed Computing. - François Le Gall; Harumichi Nishimura; Ansis Rosmanis (STACS, 2019)

Quantum Speedup for the Minimum Steiner Tree Problem. - Masayuki Miyamoto; Masakazu Iwamura; Koichi Kise; François Le Gall (COCOON, 2020)

Quantum-Inspired Classical Algorithms for Singular Value Transformation. - Dhawal Jethwani; François Le Gall; Sanjay Kumar Singh 003 (MFCS, 2020)

On Distributed Listing of Cliques. - Keren Censor-Hillel; François Le Gall; Dean Leitersdorf (PODC, 2020)

Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model. - Taisuke Izumi; François Le Gall; Frédéric Magniez (STACS, 2020)

Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs. - Keren Censor-Hillel; Orr Fischer; Tzlil Gonen; François Le Gall; Dean Leitersdorf; Rotem Oshman (DISC, 2020)

Brief Announcement: Distributed Quantum Proofs for Replicated Data. - Pierre Fraigniaud; François Le Gall; Harumichi Nishimura; Ami Paz (DISC, 2020)

Distributed Quantum Proofs for Replicated Data. - Pierre Fraigniaud; François Le Gall; Harumichi Nishimura; Ami Paz (ITCS, 2021)

Lower Bounds for Induced Cycle Detection in Distributed Computing. - François Le Gall; Masayuki Miyamoto (ISAAC, 2021)

Quantum Advantage with Shallow Circuits Under Arbitrary Corruption. - Atsuya Hasegawa; François Le Gall (ISAAC, 2021)

Test of Quantumness with Small-Depth Quantum Circuits. - Shuichi Hirahara; François Le Gall (MFCS, 2021)

Tight Distributed Listing of Cliques. - Keren Censor-Hillel; Yi-Jun Chang; François Le Gall; Dean Leitersdorf (SODA, 2021)

Quantum Logarithmic Space and Post-Selection. - François Le Gall; Harumichi Nishimura; Abuzer Yakaryilmaz (TQC, 2021)

Quantum communication complexity of distribution testing. - Aleksandrs Belovs; Arturo Castellanos 002; Francois Le Gall; Guillaume Malod; Alexander A. Sherstov (Quantum Inf. Comput., 2021)

Quantum Distributed Algorithms for Detection of Cliques. - Keren Censor-Hillel; Orr Fischer; François Le Gall; Dean Leitersdorf; Rotem Oshman (ITCS, 2022)

Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems. - François Le Gall; Saeed Seddighin (ITCS, 2022)

An Optimal Oracle Separation of Classical and Quantum Hybrid Schemes. - Atsuya Hasegawa; François Le Gall (ISAAC, 2022)

Bounds on Oblivious Multiparty Quantum Communication Complexity. - François Le Gall; Daiki Suruga (LATIN, 2022)

Dequantizing the Quantum singular value transformation: hardness and applications to Quantum chemistry and the Quantum PCP conjecture. - Sevag Gharibian; François Le Gall (STOC, 2022)

Brief Announcement: Distributed Quantum Interactive Proofs. - François Le Gall; Masayuki Miyamoto; Harumichi Nishimura (DISC, 2022)

Quantum Approximate Counting for Markov Chains and Application to Collision Counting. - François Le Gall; Iu-Iong Ng (CoRR, 2022)

Improved Hardness Results for the Guided Local Hamiltonian Problem. - Sevag Gharibian; Ryu Hayakawa; François Le Gall; Tomoyuki Morimae (CoRR, 2022)

Non-trivial lower bound for 3-coloring the ring in the quantum LOCAL model. - François Le Gall; Ansis Rosmanis (CoRR, 2022)

Quantum approximate counting for Markov chains and collision counting. - Francois Le Gall; Iu-Iong Ng (Quantum Inf. Comput., 2022)

Improved Hardness Results for the Guided Local Hamiltonian Problem. - Chris Cade; Marten Folkertsma; Sevag Gharibian; Ryu Hayakawa; François Le Gall; Tomoyuki Morimae; Jordi Weggemans (ICALP, 2023)

Distributed Merlin-Arthur Synthesis of Quantum States and Its Applications. - François Le Gall; Masayuki Miyamoto; Harumichi Nishimura (MFCS, 2023)

Quantum Distributed Computing: Potential and Limitations (Invited Talk). - François Le Gall (OPODIS, 2023)

Distributed Quantum Interactive Proofs. - François Le Gall; Masayuki Miyamoto; Harumichi Nishimura (STACS, 2023)

Space-bounded quantum state testing via space-efficient quantum singular value transformation. - François Le Gall; Yupan Liu; Qisheng Wang (Electron. Colloquium Comput. Complex., 2023)

Quantum Simultaneous Protocols Without Public Coins Using Modified Equality Queries. - François Le Gall; Oran Nadler; Harumichi Nishimura; Rotem Oshman (OPODIS, 2024)

Faster Rectangular Matrix Multiplication by Combination Loss Analysis. - François Le Gall (SODA, 2024)

No Distributed Quantum Advantage for Approximate Graph Coloring. - Xavier Coiteux-Roy; Francesco d'Amore 001; Rishikesh Gajjala; Fabian Kuhn; François Le Gall; Henrik Lievonen; Augusto Modanese; Marc-Olivier Renou; Gustav Schmid; Jukka Suomela (STOC, 2024)

Quantum State Synthesis: Relation with Decision Complexity Classes and Impossibility of Synthesis Error Reduction. - Hugo Delavenne; François Le Gall (CoRR, 2024)

Beating Grover search for low-energy estimation and state preparation. - Harry Buhrman; Sevag Gharibian; Zeph Landau; François Le Gall; Norbert Schuch; Suguru Tamaki (CoRR, 2024)

Classical versus quantum queries in quantum PCPs with classical proofs. - Harry Buhrman; François Le Gall; Jordi Weggemans (CoRR, 2024)

Quantum state synthesis: relation with decision complexity classes and impossibility of error reduction. - Hugo Delavenne; François Le Gall (Quantum Inf. Comput., 2024)

Space-Bounded Quantum Interactive Proof Systems. - François Le Gall; Yupan Liu; Harumichi Nishimura; Qisheng Wang (CCC, 2025)

Classical Algorithms for Constant Approximation of the Ground State Energy of Local Hamiltonians. - François Le Gall (ESA, 2025)

Online Locality Meets Distributed Quantum Computing. - Amirreza Akbari; Xavier Coiteux-Roy; Francesco d'Amore 001; François Le Gall; Henrik Lievonen; Darya Melnyk; Augusto Modanese; Shreyas Pai; Marc-Olivier Renou; Václav Rozhon; Jukka Suomela (STOC, 2025)

Distributed Quantum Advantage for Local Problems. - Alkida Balliu; Sebastian Brandt 002; Xavier Coiteux-Roy; Francesco d'Amore 001; Massimo Equi; François Le Gall; Henrik Lievonen; Augusto Modanese; Dennis Olivetti; Marc-Olivier Renou; Jukka Suomela; Lucas Tendick; et al. (STOC, 2025)

Robust Dequantization of the Quantum Singular Value Transformation and Quantum Machine Learning Algorithms. - François Le Gall (Comput. Complex., 2025)

Quantum Merlin-Arthur proof systems for synthesizing quantum states. - Hugo Delavenne; François Le Gall; Yupan Liu; Masayuki Miyamoto (Quantum, 2025)

Does there exist a quantum fingerprinting protocol without coherent measurements? - Atsuya Hasegawa; Srijita Kundu; François Le Gall; Harumichi Nishimura; Qisheng Wang (CoRR, 2025)

Group Order is in QCMA. - François Le Gall; Harumichi Nishimura; Dhara Thakkar (CoRR, 2025)

Maximum Separation of Quantum Communication Complexity With and Without Shared Entanglement. - Atsuya Hasegawa; François Le Gall; Augusto Modanese (CoRR, 2025)

Barriers for rectangular matrix multiplication. - Matthias Christandl; François Le Gall; Vladimir Lysikov; Jeroen Zuiddam (Comput. Complex., 2025)

Correction: Robust dequantization of the quantum singular value transformation and quantum machine learning algorithms. - François Le Gall (Comput. Complex., 2025)

Dequantization and Hardness of Spectral Sum Estimation. - Roman Edenhofer; Atsuya Hasegawa; François Le Gall (CoRR, 2025)

Exponential Quantum Advantage for Message Complexity in Distributed Algorithms. - François Le Gall; Maël Luce; Joseph Marchand; Mathieu Roget (CoRR, 2025)

A Simpler Exponential-Time Approximation Algorithm for MAX-k-SAT. - Harry Buhrman; Sevag Gharibian; Zeph Landau; François Le Gall; Norbert Schuch; Suguru Tamaki (CoRR, 2025)