• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

Quantum Algorithms for Large-Scale Quantum Computers: New Horizons and Applications

Research Project

Project/Area Number 20H04139
Research Category

Grant-in-Aid for Scientific Research (B)

Allocation TypeSingle-year Grants
Section一般
Review Section Basic Section 60010:Theory of informatics-related
Research InstitutionNagoya University

Principal Investigator

Le Gall Francois  名古屋大学, 多元数理科学研究科, 教授 (50584299)

Co-Investigator(Kenkyū-buntansha) 泉 泰介  大阪大学, 大学院情報科学研究科, 准教授 (20432461)
平原 秀一  国立情報学研究所, 情報学プリンシプル研究系, 准教授 (80848440)
Project Period (FY) 2020-04-01 – 2024-03-31
Project Status Completed (Fiscal Year 2023)
Budget Amount *help
¥17,290,000 (Direct Cost: ¥13,300,000、Indirect Cost: ¥3,990,000)
Fiscal Year 2023: ¥3,770,000 (Direct Cost: ¥2,900,000、Indirect Cost: ¥870,000)
Fiscal Year 2022: ¥4,290,000 (Direct Cost: ¥3,300,000、Indirect Cost: ¥990,000)
Fiscal Year 2021: ¥4,290,000 (Direct Cost: ¥3,300,000、Indirect Cost: ¥990,000)
Fiscal Year 2020: ¥4,940,000 (Direct Cost: ¥3,800,000、Indirect Cost: ¥1,140,000)
Keywords量子アルゴリズム / 量子分散計算 / 量子計算量理論
Outline of Research at the Start

将来に実現が期待される大規模な量子コンピュータの有力な応用を見いだすことは、量子計算の研究において最優先課題の一つである。本研究では、理論的な側面からこの課題に取り組む。研究期間中には、大規模な量子コンピュータ向けの新しい量子アルゴリズムの開発とともに、量子コンピュータの計算能力が発揮できる新分野の開拓を目指す。

Outline of Final Research Achievements

We investigated the computational power and the applications of large-scale quantum computers. We first rigorously established a quantum advantage (i.e., showed that quantum computers can be faster than supercomputers) for fundamental problems such as high-precision chemistry calculations. We developed several fast quantum distributed algorithms and proved a quantum advantage for distributed computing as well. We also investigated the potential of shallow (i.e., low depth) quantum circuits and demonstrated that they can be significantly more powerful than classical shallow circuits.

Academic Significance and Societal Importance of the Research Achievements

20年~30年後に実現が期待される大規模量子コンピュータの活用方法を発展させた。高精度化学計算において、大規模量子コンピュータが通常のコンピュータよりも指数関数的に速く問題を解決できることを示すことにより、顕著な優位性の理論的根拠を与えた。さらに、量子分散アルゴリズムや量子文字列アルゴリズムなど、様々な高速量子アリゴリズムを開発することにより、大規模量子コンピュータの応用を開拓した。

Report

(5 results)
  • 2023 Annual Research Report   Final Research Report ( PDF )
  • 2022 Annual Research Report
  • 2021 Annual Research Report
  • 2020 Annual Research Report
  • Research Products

    (90 results)

All 2024 2023 2022 2021 2020 Other

All Int'l Joint Research (12 results) Journal Article (54 results) (of which Int'l Joint Research: 27 results,  Peer Reviewed: 54 results,  Open Access: 54 results) Presentation (24 results) (of which Int'l Joint Research: 10 results,  Invited: 11 results)

  • [Int'l Joint Research] CWI(オランダ)

    • Related Report
      2023 Annual Research Report
  • [Int'l Joint Research] Technion(イスラエル)

    • Related Report
      2023 Annual Research Report
  • [Int'l Joint Research] Warwick大学(英国)

    • Related Report
      2023 Annual Research Report
  • [Int'l Joint Research] Paderborn大学(ドイツ)

    • Related Report
      2023 Annual Research Report
  • [Int'l Joint Research] パーダーボルン大学(ドイツ)

    • Related Report
      2022 Annual Research Report
  • [Int'l Joint Research] ラトガーズ大学(米国)

    • Related Report
      2022 Annual Research Report
  • [Int'l Joint Research] イスラエル工科大学/テルアビブ大学(イスラエル)

    • Related Report
      2021 Annual Research Report
  • [Int'l Joint Research] ラトビア大学(ラトビア)

    • Related Report
      2021 Annual Research Report
  • [Int'l Joint Research] パリ大学(フランス)

    • Related Report
      2021 Annual Research Report
  • [Int'l Joint Research] オックスフォード大学(英国)

    • Related Report
      2021 Annual Research Report
  • [Int'l Joint Research] CNRS(フランス)

    • Related Report
      2020 Annual Research Report
  • [Int'l Joint Research] イスラエル工科大学/テルアビブ大学(イスラエル)

    • Related Report
      2020 Annual Research Report
  • [Journal Article] Faster Rectangular Matrix Multiplication by Combination Loss Analysis2024

    • Author(s)
      Francois Le Gall
    • Journal Title

      Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms (SODA 2024)

      Volume: - Pages: 3765-3791

    • DOI

      10.1137/1.9781611977912.133

    • ISBN
      9781611977912
    • Related Report
      2023 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] A Nearly Linear-Time Distributed Algorithm for Exact Maximum Matching2024

    • Author(s)
      Izumi Taisuke、Kitamura Naoki、Yamaguchi Yutaro
    • Journal Title

      Proceedings of the 35th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2024)

      Volume: - Pages: 4062-4082

    • DOI

      10.1137/1.9781611977912.141

    • ISBN
      9781611977912
    • Related Report
      2023 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Loosely-Stabilizing Algorithm on Almost Maximal Independent Set2023

    • Author(s)
      DONG Rongcheng、IZUMI Taisuke、KITAMURA Naoki、SUDO Yuichi、MASUZAWA Toshimitsu
    • Journal Title

      IEICE Transactions on Information and Systems

      Volume: E106.D Issue: 11 Pages: 1762-1771

    • DOI

      10.1587/transinf.2023EDP7075

    • ISSN
      0916-8532, 1745-1361
    • Year and Date
      2023-11-01
    • Related Report
      2023 Annual Research Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [Journal Article] Improved Hardness Results for the Guided Local Hamiltonian Problem2023

    • Author(s)
      Chris Cade, Marten Folkertsma, Sevag Gharibian, Ryu Hayakawa, Francois Le Gall, Tomoyuki Morimae, Jordi Weggemans
    • Journal Title

      Proceedings of the 50th EATCS International Colloquium on Automata, Languages and Programming (ICALP 2023)

      Volume: -

    • Related Report
      2023 Annual Research Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [Journal Article] Distributed Merlin-Arthur Synthesis of Quantum States and Its Applications2023

    • Author(s)
      Francois Le Gall, Masayuki Miyamoto, Harumichi Nishimura
    • Journal Title

      Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)

      Volume: -

    • Related Report
      2023 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture2023

    • Author(s)
      Sevag Gharibian, Francois Le Gall
    • Journal Title

      SIAM Journal on Computing

      Volume: 52 Issue: 4 Pages: 1009-1038

    • DOI

      10.1137/22m1513721

    • Related Report
      2023 Annual Research Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [Journal Article] Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems2023

    • Author(s)
      Francois Le Gall, Saeed Seddighin
    • Journal Title

      Algorithmica

      Volume: 85 Issue: 5 Pages: 1251-1286

    • DOI

      10.1007/s00453-022-01066-z

    • Related Report
      2023 Annual Research Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [Journal Article] Deterministic Fault-Tolerant Connectivity Labeling Scheme2023

    • Author(s)
      Izumi Taisuke、Emek Yuval、Wadayama Tadashi、Masuzawa Toshimitsu
    • Journal Title

      Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing (PODC)

      Volume: - Pages: 190-199

    • DOI

      10.1145/3583668.3594584

    • Related Report
      2023 Annual Research Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [Journal Article] A Duality between One-Way Functions and Average-Case Symmetry of Information2023

    • Author(s)
      Hirahara Shuichi、Ilango Rahul、Lu Zhenjian、Nanashima Mikito、Oliveira Igor C.
    • Journal Title

      Proceedings of the 55th Annual ACM Symposium on Theory of Computing

      Volume: 55 Pages: 1039-1050

    • DOI

      10.1145/3564246.3585138

    • Related Report
      2023 Annual Research Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [Journal Article] Hardness Self-Amplification: Simplified, Optimized, and Unified2023

    • Author(s)
      Hirahara Shuichi、Shimizu Nobutaka
    • Journal Title

      Symposium on Theory of Computing

      Volume: 1 Pages: 70-83

    • DOI

      10.1145/3564246.3585189

    • Related Report
      2023 Annual Research Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [Journal Article] Non-Black-Box Worst-Case to Average-Case Reductions Within NP2023

    • Author(s)
      Shuichi Hirahara
    • Journal Title

      SIAM Journal on Computing

      Volume: 52 Issue: 6 Pages: FOCS18-349-FOCS18-382

    • DOI

      10.1137/19m124705x

    • Related Report
      2023 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Learning Versus Pseudorandom Generators in Constant Parallel Time2023

    • Author(s)
      Shuichi Hirahara, Mikito Nanashima
    • Journal Title

      Proceedings of the 14th Innovations in Theoretical Computer Science Conference (ITCS 2023)

      Volume: -

    • Related Report
      2022 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Kolmogorov Complexity Characterizes Statistical Zero Knowledge2023

    • Author(s)
      Eric Allender, Shuichi Hirahara, Harsha Tirumala
    • Journal Title

      Proceedings of the 14th Innovations in Theoretical Computer Science Conference (ITCS 2023)

      Volume: -

    • Related Report
      2022 Annual Research Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [Journal Article] Cryptographic hardness under projections for time-bounded Kolmogorov complexity2023

    • Author(s)
      Eric Allender, John Gouwar, Shuichi Hirahara, Caleb Robelle
    • Journal Title

      Theoretical Computer Science

      Volume: 940 Pages: 206-224

    • DOI

      10.1016/j.tcs.2022.10.040

    • Related Report
      2022 Annual Research Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [Journal Article] Distributed Quantum Interactive Proofs2023

    • Author(s)
      Francois Le Gall, Masayuki Miyamoto and Harumichi Nishimura
    • Journal Title

      Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023)

      Volume: -

    • Related Report
      2022 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] A Subquadratic-Time Distributed Algorithm for Exact Maximum Matching2022

    • Author(s)
      Naoki Kitamura, Taisuke Izumi
    • Journal Title

      IEICE Transactions on Information and Systems

      Volume: E105.D Issue: 3 Pages: 634-645

    • DOI

      10.1587/transinf.2021EDP7083

    • NAID

      130008165629

    • ISSN
      0916-8532, 1745-1361
    • Year and Date
      2022-03-01
    • Related Report
      2022 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Loosely-stabilizing maximal independent set algorithms with unreliable communications2022

    • Author(s)
      Dong Rongcheng、Sudo Yuichi、Izumi Taisuke、Masuzawa Toshimitsu
    • Journal Title

      Theoretical Computer Science

      Volume: 937 Pages: 69-84

    • DOI

      10.1016/j.tcs.2022.09.031

    • Related Report
      2022 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs2022

    • Author(s)
      Izumi Taisuke, Kitamura Naoki, Naruse Takamasa, Schwartzman Gregory
    • Journal Title

      Proc. of International Symposium on Parallelism in Algorithms and Architectures (SPAA)

      Volume: - Pages: 11-22

    • DOI

      10.1145/3490148.3538590

    • Related Report
      2022 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Hardness Self-Amplification from Feasible Hard-Core Sets2022

    • Author(s)
      Shuichi Hirahara, Nobutaka Shimizu
    • Journal Title

      Proceedings of the 63rd Annual Symposium on Foundations of Computer Science (FOCS 2022)

      Volume: - Pages: 543-554

    • DOI

      10.1109/focs54457.2022.00058

    • Related Report
      2022 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] NP-Hardness of Learning Programs and Partial MCSP2022

    • Author(s)
      Shuichi Hirahara
    • Journal Title

      Proceedings of the Symposium on Foundations of Computer Science (FOCS 2022)

      Volume: - Pages: 968-979

    • DOI

      10.1109/focs54457.2022.00095

    • Related Report
      2022 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Finding Errorless Pessiland in Error-Prone Heuristica2022

    • Author(s)
      Shuichi Hirahara, Mikito Nanashima
    • Journal Title

      Proceedings of the 37th Computational Complexity Conference (CCC 2022)

      Volume: -

    • Related Report
      2022 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Symmetry of Information from Meta-Complexity2022

    • Author(s)
      Shuichi Hirahara
    • Journal Title

      Proceedings of the 37th Computational Complexity Conference (CCC 2022)

      Volume: -

    • Related Report
      2022 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] An optimal oracle separation of classical and quantum hybrid schemes2022

    • Author(s)
      Atsuya Hasegawa and Francois Le Gall
    • Journal Title

      Proceedings of the 33rd International Symposium on Algorithms and Computation (ISAAC 2022)

      Volume: -

    • Related Report
      2022 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Quantum Approximate Counting for Markov Chains and Application to Collision Counting2022

    • Author(s)
      Francois Le Gall, Iu-iong Ng
    • Journal Title

      Quantum Information and Computation

      Volume: 22 Issue: 15&16 Pages: 1261-1279

    • DOI

      10.26421/qic22.15-16-1

    • Related Report
      2022 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Bounds on oblivious multiparty quantum communication complexity2022

    • Author(s)
      Francois Le Gall, Daiki Suruga
    • Journal Title

      Proceedings of the 15th Latin American Theoretical Informatics Symposium (LATIN 2022)

      Volume: - Pages: 641-657

    • DOI

      10.1007/978-3-031-20624-5_39

    • ISBN
      9783031206238, 9783031206245
    • Related Report
      2022 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture2022

    • Author(s)
      Sevag Gharibian, Francois Le Gall
    • Journal Title

      Proceedings of the 54th ACM Symposium on Theory of Computing (STOC 2022)

      Volume: - Pages: 19-32

    • DOI

      10.1145/3519935.3519991

    • Related Report
      2022 Annual Research Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [Journal Article] Quantum Meets Fine-grained Complexity: Sublinear Time Quantum Algorithms for String Problems2022

    • Author(s)
      Francois Le Gall and Saeed Seddighin
    • Journal Title

      Proceedings of the 13th Innovations in Theoretical Computer Science conference (ITCS 2022)

      Volume: -

    • Related Report
      2021 Annual Research Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [Journal Article] Quantum Distributed Algorithms for Detection of Cliques2022

    • Author(s)
      Keren Censor-Hillel, Orr Fischer, Francois Le Gall, Dean Leitersdorf and Rotem Oshman
    • Journal Title

      Proceedings of the 13th Innovations in Theoretical Computer Science conference (ITCS 2022

      Volume: -

    • Related Report
      2021 Annual Research Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [Journal Article] Average-Case Hardness of NP and PH from Worst-Case Fine-Grained Assumptions2022

    • Author(s)
      Lijie Chen, Shuichi Hirahara, Neekon Vafa
    • Journal Title

      Proceedings of the 13th Innovations in Theoretical Computer Science Conference (ITCS 2022)

      Volume: -

    • Related Report
      2021 Annual Research Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [Journal Article] Excluding PH Pessiland2022

    • Author(s)
      Shuichi Hirahara, Rahul Santhanam
    • Journal Title

      Proceedings of the 13th Innovations in Theoretical Computer Science Conference (ITCS 2022)

      Volume: -

    • Related Report
      2021 Annual Research Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [Journal Article] Errorless Versus Error-Prone Average-Case Complexity2022

    • Author(s)
      Shuichi Hirahara, Rahul Santhanam
    • Journal Title

      Proceedings of the 13th Innovations in Theoretical Computer Science Conference (ITCS 2022)

      Volume: -

    • Related Report
      2021 Annual Research Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [Journal Article] Quantum Logarithmic Space and Post-selection2021

    • Author(s)
      Francois Le Gall, Harumichi Nishimura and Abuzer Yakaryilmaz
    • Journal Title

      Proceedings of the 16th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2021)

      Volume: -

    • Related Report
      2021 Annual Research Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [Journal Article] Test of Quantumness with Small-Depth Quantum Circuits2021

    • Author(s)
      Shuichi Hirahara and Francois Le Gall
    • Journal Title

      Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)

      Volume: -

    • Related Report
      2021 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Quantum Advantage with Shallow Circuits under Arbitrary Corruption2021

    • Author(s)
      Atsuya Hasegawa and Francois Le Gall
    • Journal Title

      Proceedings of the 32nd International Symposium on Algorithms and Computation (ISAAC 2021)

      Volume: -

    • Related Report
      2021 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Lower Bounds for Induced Cycle Detection in Distributed Computing2021

    • Author(s)
      Francois Le Gall and Masayuki Miyamoto
    • Journal Title

      Proceedings of the 32nd International Symposium on Algorithms and Computation (ISAAC 2021)

      Volume: 2021

    • Related Report
      2021 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Quantum Communication Complexity of Distribution Testing2021

    • Author(s)
      Aleksandrs Belovs, Arturo Castellanos, Francois Le Gall, Guillaume Malod, Alexander A. Sherstov
    • Journal Title

      Quantum Information and Computation

      Volume: 21 Issue: 15&16 Pages: 1261-1273

    • DOI

      10.26421/qic21.15-16-1

    • Related Report
      2021 Annual Research Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [Journal Article] Low-congestion shortcut and graph parameters2021

    • Author(s)
      Kitamura Naoki、Kitagawa Hirotaka、Otachi Yota、Izumi Taisuke
    • Journal Title

      Distributed Computing

      Volume: 34 Issue: 5 Pages: 349-365

    • DOI

      10.1007/s00446-021-00401-x

    • Related Report
      2021 Annual Research Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [Journal Article] Average-case hardness of NP from exponential worst-case hardness assumptions2021

    • Author(s)
      Hirahara Shuichi
    • Journal Title

      Proc. of the 53rd Annual ACM Symposium on Theory of Computing

      Volume: ACM53 Pages: 292-302

    • DOI

      10.1145/3406325.3451065

    • Related Report
      2021 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Hardness of Constant-round Communication Complexity2021

    • Author(s)
      Shuichi Hirahara, Rahul Ilango, Bruno Loff
    • Journal Title

      Proceedings of the 36th Computational Complexity Conference (CCC 2021

      Volume: -

    • Related Report
      2021 Annual Research Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [Journal Article] Cryptographic Hardness Under Projections for Time-Bounded Kolmogorov Complexity2021

    • Author(s)
      Eric Allender, John Gouwar, Shuichi Hirahara, Caleb Robelle
    • Journal Title

      Proceedings of the 32nd International Symposium on Algorithms and Computation (ISAAC 2021)

      Volume: -

    • Related Report
      2021 Annual Research Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [Journal Article] One-tape Turing machine and branching program lower bounds for MCSP2021

    • Author(s)
      Mahdi Cheraghchi, Shuichi Hirahara, Dimitrios Myrisiotis, Yuichi Yoshida
    • Journal Title

      Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science

      Volume: -

    • Related Report
      2021 Annual Research Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [Journal Article] Tight Distributed Listing of Cliques2021

    • Author(s)
      Keren Censor-Hillel, Yi-Jun Chang, Francois Le Gall and Dean Leitersdorf
    • Journal Title

      Proceedings of the 32nd ACM-SIAM Symposium on Discrete Algorithms (SODA 2021)

      Volume: SODA 2021 Pages: 2878-2891

    • DOI

      10.1137/1.9781611976465.171

    • ISBN
      9781611976465
    • Related Report
      2020 Annual Research Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [Journal Article] Distributed Quantum Proofs for Replicated Data2021

    • Author(s)
      Pierre Fraigniaud, Francois Le Gall, Harumichi Nishimura and Ami Paz
    • Journal Title

      Proceedings of the 12th Innovations in Theoretical Computer Science Conference (ITCS 2021)

      Volume: -

    • Related Report
      2020 Annual Research Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [Journal Article] Nearly Optimal Average-Case Complexity of Counting Bicliques Under SETH2021

    • Author(s)
      Shuichi Hirahara, Nobutaka Shimizu
    • Journal Title

      Proceedings of the 32nd ACM-SIAM Symposium on Discrete Algorithms (SODA 2021)

      Volume: - Pages: 2346-2365

    • Related Report
      2020 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Quantum Speedup for the Minimum Steiner Tree Problem2020

    • Author(s)
      Miyamoto Masayuki、Iwamura Masakazu、Kise Koichi、Francois Le Gall
    • Journal Title

      Lecture Notes in Computer Science (COCOON 2020)

      Volume: 12273 Pages: 234-245

    • DOI

      10.1007/978-3-030-58150-3_19

    • ISBN
      9783030581497, 9783030581503
    • Related Report
      2020 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Quantum-Inspired Classical Algorithms for Singular Value Transformation2020

    • Author(s)
      Dhawal Jethwani, Francois Le Gall and Sanjay K. Singh
    • Journal Title

      Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)

      Volume: -

    • Related Report
      2020 Annual Research Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [Journal Article] Brief Announcement: Distributed Quantum Proofs for Replicated Data2020

    • Author(s)
      Pierre Fraigniaud, Francois Le Gall, Harumichi Nishimura and Ami Paz
    • Journal Title

      Proceedings of the 34th International Symposium on Distributed Computing (DISC 2020)

      Volume: -

    • Related Report
      2020 Annual Research Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [Journal Article] Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs2020

    • Author(s)
      Keren Censor-Hillel, Orr Fischer, Tzlil Gonen, Francois Le Gall, Dean Leitersdorf and Rotem Oshman
    • Journal Title

      Proceedings of the 34th International Symposium on Distributed Computing (DISC 2020)

      Volume: -

    • Related Report
      2020 Annual Research Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [Journal Article] On Distributed Listing of Cliques2020

    • Author(s)
      Keren Censor-Hillel, Francois Le Gall and Dean Leitersdorf
    • Journal Title

      Proceedings of the 39th ACM Symposium on Principles of Distributed Computing (PODC 2020)

      Volume: - Pages: 474-482

    • DOI

      10.1145/3382734.3405742

    • Related Report
      2020 Annual Research Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [Journal Article] Sublinear-Space Lexicographic Depth-First Search for Bounded Treewidth Graphs and Planar Graphs2020

    • Author(s)
      Taisuke Izumi, Yota Otachi
    • Journal Title

      Proceedings of the 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)

      Volume: -

    • Related Report
      2020 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Characterizing Average-Case Complexity of PH by Worst-Case Meta-Complexity2020

    • Author(s)
      Hirahara Shuichi
    • Journal Title

      in Proc. IEEE FOCS 2020

      Volume: IEEE Pages: 50-60

    • DOI

      10.1109/focs46700.2020.00014

    • Related Report
      2020 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Non-Disjoint Promise Problems from Meta-Computational View of Pseudorandom Generator Constructions2020

    • Author(s)
      Shuichi Hirahara
    • Journal Title

      Proceedings of the 35th Computational Complexity Conference (CCC 2020)

      Volume: -

    • Related Report
      2020 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Unexpected hardness results for Kolmogorov complexity under uniform reductions2020

    • Author(s)
      Shuichi Hirahara
    • Journal Title

      in Proc. ACM STOC 2020

      Volume: ACM Pages: 1038-1051

    • DOI

      10.1145/3357713.3384251

    • Related Report
      2020 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] On Nonadaptive Security Reductions of Hitting Set Generators2020

    • Author(s)
      Shuichi Hirahara, Osamu Watanabe
    • Journal Title

      Proceedings of the International Conference on Randomization and Computation (RANDOM 2020)

      Volume: -

    • Related Report
      2020 Annual Research Report
    • Peer Reviewed / Open Access
  • [Presentation] Quantum distributed computing: potential and limitations2023

    • Author(s)
      Francois Le Gall
    • Organizer
      2023 Conference on Principles of Distributed Systems (OPODIS 2023)
    • Related Report
      2023 Annual Research Report
    • Int'l Joint Research / Invited
  • [Presentation] メタ計算量と平均時計算量2023

    • Author(s)
      平原 秀一
    • Organizer
      コンピュテーション研究会(COMP)
    • Related Report
      2023 Annual Research Report
    • Invited
  • [Presentation] Meta-complexity and average-case complexity2023

    • Author(s)
      Shuichi Hirahara
    • Organizer
      Computational Complexity Conference (CCC 2023)
    • Related Report
      2023 Annual Research Report
    • Int'l Joint Research / Invited
  • [Presentation] Theoretical Foundations of Quantum Advantage in Quantum Computing2023

    • Author(s)
      Francois Le Gall
    • Organizer
      京都大学基礎物理学研究所 創立70周年記念シンポジウム
    • Related Report
      2023 Annual Research Report
    • Invited
  • [Presentation] Quantum Algorithms: Applications and Theoretical Foundations2023

    • Author(s)
      Francois Le Gall
    • Organizer
      The 13 th International Symposium for Sustainability by Engineering at Mie University (Research Area C)
    • Related Report
      2023 Annual Research Report
    • Int'l Joint Research / Invited
  • [Presentation] Improved Hardness Results for the Guided Local Hamiltonian Problem2023

    • Author(s)
      Sevag Gharibian, Ryu Hayakawa, Francois Le Gall and Tomoyuki Morimae
    • Organizer
      26th Conference on Quantum Information Processing (QIP 2023)
    • Related Report
      2022 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Quantum Distributed Computing2023

    • Author(s)
      Francois Le Gall
    • Organizer
      Workshop on Advances in Distributed Graph Algorithms (ADGA 2022)
    • Related Report
      2022 Annual Research Report
    • Int'l Joint Research / Invited
  • [Presentation] ガイド付きローカルハミルトニアン問題の計算複雑性の進展2022

    • Author(s)
      Sevag Gharibian, Ryu Hayakawa, Francois Le Gall and Tomoyuki Morimae
    • Organizer
      第47回量子情報技術研究会
    • Related Report
      2022 Annual Research Report
  • [Presentation] Distributed Merlin-Arthur Synthesis of Quantum States and Its Applications2022

    • Author(s)
      Francois Le Gall, Masayuki Miyamoto, Harumichi Nishimura
    • Organizer
      第47回量子情報技術研究会
    • Related Report
      2022 Annual Research Report
  • [Presentation] 多人数の量子通信複雑性における新しい手法2022

    • Author(s)
      Francois Le Gall, Daiki Suruga
    • Organizer
      第47回量子情報技術研究会
    • Related Report
      2022 Annual Research Report
  • [Presentation] Theoretical Foundations of Quantum Advantage2022

    • Author(s)
      Francois Le Gall
    • Organizer
      Q2B 2022
    • Related Report
      2022 Annual Research Report
    • Int'l Joint Research / Invited
  • [Presentation] 分散量子対話型証明2022

    • Author(s)
      Francois Le Gall, Masayuki Miyamoto, Harumichi Nishimura
    • Organizer
      第6回量子ソフトウェア研究会
    • Related Report
      2022 Annual Research Report
  • [Presentation] Bounds on oblivious multiparty quantum communication complexity2022

    • Author(s)
      Francois Le Gall, Daiki Suruga
    • Organizer
      第6回量子ソフトウェア研究会
    • Related Report
      2022 Annual Research Report
  • [Presentation] Quantum algorithms for large-scale problems2021

    • Author(s)
      Francois Le Gall
    • Organizer
      Quantum Innovation 2021, the International Symposium on Quantum Science, Technology and Innovation
    • Related Report
      2021 Annual Research Report
    • Int'l Joint Research / Invited
  • [Presentation] 分散計算における誘導サイクル発見問題の下界2021

    • Author(s)
      Francois Le Gall, 宮本昌幸
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Related Report
      2021 Annual Research Report
  • [Presentation] Loosely-Stabilizing Maximal Independent Set Algorithms with Unreliable Communications2021

    • Author(s)
      Rongcheng Dong, Yuichi Sudo, Taisuke Izumi, Toshimitsu Masuzawa
    • Organizer
      23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2021)
    • Related Report
      2021 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Pierre Fraigniaud, Francois Le Gall, Harumichi Nishimura and Ami Paz2021

    • Author(s)
      Distributed Quantum Proofs for Replicated Data
    • Organizer
      24th Annual Conference on Quantum Information Processing (QIP 2021)
    • Related Report
      2020 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Tight Distributed Listing of Cliques2021

    • Author(s)
      Francois Le Gall
    • Organizer
      電子情報通信学会 コンピュテーション研究会
    • Related Report
      2020 Annual Research Report
    • Invited
  • [Presentation] Average-Case Quantum Advantage for Shallow Circuits2021

    • Author(s)
      Francois Le Gall
    • Organizer
      20th Asian Quantum Information Science Conference (AQIS '20)
    • Related Report
      2020 Annual Research Report
    • Int'l Joint Research / Invited
  • [Presentation] ノイズ付き浅層回路による量子計算の優位性2021

    • Author(s)
      Francois Le Gall, 長谷川 敦哉
    • Organizer
      第2回量子ソフトウェア研究会
    • Related Report
      2020 Annual Research Report
  • [Presentation] Distributed Quantum Proofs for Replicated Data2020

    • Author(s)
      Pierre Fraigniaud, Francois Le Gall, Harumichi Nishimura and Ami Paz
    • Organizer
      第一回量子ソフトウェア研究会
    • Related Report
      2020 Annual Research Report
  • [Presentation] Quantum Speedup for the Minimum Steiner Tree Problem2020

    • Author(s)
      宮本昌幸, 岩村 雅一, 黄瀬浩一, Francois Le Gall
    • Organizer
      第一回量子ソフトウェア研究会
    • Related Report
      2020 Annual Research Report
  • [Presentation] 浅層量子回路による平均量子優位性2020

    • Author(s)
      Francois Le Gall
    • Organizer
      第19回情報科学技術フォーラム(FIT2020)
    • Related Report
      2020 Annual Research Report
    • Invited
  • [Presentation] Tight First- and Second-Order Regret Bounds for Adversarial Linear Bandits2020

    • Author(s)
      Shinji Ito, Shuichi Hirahara, Tasuku Soma, Yuichi Yoshida
    • Organizer
      Conference on Neural Information Processing Systems (NeurIPS 2020)
    • Related Report
      2020 Annual Research Report

URL: 

Published: 2020-04-28   Modified: 2025-01-30  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi