HIRAISHI Hidefumi

Department of MathematicsAssociate Professor

Researcher Information

Field Of Study

  • Informatics, Information theory, Algorithm Theory
  • Natural sciences, Geometry, Discrete Geometry

Career

  • 2024 - Present
    Nihon University, College of Science and Technology, 教授
  • 2021 - 2024
    Nihon University, College of Science and Technology, Associate Professor
  • 2016 - 2021
    The University of Tokyo, Faculty of Science, Assistant Professor

Educational Background

  • The University of Tokyo, Graduate School of Information Science and Technology Doctoral Program
  • The University of Tokyo, Graduate School of Information Science and Technology Master Program
  • The University of Tokyo, Faculty of Science
Research activity information

Paper

  • Testing Scalable Bell Inequalities for Quantum Graph States on IBM Quantum Devices
    Bo Yang, Rudy Raymond, Hiroshi Imai, Hyungseok Chang, Hidefumi Hiraishi
    IEEE Journal on Emerging and Selected Topics in Circuits and Systems, Aug. 2022, Refereed
  • Extended Formulations of Lower-truncated Transversal Polymatroids
    Hiroshi Imai, Keiko Imai, Hidefumi Hiraishi
    Optimization Methods and Software, Jun. 2021, Refereed
  • Revisiting the Top-Down Computation of BDD of Spanning Trees of a Graph and Its Tutte Polynomial
    Farley Soares Oliveira, Hidefumi Hiraishi, Hiroshi Imai
    IEICE Transactions, Sep. 2019, Refereed
  • Excluded Minors for Q-Representability in Algebraic Extension
    Hidefumi Hiraishi, Sonoko Moriyama
    IEICE Transactions, Sep. 2019, Refereed
  • FPT Algorithms to Enumerate and Count Acyclic and Totally Cyclic Orientations
    Farley Soares Oliveira, Hidefumi Hiraishi, Hiroshi Imai
    Electronic Notes in Theoretical Computer Science, Aug. 2019, Refereed
  • FPT Algorithms Exploiting Carving Decomposition for Eulerian Orientations and Ice-Type Models
    Shinya Shiroshita, Tomoaki Ogasawara, Hidefumi Hiraishi, Hiroshi Imai
    Lecture Notes in Computer Science (Proc. of WALCOM 2018), 2018, Refereed
  • Parameterized Algorithms to Compute Ising Partition Function
    Hidefumi Hiraishi, Hiroshi Imai, Yoichi Iwata, Bingkai Lin
    IEICE Transactions, 2018, Refereed
  • Excluded Minors of Rank 3 for Orientability and Representability
    Hidefumi Hiraishi, Sonoko Moriyama
    IEICE Transactions, 2018, Refereed
  • Parametric Multiroute Flow and its Application to Multilink-attack Network
    Jean-François Baffier, Vorapong Suppakitpaisarn, Hidefumi Hiraishi, Hiroshi Imai
    Discrete Optimization, 2016, Refereed
  • Minimal Non-orientable Matroids of Rank Three
    Hidefumi Hiraishi, Sonoko Moriyama
    European Journal of Combonbinatorics, 2015, Refereed
  • BDD Operations for Quantum Graph States
    Hidefumi Hiraishi, Hiroshi Imai
    Lecture Notes in Computer Science (Proc. of RC 2014), 2014, Refereed
  • Parametric Multiroute Flow and Its Application to Robust Network with k Edge Failures
    Jean-François Baffier, Vorapong Suppakitpaisarn, Hidefumi Hiraishi, Hiroshi Imai
    Lecture Notes in Computer Science (Proc. of ISCO 2014), 2014, Refereed
  • A New Infinite Family of Minimal Non-orientable Matroids of Rank 3 with 3n Elements
    Hidefumi Hiraishi, Sonoko Moriyama
    Electronic Notes in Discrete Mathematics, 2013, Refereed

Lectures, oral presentations, etc.

  • Experimental Realization of Quantum Non-locality on IBM Quantum Devices
    Kosei Teramoto, Yang Bo, Rudy Raymond, Atsuya Hasegawa, Hiroshi Imai, Hidefumi Hiraishi
    電子情報通信学会量子情報技術研究会, May 2021
  • Testing Scalable Bell Inequalities for Quantum Graph States on IBM Quantum Devices
    Bo Yang, Rudy Raymond, Hiroshi Imai, Hyungseok Chang, Hidefumi Hiraishi
    情報処理学会量子ソフトウェア研究発表, Mar. 2021
  • The Implementation of Deutsch-Jozsa's algorithm on IBM Quantum by Bidirectional Computation
    Hyungseok Chang, Hidefumi Hiraishi, Hiroshi Imai
    情報処理学会量子ソフトウェア研究発表, Mar. 2021
  • Finding an Induced Subtree in an Intersection Graph is often hard
    Hidefumi Hiraishi, Dejun Mao, Patrick Schnider
    The 36th European Workshop on Computational Geometry,, Mar. 2020
  • BDD of Eulerian Subgraphs and Computation of the Ising Partition Function
    Ryota Yonekura, Hidefumi Hiraishi, Hiroshi Imai
    The 22nd Korea-Japan Joint Workshop on Algorithms and Computation, Oct. 2019
  • Smallest Counterexamples for Convexity and Log-concavity of the Tutte Polynomial
    Hidefumi Hiraishi, Hiroshi Imai, Sonoko Moriyama, Shuma Okamura, Shinya Shiroshita
    The 11th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications, 2019
  • Breakout Local Search for Finding Graph Minors
    Kanto Teranishi, Hidefumi Hiraishi, Hiroshi Imai
    19th Asian Quantum Information Science Conference, 2019
  • A BDD-based approach to the Ising partition function via Eulerian subgraphs
    Ryota Yonekura, Hidefumi Hiraishi, Hiroshi Imai
    19th Asian Quantum Information Science Conference, 2019
  • Parameterized Algorithms for Tutte Polynomial Specializations in Graph Orientations
    Farley Soares Oliveira, Hidefumi Hiraishi, Hiroshi Imai
    情報処理学会第172回アルゴリズム研究発表会, 2019
  • Simulated Quantum AnnealingとBreakout Local Search の NP-hard問題に対する実験的な比較
    寺西寛人, 平石秀史, 今井浩
    情報処理学会第172回アルゴリズム研究発表会, 2019
  • A BDD Approach to Counting Problems in Graphic Arrangements
    Farley Soares Oliveira, Hidefumi Hiraishi, Hiroshi Imai
    The 21st Japan–Korea Joint Workshop on Algorithms and Computation, 2018
  • Parameterized Algorithm to Compute the Partition Function of Potts Model with Branch Decomposition
    Naosuke Shindo, Hidefumi Hiraishi, Imai Hiroshi
    The 21st Japan–Korea Joint Workshop on Algorithms and Computation, 2018
  • FPT Algorithms Exploiting Carving Decomposition for Eulerian Orientations and Ice-Type Models
    Shinya Shiroshita, Tomoaki Ogasawara, Hidefumi Hiraishi, Hiroshi Imai
    The 12th International Conference and Workshops on Algorithms and Computation, 2018
  • Simulated Quantum Annealing versus Breakout Local Search for Benchmark Dataset on NP-hard Problems
    Kanto Teranishi, Hidefumi Hiraishi, Hiroshi Imai
    18th Asian Quantum Information Science Conference, 2018
  • An FPT Algorithm for Counting the Number of Eulerian Orientations Exploiting Carving Decomposition
    Shinya Shiroshita, Tomoaki Ogasawara, Hidefumi Hiraishi, Hiroshi Imai
    The 20th Japan–Korea Joint Workshop on Algorithms and Computation, 2017
  • Comparing Simulated Annealing with Simulated Quantum Annealing on Max-cut and Other NP-Hard Problems
    Hyungseok Chang, Hidefumi Hiraishi, Hiroshi Imai
    17th Asian Quantum Information Science Conference, 2017
  • Experimental Evaluation of Annealing Metaheuristics for NP-Hard Problems
    Hyungseok Chang, Hidefumi Hiraishi, Hiroshi Imai
    The 20th Japan–Korea Joint Workshop on Algorithms and Computation, 2017
  • 制限付きボルツマンマシンに対する経路積分モンテカルロ法の実験的評価
    張亨碩, 橋本朔弥, 平石秀史, 今井浩
    人工知能学会第104回人工知能基本問題研究会, 2017
  • A Note on Extended Formulations of Lower-truncated Transversal Polymatroids
    Hiroshi Imai, Hidefumi Hiraishi, Shuichi Hirahara
    International Conference on Continuous Optimization, 2016
  • Excluded Minors for Q-Representable Matroids in Algebraic Extension
    Hidefumi Hiraishi, Sonoko Moriyama
    The 18th Japan Conference on Discrete and Computational Geometry and Graphs, 2015

Research Themes

  • マトロイドの臨界問題の新展開と解決への複合的アプローチ
    日本学術振興会, 科学研究費助成事業, 01 Apr. 2020 - 31 Mar. 2025
    城本 啓介; 籾原 幸二; 平石 秀史; 丸田 辰哉; 千葉 周也
  • Graph and Matroid Decomposition
    Japan Society for the Promotion of Science, Grants-in-Aid for Scientific Research, 01 Apr. 2017 - 31 Mar. 2020
    Hiraishi Hidefumi
  • Exploiting Matroid Minor Theory and Its Connection with Quantum Computing Models
    Japan Society for the Promotion of Science, Grants-in-Aid for Scientific Research, 01 Apr. 2014 - 31 Mar. 2017
    IMAI Hiroshi; MORIYAMA Sonoko; HIRAISHI Hidefumi