Updated on 2023/10/10
Phd (Computer Science) （ 2006.3 The University of Tokyo ）
Quantum computing
Computational complexity
Distributed computing
Algorithms
Informatics / Theory of informatics
Distributed Computing
Quantum computing
Computational Complexity
Algorithms
Nagoya University Graduate School of Mathematics Professor
2022.4
Nagoya University Graduate School of Mathematics Associate professor
2019.10
Kyoto University Graduate School of Informatics Designated associate professor
2016.4 - 2019.9
The University of Tokyo Graduate School of Information Science and Technology Designated associate professor
2012.4 - 2016.3
The University of Tokyo Graduate School of Information Science and Technology Designated lecturer
2009.4 - 2012.3
INFORMATION PROCESSING SOCIETY OF JAPAN
EATCS
ACM SIGACT
ACM
日本数学会
Editorial board member
2023.1
Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC) Steering committee member
2022.10
26th Conference on Quantum Information Processing (QIP 2023) Program committee chair
2022.5 - 2023.2
ACM Transactions on Quantum Computing Editorial board member
2019.6
Computational Complexity Editorial board member
2016.6
Committee type：Academic society
Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC) Steering committee member
2022.10
ACM Transactions on Quantum Computing Editorial board member
2019.6
Committee type：Academic society
電子情報通信学会 コンピュテーション研究会専門委員
2016.6
Committee type：Academic society
NISTEP Award 2017
2017.11 MEXT
Francois Le Gall
ISSAC 2014 Distinguished Paper Award
2014.7 ACM-SIGAL
Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems.
François Le Gall, Saeed Seddighin
Proceedings of the 13th Innovations in Theoretical Computer Science conference (ITCS 2022) page： 97 - 23 2022
Sevag Gharibian, François Le Gall
Proceedings of the 54th ACM Symposium on Theory of Computing (STOC 2022) page： 19 - 32 2022
Distributed Quantum Proofs for Replicated Data. Reviewed
Pierre Fraigniaud, François Le Gall, Harumichi Nishimura, Ami Paz
Proceedings of the 12th Innovations in Theoretical Computer Science conference (ITCS 2021) page： 28 - 20 2021
Tight Distributed Listing of Cliques. Reviewed
Keren Censor-Hillel, Yi-Jun Chang, François Le Gall, Dean Leitersdorf
Proceedings of the 32nd ACM-SIAM Symposium on Discrete Algorithms (SODA 2021) page： 2878 - 2891 2021
Distributed Quantum Interactive Proofs Reviewed
Francois Le Gall, Masayuki Miyamoto and Harumichi Nishimura
Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023) page： 42:1 - 42:21 2023.3
Improved Hardness Results for the Guided Local Hamiltonian Problem. Reviewed
Chris Cade, Marten Folkertsma, Sevag Gharibian, Ryu Hayakawa, François Le Gall, Tomoyuki Morimae, Jordi Weggemans
Proceedings of the 50th EATCS International Colloquium on Automata, Languages and Programming (ICALP 2023) page： 32:1 - 32:19 2023
Quantum Distributed Algorithms for Detection of Cliques.
Keren Censor-Hillel, Orr Fischer, François Le Gall, Dean Leitersdorf, Rotem Oshman
Proceedings of the 13th Innovations in Theoretical Computer Science conference (ITCS 2022) page： 35 - 25 2022
Quantum approximate counting for Markov chains and collision counting. Reviewed
Francois Le Gall, Iu-Iong Ng
Quantum Information & Computation Vol. 22 ( 15&16 ) page： 1261 - 1279 2022
An Optimal Oracle Separation of Classical and Quantum Hybrid Schemes. Reviewed
Atsuya Hasegawa, François Le Gall
Proceedings of the 33rd International Symposium on Algorithms and Computation (ISAAC 2022) page： 6 - 14 2022
Bounds on Oblivious Multiparty Quantum Communication Complexity. Reviewed
François Le Gall, Daiki Suruga
Proceedings of the 15th Latin American Theoretical Informatics Symposium (LATIN 2022) page： 641 - 657 2022
Brief Announcement: Distributed Quantum Interactive Proofs. Reviewed
François Le Gall, Masayuki Miyamoto, Harumichi Nishimura
Proceedings of the 36th International Symposium on Distributed Computing (DISC 2022) page： 48 - 3 2022
Quantum Logarithmic Space and Post-Selection. Reviewed
François Le Gall, Harumichi Nishimura, Abuzer Yakaryilmaz
Proceedings of the 16th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2021) page： 10 - 17 2021
Test of Quantumness with Small-Depth Quantum Circuits. Reviewed
Shuichi Hirahara, François Le Gall
Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021) page： 59 - 15 2021
Quantum communication complexity of distribution testing.
Aleksandrs Belovs, Arturo Castellanos, Francois Le Gall, Guillaume Malod, Alexander A. Sherstov
Quantum Information & Computation Vol. 21 ( 15&16 ) page： 1261 - 1273 2021
Quantum Advantage with Shallow Circuits Under Arbitrary Corruption.
Atsuya Hasegawa, François Le Gall
Proceedings of the 32nd International Symposium on Algorithms and Computation (ISAAC 2021) page： 74 - 16 2021
Lower Bounds for Induced Cycle Detection in Distributed Computing.
François Le Gall, Masayuki Miyamoto
Proceedings of the 32nd International Symposium on Algorithms and Computation (ISAAC 2021) page： 58 - 19 2021
Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model. Reviewed
Taisuke Izumi, François Le Gall, Frédéric Magniez
37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020) Vol. 154 page： 23 - 13 2020
Barriers for Rectangular Matrix Multiplication.
Matthias Christandl, François Le Gall, Vladimir Lysikov, Jeroen Zuiddam
Electron. Colloquium Comput. Complex. Vol. 27 page： 30 - 30 2020
Quantum-Inspired Classical Algorithms for Singular Value Transformation. Reviewed
Dhawal Jethwani, François Le Gall, Sanjay K. Singh
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020) page： 53 - 14 2020
Quantum Speedup for the Minimum Steiner Tree Problem. Reviewed
Masayuki Miyamoto, Masakazu Iwamura, Koichi Kise, François Le Gall
Proceedings of the 26th International Computing and Combinatorics Conference (COCOON 2020) page： 234 - 245 2020
On Distributed Listing of Cliques. Reviewed
Keren Censor-Hillel, François Le Gall, Dean Leitersdorf
Proceedings of the 39th ACM Symposium on Principles of Distributed Computing (PODC 2020) page： 474 - 482 2020
Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs. Reviewed
Keren Censor-Hillel, Orr Fischer, Tzlil Gonen, François Le Gall, Dean Leitersdorf, Rotem Oshman
Proceedings of the 34th International Symposium on Distributed Computing (DISC 2020) page： 33 - 17 2020
Brief Announcement: Distributed Quantum Proofs for Replicated Data. Reviewed
Pierre Fraigniaud, François Le Gall, Harumichi Nishimura, Ami Paz
Proceedings of the International Symposium on Distributed Computing (DISC 2020) page： 43 - 3 2020
Finding Small and Large $k$-Clique Instances on a Quantum Computer Reviewed
Sara Ayman Metwalli, Francois Le Gall, Rodney Van Meter
IEEE Transactions on Quantum Engineering Vol. 1 page： 1 - 11 2020
Average-Case Quantum Advantage with Shallow Circuits. Reviewed
François Le Gall
34th Computational Complexity Conference, CCC 2019, July 18-20, 2019, New Brunswick, NJ, USA. page： 21:1-21:20 2019
Quantum Query Complexity of Unitary Operator Discrimination. Reviewed
Akinori Kawachi, Kenichi Kawano, Francois Le Gall, Suguru Tamaki
IEICE Transactions Vol. 102-D ( 3 ) page： 483 - 491 2019
Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in the CONGEST-CLIQUE Model. Reviewed
Taisuke Izumi, François Le Gall
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, PODC 2019, Toronto, ON, Canada, July 29 - August 2, 2019. page： 84 - 93 2019
Quantum Advantage for the LOCAL Model in Distributed Computing. Reviewed
François Le Gall, Ansis Rosmanis, Harumichi Nishimura
36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany page： 49:1-49:14 2019
Quantum Advantage for the LOCAL Model in Distributed Computing
Le Gall Francois, Nishimura Harumichi, Rosmanis Ansis
36TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2019) 2019
Generalized Quantum Arthur-Merlin Games. Reviewed
Hirotada Kobayashi, François Le Gall, Harumichi Nishimura
SIAM J. Comput. Vol. 48 ( 3 ) page： 865 - 902 2019
Sublinear-Time Quantum Computation of the Diameter in CONGEST Networks. Reviewed
François Le Gall, Frédéric Magniez
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, PODC 2018, Egham, United Kingdom, July 23-27, 2018 page： 337 - 346 2018
Interactive Proofs with Polynomial-Time Quantum Prover for Computing the Order of Solvable Groups. Reviewed
François Le Gall, Tomoyuki Morimae, Harumichi Nishimura, Yuki Takeuchi
43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK page： 26:1-26:13 2018
Improved rectangular matrix multiplication using powers of the coppersmith-winograd tensor Reviewed
François Le Gall, Florent Urrutia
Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms page： 1029 - 1046 2018
Quantum Algorithm for Triangle Finding in Sparse Graphs Reviewed
Francois Le Gall, Shogo Nakajima
ALGORITHMICA Vol. 79 ( 3 ) page： 941 - 959 2017.11
MODIFIED GROUP NON-MEMBERSHIP IS IN PROMISE-AWPP RELATIVE TO GROUP ORACLES Reviewed
Tomoyuki Morimae, Harumichi Nishimura, Francois Le Gall
QUANTUM INFORMATION & COMPUTATION Vol. 17 ( 3-4 ) page： 242 - 250 2017.3
Triangle Finding and Listing in CONGEST Networks. Reviewed
Taisuke Izumi, François Le Gall
Proceedings of the ACM Symposium on Principles of Distributed Computing, PODC 2017, Washington, DC, USA, July 25-27, 2017 page： 381 - 389 2017
Quantum query complexity of unitary operator discrimination Reviewed
Akinori Kawachi, Kenichi Kawano, François Le Gall, Suguru Tamaki
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 10392 page： 309 - 320 2017
Quantum Algorithms for Matrix Products over Semirings. Reviewed
François Le Gall, Harumichi Nishimura
Chicago J. Theor. Comput. Sci. Vol. 2017 2017
Probabilistic Logarithmic-Space Algorithms for Laplacian Solvers. Reviewed
Dean Doron, François Le Gall, Amnon Ta-Shma
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2017, August 16-18, 2017, Berkeley, CA, USA page： 41:1-41:20 2017
Multiparty Quantum Communication Complexity of Triangle Finding. Reviewed
François Le Gall, Shogo Nakajima
12th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2017, June 14-16, 2017, Paris, France page： 6:1-6:11 2017
多人数の量子通信複雑性における新しい手法
第47回量子情報技術研究会 2022.12.8
Distributed Merlin-Arthur Synthesis of Quantum States and Its Applications
第47回量子情報技術研究会 2022.12.8
ガイド付きローカルハミルトニアン問題の計算複雑性の進展
第47回量子情報技術研究会 2022.12.8
Theoretical Foundations of Quantum Advantage Invited
Q2B 2022 Tokyo 2022.7.14
分散量子対話型証明
第６回量子ソフトウェア研究会 2022.7.8
Bounds on oblivious multiparty quantum communication complexity
第６回量子ソフトウェア研究会 2022.7.8
Quantum algorithms for large-scale problems Invited International conference
François Le Gall
Quantum Innovation 2021, the International Symposium on Quantum Science, Technology and Innovation 2021.12.9
Tight Distributed Listing of Cliques Invited
2021.3.8
Quantum Distributed Computing Invited
Workshop on Advances in Distributed Graph Algorithms (ADGA 2022) 2022.10.24
Construction of Quantum Computaional Infrastracture towards Quantum Information Society
Grant number：21H04879 2021.4 - 2026.3
Grants-in-Aid for Scientific Research Grant-in-Aid for Scientific Research (A)
Authorship：Coinvestigator(s)
Grant number：20H05966 2020.11 - 2025.3
科学研究費助成事業 学術変革領域研究(A)
山下 茂, 山本 直樹, ルガル フランソワ, 森 立平, 谷 誠一郎, 西村 治道
Authorship：Coinvestigator(s)
量子計算各種モデルにおける計算能力の解析を行う理論的なアプローチと、実際に量子計算機を利用する実践的なアプローチの両面から以下の4項目の研究を行う。
(A) 既存の量子計算モデルの結果を量子・古典協調の観点から、あるいは「弱い」量子計算モデルの観点から再検討・再構築する。
(B) 量子計算に起こりうる現実的なエラーを考慮に入れた計算モデルの検討を進める。
(C) 量子計算の方式に応じて異なる量子回路のモデルを量子・古典協調利用の枠組みの中で検討・評価する。
(D) 量子計算と古典計算を協調して利用する計算アルゴリズムの能力を解析するための計算モデルを検討・評価する。
量子アルゴリズム・計算量・浅層回路と量子コンピュータ実機実験による量子優位性研究
Grant number：20H00579 2020.4 - 2025.3
科学研究費助成事業 基盤研究(A)
今井 浩, 山下 茂, ルガル フランソワ, Avis David
Authorship：Coinvestigator(s)
量子コンピュータの得意な問題を用いて量子計算優越性を達成したとGoogleの研究者らが主張したところである。しかし、その問題は実応用とは無縁であり、IT社会に多大なインパクトを与えるの量子素因数分解計算などの実機実装の研究が重要となっている。本研究では、量子計算が本研究グループの量子浅層回路の計算量理論・実機に対応する量子回路の設計理論・量子非局所性とその組み合わせ構造に着目することにより、理論的に真に高速と示すことができる量子優位性を有する問題の最先端を研究し、量子コンピュータ実機で実証する。このような取り組みで、量子優位性が直接的に実社会に影響を与える新たな問題群を見出す成果を目指す。
Quantum Algorithms for Large-Scale Quantum Computers: New Horizons and Applications
Grant number：20H04139 2020.4 - 2024.3
Grants-in-Aid for Scientific Research Grant-in-Aid for Scientific Research (B)
Authorship：Principal investigator
Grant amount：\17290000 （ Direct Cost: \13300000 、 Indirect Cost：\3990000 ）
Grant number：19H04066 2019.4 - 2023.3
科学研究費助成事業 基盤研究(B)
西村 治道, ルガル フランソワ, 森前 智行, Buscemi F.
Authorship：Coinvestigator(s)
今日の量子計算量理論において，対話型証明の概念は非常に大きな存在となっている．一方で，近年その実装へ向けて社会的注目を集める量子コンピュータはまだ小規模であり，量子メモリや量子通信は依然として高コストである．この状況を鑑みて，本研究では量子計算や量子通信が制限された量子対話型証明や量子計算に動機づけられた古典対話型証明，さらにはその中間的な対話型証明モデルに着目し，それらの対話型証明モデルについての計算量理論を展開する．これにより量子コンピュータの検証問題に対する新しい解決法を提案し，既存の量子対話型証明モデルや量子多項式階層理論を俯瞰的に捉えることができるような包括的成果を得ることを目指す．
Theoretical Research on Quantum Supremacy
Grant number：19F19079 2019.7 - 2021.3
Authorship：Other
Interpolative Expansion of Quantum Protocol Theory
Grant number：16H01705 2016.4 - 2021.3
Authorship：Coinvestigator(s)
Algebraic Complexity Theory: New Approaches and Algorithmic Applications
Grant number：16H05853 2016.4 - 2020.3
Le Gall Francois
Authorship：Principal investigator
Grant amount：\12480000 （ Direct Cost: \9600000 、 Indirect Cost：\2880000 ）
In this research project we developed new techniques based on algebraic complexity theory to solve problems from theoretical computer science. Our main achievements are as follows.
We first developed new approaches to solve algebraic problems, and constructed faster algorithms for rectangular matrix multiplication. We then showed how to apply in a novel way algebraic techniques to several problems from computer science. In particular, via this approach we designed fast distributed algorithms for various computational problems over networks. Finally, we designed several quantum algorithms for graph problems that are faster than the best known algorithms.
