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

Computational and Quantum-Physical Approach to Graph Optimization and Invariants for Quantum Advantage

Research Project

Project/Area Number 18K19776
Research Category

Grant-in-Aid for Challenging Research (Exploratory)

Allocation TypeMulti-year Fund
Review Section Medium-sized Section 60:Information science, computer engineering, and related fields
Research InstitutionThe University of Tokyo

Principal Investigator

Imai Hiroshi  東京大学, 大学院情報理工学系研究科, 教授 (80183010)

Project Period (FY) 2018-06-29 – 2022-03-31
Project Status Completed (Fiscal Year 2021)
Budget Amount *help
¥6,370,000 (Direct Cost: ¥4,900,000、Indirect Cost: ¥1,470,000)
Fiscal Year 2020: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
Fiscal Year 2019: ¥2,340,000 (Direct Cost: ¥1,800,000、Indirect Cost: ¥540,000)
Fiscal Year 2018: ¥2,470,000 (Direct Cost: ¥1,900,000、Indirect Cost: ¥570,000)
Keywords量子計算 / 量子優越性 / グラウ最適化 / グラフ不変量 / 計算量理論 / 近似量子コンピュータ / 統計物理 / グラフ / マトロイド / 最適化 / 量子コンピュータ / BDD / 量子優位性 / FPTアルゴリズム / マイナー埋込 / 不変多項式 / 量子超越性 / 量子畳込み / グラフ最適化
Outline of Final Research Achievements

For the problem of computing the Ising partition function of a graph, we focus on graph parameters such as branch width and rank width, and present multiple efficient algorithms which are quite efficient when those parameters are relatively small. We extend computing such invariants from the Ising partition function to the Potts partition function and then to the 2-variable Tutte polynomial of the graph. We also obtain results on the number of acyclic or totally cyclic orientations by orienting each edges of the graph. The smallest counterexample in which the unimodality of the Tutte polynomial does not hold is given. With regard to quantum advantage, we verified the violation of various Bell inequalities in the IBM quantum computers. We demonstrated nonlocal qunautm effects these near-term approximate quantum computers, which lead to shoing the quantum advantage in shallow quantum circuits.

Academic Significance and Societal Importance of the Research Achievements

量子コンピュータ開発のスピードが、グローバルな研究投資によって実機が使えるようになり、本研究で開発した古典・量子アルゴリズムについて、研究当初は難しかった量子コンピュータにより実験するところまで到達できている。それによって、現在のノイズのある近似量子コンピュータにおける誤差緩和手法の適用と、さらなる方向の提示もでき、当初の予想を超える研究発表を行うことができている。シミュレーションではなく、近似量子コンピュータ実機による実験を先駆的に発表することで、社会的にも量子コンピュータの時代の到来を認識できるものとなっている。

Report

(5 results)
  • 2021 Annual Research Report   Final Research Report ( PDF )
  • 2020 Research-status Report
  • 2019 Research-status Report
  • 2018 Research-status Report
  • Research Products

    (26 results)

All 2022 2021 2020 2019 2018

All Journal Article (8 results) (of which Peer Reviewed: 8 results,  Open Access: 2 results) Presentation (18 results) (of which Int'l Joint Research: 7 results,  Invited: 1 results)

  • [Journal Article] Extended formulations of lower-truncated transversal polymatroids2020

    • Author(s)
      Imai Hiroshi、Imai Keiko、Hiraishi Hidefumi
    • Journal Title

      Optimization Methods and Software

      Volume: 36 Issue: 2-3 Pages: 1-6

    • DOI

      10.1080/10556788.2020.1769619

    • Related Report
      2020 Research-status Report
    • Peer Reviewed / Open Access
  • [Journal Article] Extended Formulations of Lower-TruncatedTransversal Polymatroids2020

    • Author(s)
      Hiroshi Imai, Keiko Imai and Hidefumi Hiraishi
    • Journal Title

      Optimization Methods and Software

      Volume: online first

    • Related Report
      2019 Research-status Report
    • Peer Reviewed
  • [Journal Article] Revisiting the Top-Down Computation of BDD of Spanning Trees of a Graph and Its Tutte Polynomial2019

    • Author(s)
      Farley Soares Oliveira, Hidefumi Hiraishi and Hiroshi Imai
    • Journal Title

      IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

      Volume: E102.A Issue: 9 Pages: 1022-1027

    • DOI

      10.1587/transfun.E102.A.1022

    • NAID

      130007699447

    • ISSN
      0916-8508, 1745-1337
    • Year and Date
      2019-09-01
    • Related Report
      2019 Research-status Report
    • Peer Reviewed
  • [Journal Article] Revisiting the Top-Down Computation of BDD of Spanning Trees of a Graph and Its Tutte Polynomial2019

    • Author(s)
      F. S. Oliveira, H. Hiraishi, and H. Imai
    • Journal Title

      IEICE Trans. Fundamentals

      Volume: -

    • NAID

      130007699447

    • Related Report
      2018 Research-status Report
    • Peer Reviewed / Open Access
  • [Journal Article] Smallest Counterexamples for Convexity and Log-concavity of the Tutte Polynomial2019

    • Author(s)
      Hidefumi Hiraishi, Hiroshi Imai, Sonoko Moriyama, Shuma Okamura, and Shinya Shiroshita
    • Journal Title

      The 11th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications

      Volume: ー

    • Related Report
      2018 Research-status Report
    • Peer Reviewed
  • [Journal Article] FPT Algorithms to Enumerate and Count Acyclic and Totally Cyclic Orientations2019

    • Author(s)
      F. S. Oliveira, H. Hiraishi, and H. Imai
    • Journal Title

      The X Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2019)

      Volume: -

    • Related Report
      2018 Research-status Report
    • Peer Reviewed
  • [Journal Article] A BDD Approach to Counting Problems in Graphic Arrangements2018

    • Author(s)
      F. S. Oliveira, H. Hiraishi, H. Imai
    • Journal Title

      The 21st Japan-Korea Joint Workshop on Algorithms and Computation (WAAC 2018)

      Volume: -

    • Related Report
      2018 Research-status Report
    • Peer Reviewed
  • [Journal Article] Parameterized Algorithm to Compute the Partition Function of Potts Model with Branch Decomposition2018

    • Author(s)
      N. Shindo, H. Hiraishi, and H. Imai
    • Journal Title

      The 21st Japan-Korea Joint Workshop on Algorithms and Computation (WAAC 2018)

      Volume: -

    • Related Report
      2018 Research-status Report
    • Peer Reviewed
  • [Presentation] 量子計算機での勾配推定を用いた変分量子固有値法における変分パラメータ最適化2022

    • Author(s)
      津嘉山大輔, 三木司, 沖田涼, 白樫淳, 今井浩
    • Organizer
      第69回応用物理学会春季学術講演会
    • Related Report
      2021 Annual Research Report
  • [Presentation] Machine learning techniques for unitary design classification: A comparative study.2022

    • Author(s)
      Yaswitha Gujju, Bo Yang, Yuko Kuroki and Hiroshi Imai
    • Organizer
      Quantum Information Processing (QIP 2022)
    • Related Report
      2021 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Experimental Realization of Quantum Non-locality on IBM Quantum Devices.2021

    • Author(s)
      Kosei Teramoto, Yang Bo, Rudy Raymond, Atsuya Hasegawa, Hiroshi Imai and Hidefumi Hiraishi
    • Organizer
      電子情報通信学会第44回量子情報技術研究会
    • Related Report
      2021 Annual Research Report
  • [Presentation] Bell不等式プロジェクト2021

    • Author(s)
      今井浩, 張亨碩
    • Organizer
      情報処理学会第3回量子ソフトウェア研究発表会
    • Related Report
      2021 Annual Research Report
  • [Presentation] 最大カットに対するQAOAと古典近似アルゴリズムの近似率2021

    • Author(s)
      今井浩, 佐藤英一郎
    • Organizer
      情報処理学会第4回量子ソフトウェア研究発表会
    • Related Report
      2021 Annual Research Report
  • [Presentation] Machine Learning techniques for unitary design classification2021

    • Author(s)
      Yaswitha Gujju, Bo Yang, Yuko Kuroki and Hiroshi Ima
    • Organizer
      電子情報通信学会第45回量子情報技術研究会
    • Related Report
      2021 Annual Research Report
  • [Presentation] Testing Scalable Bell Inequalities for Quantum Graph States on IBM Quantum Devices2021

    • Author(s)
      Bo Yang, Rudy Raymond, Hiroshi Imai, Hyungseok Chang, Hidefumi Hiraishi
    • Organizer
      Quantum Information Processing 2021 (QIP 21)
    • Related Report
      2020 Research-status Report
    • Int'l Joint Research
  • [Presentation] Testing Scalable Bell Inequalities for Quantum Graph States on IBM Quantum Devices2021

    • Author(s)
      楊博, Rudy Raymond, 今井浩, 張亨碩, 平石秀史
    • Organizer
      情報処理学会第2回量子ソフトウェア研究発表会
    • Related Report
      2020 Research-status Report
  • [Presentation] he Implementation of Deutsch-Jozsa's algorithm on IBM Quantum by Bidirectional Computation2021

    • Author(s)
      張亨碩, 平石秀史, 今井浩
    • Organizer
      情報処理学会第2回量子ソフトウェア研究発表会
    • Related Report
      2020 Research-status Report
  • [Presentation] FPT algorithms to enumerate and count acyclic and totally cyclic orientations2019

    • Author(s)
      F. S. Oliveira, H. Hiraishi and H. Imai
    • Organizer
      The tenth Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2019)
    • Related Report
      2019 Research-status Report
    • Int'l Joint Research
  • [Presentation] A BDD-based approach to the Ising partition function via Eulerian subgraphs2019

    • Author(s)
      R. Yonekura, H. Hiraishi and H. Imai
    • Organizer
      19th Asian Quantum Information Science Conference, Seoul, Korea (2019)
    • Related Report
      2019 Research-status Report
    • Int'l Joint Research
  • [Presentation] Breakout Local Search for Finding Graph Minors2019

    • Author(s)
      K. Teranishi, H. Hiraishi and H. Imai
    • Organizer
      19th Asian Quantum Information Science Conference, Seoul, Korea (2019)
    • Related Report
      2019 Research-status Report
    • Int'l Joint Research
  • [Presentation] BDD of Eulerian subgraphs and computation of the Ising partition function2019

    • Author(s)
      R. Yonekura, H. Hiraishi and H. Imai
    • Organizer
      The 22nd Korea-Japan Joint Workshop on Algorithms and Computation, Daejeon, Korea (2019)
    • Related Report
      2019 Research-status Report
    • Int'l Joint Research
  • [Presentation] F. S. Oliveira, H. Hiraishi, and H. Imai2019

    • Author(s)
      F. S. Oliveira, H. Hiraishi, and H. Imai
    • Organizer
      3rd ETH Zurich-UTokyo Strategic Partnership Symposium on the UN Sustainable Development Goals and Innovation
    • Related Report
      2018 Research-status Report
    • Int'l Joint Research
  • [Presentation] Parameterized Algorithms for Tutte Polynomial Specializations in Graph Orientations2019

    • Author(s)
      F. S. Oliveira, H. Hiraishi, H. Imai
    • Organizer
      情報処理学会第172回アルゴリズム研究会
    • Related Report
      2018 Research-status Report
  • [Presentation] Simulated Quantum AnnealingとBreakout Local SearchのNP-hard問題に対する実験的な比較2019

    • Author(s)
      寺西 寛人, 今井 浩, 平石 秀史
    • Organizer
      情報処理学会第172回アルゴリズム研究会
    • Related Report
      2018 Research-status Report
  • [Presentation] 最大カット問題と量子計算 --- 常識の「嘘」も考えながら2018

    • Author(s)
      今井浩
    • Organizer
      日本OR学会最適化とその応用研究部会未来を担う若手研究者の集い 2018(招待講演)
    • Related Report
      2018 Research-status Report
    • Invited
  • [Presentation] Simulated Quantum Annealing versus Breakout Local Search for Benchmark Dataset on NP-hard Problems2018

    • Author(s)
      K. Teranishi, H. Imai, H, Hiraishi
    • Organizer
      Asian Quantum Information Science Conference (AQIS 2018)
    • Related Report
      2018 Research-status Report

URL: 

Published: 2018-07-25   Modified: 2023-01-30  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi