KEIO RESEARCHERS INFORMATION SYSTEM

Career 【 Display / hide 】

Career 【 Display / hide 】

• 2008.04

  -

  2010.03

  The University of Tokyo, Institute of Solid State Physics, Postdoctoral fellow

• 2010.04

  -

  2011.03

  Kindai University, Quantum Computing Center, 博士研究員

• 2011.04

  -

  2014.03

  The University of Tokyo, Department of Chemistry, Research Fellowship for Young Scientists, Japan Society for the Promotion of Science

• 2014.04

  -

  2015.03

  Kyoto University, Yukawa Institute for Theoretical Physics, Postdoctoral Fellow (Yukawa Fellow)

• 2014.10

  -

  2015.01

  Kyoto University, Faculty of Integrated Human Studies, Part-time Lecturer

display all >>

Academic Background 【 Display / hide 】

Academic Background 【 Display / hide 】

• 1999.04

  -

  2003.03

  Tokyo Institute of Technology, School of Science, Department of Physics

  University, Graduated

• 2003.04

  -

  2005.03

  The University of Tokyo, School of Science, Department of Physics

  Graduate School, Completed, Master's course

• 2005.04

  -

  2008.03

  The University of Tokyo, School of Science, Department of Physics

  Graduate School, Completed, Doctoral course

Academic Degrees 【 Display / hide 】

Academic Degrees 【 Display / hide 】

• Ph. D, The University of Tokyo, Coursework, 2008.03

  Slow Dynamics in Frustrated Magnetic Systems

Research Areas 【 Display / hide 】

Research Areas 【 Display / hide 】

• Natural Science / Mathematical physics and fundamental theory of condensed matter physics

Research Keywords 【 Display / hide 】

Research Keywords 【 Display / hide 】

• 量子アニーリング

• イジングマシン

• 物性理論

• 統計力学

• 計算物理学

Research Themes 【 Display / hide 】

Research Themes 【 Display / hide 】

• Quantum annealing, Ising machine, 

  2006

  -

  Present

  　View Summary

  量子アニーリング等イジングマシンのハードウェア開発やソフトウェア・内部アルゴリズム開発につながる基礎研究や、量子アニーリング等イジングマシンの有効なアプリケーションを探る応用研究を、多くの企業や大学、研究所の方々と緊密に連携しながら行っております。

Proposed Theme of Joint Research 【 Display / hide 】

Proposed Theme of Joint Research 【 Display / hide 】

• 量子アニーリング等イジングマシンの有効なアプリケーション探索

  Interested in joint research with industry (including private organizations, etc.),  Desired form： Technical Consultation, Funded Research, Cooperative Research

• 量子アニーリング等イジングマシンのソフトウェア開発につながる基礎研究

  Interested in joint research with industry (including private organizations, etc.),  Desired form： Technical Consultation, Funded Research, Cooperative Research

• 量子アニーリング等イジングマシンのハードウェア開発につながる基礎研究

  Interested in joint research with industry (including private organizations, etc.),  Desired form： Technical Consultation, Funded Research, Cooperative Research

Books 【 Display / hide 】

Books 【 Display / hide 】

• Quantum Spin Glasses, Annealing and Computation

  Shu Tanaka, Ryo Tamura, and Bikas K. Chakrabarti, Cambridge University Press, 2017.05,  Page： 418

• Kinki University Series on Quantum Computing Series “Lectures on Quantum Computing, Thermodynamics and Statistical Physics”

  Shu Tanaka and Ryo Tamura, World Scientific, 2012.12

  Scope: Quantum Annealing from the Viewpoint of Statistical Physics, Condensed Matter Physics, and Computational Physics,  Contact page： 3-59

• Lecture Note in Physics “Quantum Quenching, Annealing, and Computation”

  Shu Tanaka, Masaki Hirano, and Seiji Miyashita, Springer, 2010.05

  Scope: Roles of Quantum Fluctuation in Frustrated Systems -- Order by Disorder and Reentrant Phase Transition --,  Contact page： 215-234

Papers 【 Display / hide 】

Papers 【 Display / hide 】

• An Approach to the Vehicle Routing Problem with Balanced Pick-up Using Ising Machines

  Bao S., Tawada M., Tanaka S., Togawa N.

  2021 International Symposium on VLSI Design, Automation and Test, VLSI-DAT 2021 - Proceedings （2021 International Symposium on VLSI Design, Automation and Test, VLSI-DAT 2021 - Proceedings)   2021.04

  ISSN  9781665419154

  　View Summary

  Vehicle routing problems (VRPs) can be solved as optimization problems. Practical applications of the VRPs are involved in various areas including manufacturing, supply chain, and tourism. Conventional approaches using von Neumann computers obtain good approximate solutions to the optimization problems, but conventional approaches show disadvantages of computation costs in large-scale or complex problems due to the combinatorial explosion. Oppositely, Ising machines or quantum annealing machines are non-von Neumann computers that are designed to solve complex optimization problems. In this paper, we propose an Ising-machine based approach for the vehicle routing problem with balanced pick-up (VRPBP). The development of the VRPBP is motivated by postal items pick-up services in the real-world. Our approach includes various features of VRP variants. We propose a 2-phase approach to solve the VRPBP and key elements in each phase are mapped onto quadratic unconstrained binary optimization (QUBO) forms. Specifically, the first phase belongs to the clustering phase which is an extension to the knapsack problem with additional distance and load balancing concerns. The second phase is mapped to the traveling salesman problem. Experimental results of our approach are evaluated in terms of solution quality and computation time compared with conventional approaches.

  • Access to Document (DOI)

• Mapping induced subgraph isomorphism problems to ising models and its evaluations by an ising machine

  Yoshimura N., Tawada M., Tanaka S., Arai J., Yagi S., Uchiyama H., Togawa N.

  IEICE Transactions on Information and Systems （IEICE Transactions on Information and Systems)  E104.D （ 4 ） 481 - 489 2021.04

  ISSN  09168532

  　View Summary

  SUMMARY Ising machines have attracted attention as they are expected to solve combinatorial optimization problems at high speed with Ising models corresponding to those problems. An induced subgraph isomorphism problem is one of the decision problems, which determines whether a specific graph structure is included in a whole graph or not. The problem can be represented by equality constraints in the words of combinatorial optimization problem. By using the penalty functions corresponding to the equality constraints, we can utilize an Ising machine to the induced subgraph isomorphism problem. The induced subgraph isomorphism problem can be seen in many practical problems, for example, finding out a particular malicious circuit in a device or particular network structure of chemical bonds in a compound. However, due to the limitation of the number of spin variables in the current Ising machines, reducing the number of spin variables is a major concern. Here, we propose an efficient Ising model mapping method to solve the induced subgraph isomorphism problem by Ising machines. Our proposed method theoretically solves the induced subgraph isomorphism problem. Furthermore, the number of spin variables in the Ising model generated by our proposed method is theoretically smaller than that of the conventional method. Experimental results demonstrate that our proposed method can successfully solve the induced subgraph isomorphism problem by using the Ising-model based simulated annealing and a real Ising machine.

  • Access to Document (DOI)

• Solving constrained slot placement problems using an ising machine and its evaluations

  Kanamaru S., Kawamura K., Tanaka S., Tomita Y., Togawa N.

  IEICE Transactions on Information and Systems （IEICE Transactions on Information and Systems)  E104D （ 2 ） 226 - 236 2021.02

  ISSN  09168532

  　View Summary

  Ising machines have attracted attention, which is expected to obtain better solutions of various combinatorial optimization problems at high speed by mapping the problems to natural phenomena. A slot-placement problem is one of the combinatorial optimization problems, regarded as a quadratic assignment problem, which relates to the optimal logic-block placement in a digital circuit as well as optimal delivery planning. Here, we propose a mapping to the Ising model for solving a slot-placement problem with additional constraints, called a constrained slot-placement problem, where several item pairs must be placed within a given distance. Since the behavior of Ising machines is stochastic and we map the problem to the Ising model which uses the penalty method, the obtained solution does not always satisfy the slot-placement constraint, which is different from the conventional methods such as the conventional simulated annealing. To resolve the problem, we propose an interpretation method in which a feasible solution is generated by post-processing procedures. We measured the execution time of an Ising machine and compared the execution time of the simulated annealing in which solutions with almost the same accuracy are obtained. As a result, we found that the Ising machine is faster than the simulated annealing that we implemented.

  • Access to Document (DOI)

• Visiting-Route Recommendation in Amusement Parks and its Evaluations by an Ising Machine

  Mukasa Y., Wakaizumi T., Tanaka S., Togawa N.

  Digest of Technical Papers - IEEE International Conference on Consumer Electronics （Digest of Technical Papers - IEEE International Conference on Consumer Electronics)  2021-January 2021.01

  ISSN  9781728197661

  　View Summary

  In an amusement park, an attraction-visiting route considering the waiting time and traveling time improves visitors' satisfaction and experience. We focus on Ising machines to solve the problem, which are recently expected to solve combinatorial optimization problems at high speed by mapping the problems to Ising models or quadratic unconstrained binary optimization (QUBO) models. We propose a mapping of the visiting-route recommendation problem in amusement parks to a QUBO model for solving it using Ising machines. By using an actual Ising machine, we could obtain feasible solutions 15 times faster with almost the same accuracy as the simulated annealing method for the visiting-route recommendation problem.

  • Access to Document (DOI)

• Exact bounds for dynamical critical exponents of transverse-field Ising chains with a correlated disorder

  Shirai T., Tanaka S.

  Annals of Physics （Annals of Physics)   2021

  ISSN  00034916

  　View Summary

  This study investigates the dynamical critical exponent of disordered Ising chains under transverse fields to examine the effect of a correlated disorder on quantum phase transitions. The correlated disorder, where the on-site transverse field depends on the nearest-neighbor coupling strengths connecting the site, gives a qualitatively different result from the uncorrelated disorder. In the uncorrelated disorder cases where the transverse field is either homogeneous over sites or random independently of the nearest-neighbor coupling strengths, the dynamical critical exponent is infinite. In contrast, in the presence of the correlated disorder, we analytically show that the dynamical critical exponent is finite. We also show that the dynamical critical exponent depends on the tuning process of the transverse field strengths.

  • Access to Document (DOI)

display all >>

Papers, etc., Registered in KOARA 【 Display / hide 】

Papers, etc., Registered in KOARA 【 Display / hide 】

• Theoretical study of quantum computing based on the hybridization of quantum and temperature effect

  Tanaka, Shu

  学事振興資金研究成果実績報告書 （慶應義塾大学)  2020

Reviews, Commentaries, etc. 【 Display / hide 】

Reviews, Commentaries, etc. 【 Display / hide 】

• イジングマシン技術の研究開発動向

  田中 宗

  技術解説書「拡大する量子コンピューティング　その社会実装ポテンシャル」 (モバイルコンピューティング推進コンソーシアム(MCPC))   2020.03

  Article, review, commentary, editorial, etc. (other), Single Work

• イジングマシンの動作原理と応用探索の最新動向

  田中 宗，松田 佳希

  表面と真空 63   96 - 103 2020

  Article, review, commentary, editorial, etc. (scientific journal), Joint Work

• 量子アニーリングや関連技術のいまと未来：AQC2019 参加報告

  田中 宗，白井 達彦，藤井 啓祐

  日本物理学会誌 75 ( 5 ) 299 - 302 2020

  Article, review, commentary, editorial, etc. (scientific journal), Joint Work

• 量子アニーリングの応用探索

  田中 宗，西村 直樹，棚橋 耕太郎

  数理科学 2019年7月号 673   47 - 53 2019.07

  Article, review, commentary, editorial, etc. (scientific journal), Joint Work

• イジングマシンに関係するソフトウェア開発およびアプリケーション探索動向

  田中 宗

  量子コンピュータ／イジング型コンピュータ研究開発最前線　〜基礎原理・最新技術動向・実用化に向けた企業の取り組み〜 (情報機構)   2019.02

  Article, review, commentary, editorial, etc. (trade magazine, newspaper, online media), Single Work

display all >>

Presentations 【 Display / hide 】

Presentations 【 Display / hide 】

• イジングマシンを用いたアミューズメントパークの経路最適化手法

  武笠 陽介、若泉 朋弥、田中 宗、戸川 望

  VLSI設計技術研究会, 

  2020.03

  , 

  Oral presentation (general)

• イジング計算機による3次元直方体パッキング問題の解法

  金丸 翔、寺田 晃太朗、川村 一志、田中 宗、富田 憲範、戸川 望

  VLSI設計技術研究会, 

  2020.03

  , 

  Oral presentation (general)

• 3 次元直方体パッキング問題のQUBOモデルマッピング

  金丸 翔、寺田 晃太朗、川村 一志、田中 宗、富田 憲範、戸川 望

  2020年電子情報通信学会総合大会, 

  2020.03

  , 

  Oral presentation (general)

• イジングマシンにおける整数バイナリ変換の性能比較

  田村 健祐、白井 達彦、桂 法称、田中 宗、戸川 望

  日本物理学会第75回年次大会, 

  2020.03

  , 

  Oral presentation (general)

• 温度効果を用いたイジングマシンにおける埋込アルゴリズムの理論

  白井 達彦、田中 宗、戸川 望

  2020年電子情報通信学会総合大会　依頼シンポジウムセッション「組合せ最適化専用イジングマシン周辺技術の現状と展望」, 

  2020.03

  , 

  Oral presentation (invited, special)

display all >>

Research Projects of Competitive Funds, etc. 【 Display / hide 】

Research Projects of Competitive Funds, etc. 【 Display / hide 】

• High Performance Computing for Materials Simulation by Quantum-Classical Hybrid Algorithms

  2021.04

  -

  2024.03

  MEXT,JSPS, Grant-in-Aid for Scientific Research, Grant-in-Aid for Scientific Research (C), Principal investigator

Awards 【 Display / hide 】

Awards 【 Display / hide 】

• 第９回日本物理学会若手奨励賞（領域11）

  田中 宗, 2015.03, 日本物理学会, 二次元量子多体系におけるエンタングルメントの研究

  Type of Award： Award from Japanese society, conference, symposium, etc.

• 東京大学大学院理学系研究科研究奨励賞（博士）

  田中 宗, 2008.03, 東京大学大学院理学系研究科

  Type of Award： Other

Courses Taught 【 Display / hide 】

Courses Taught 【 Display / hide 】

• QUANTUM COMPUTING

  2024

• PRESENTATION TECHNIQUE

  2024

• LABORATORY IN SCIENCE

  2024

• INDEPENDENT STUDY ON FUNDAMENTAL SCIENCE AND TECHNOLOGY

  2024

• GRADUATE RESEARCH ON FUNDAMENTAL SCIENCE AND TECHNOLOGY 2

  2024

display all >>

Courses Previously Taught 【 Display / hide 】

Courses Previously Taught 【 Display / hide 】

• ディジタルシステム設計

  早稲田大学基幹理工学部

  2019.04

  -

  2020.03

  , 

  Autumn Semester, Lecture, Lecturer outside of Keio

• オムニバス講義

  お茶の水女子大学

  2019.04

  -

  2020.03

  , 

  Autumn Semester, Lecture, Lecturer outside of Keio

• ディジタルシステム設計

  早稲田大学基幹理工学部

  2018.04

  -

  2019.03

  , 

  Autumn Semester, Lecture, Lecturer outside of Keio

• 物理学実験

  芝浦工業大学通信工学科

  2017.04

  -

  2018.03

  , 

  Laboratory work/practical work/exercise, Lecturer outside of Keio

• Exercises for Fundamental Physics B IPSE Course

  早稲田大学先進理工学部

  2017.04

  -

  2018.03

  , 

  Autumn Semester, Seminar

display all >>

Social Activities 【 Display / hide 】

Social Activities 【 Display / hide 】

• 平成30年度第7回生徒研究成果合同発表会助言員

  科学技術振興機構スーパーサイエンスハイスクール事業, 平成30年度第7回生徒研究成果合同発表会, 

  , 

  2019.02

• 平成29年度第6回生徒研究成果合同発表会助言員

  科学技術振興機構スーパーサイエンスハイスクール事業, 平成29年度第6回生徒研究成果合同発表会, 

  , 

  2018.02

• 平成28年度第5回生徒研究成果合同発表会助言員

  科学技術振興機構スーパーサイエンスハイスクール事業, 平成28年度第5回生徒研究成果合同発表会, 

  , 

  2017.02

• サイエンスキャッスル2016関東大会口頭講演審査員

  株式会社リバネス, サイエンスキャッスル2016関東大会, 

  , 

  2016.12

Memberships in Academic Societies 【 Display / hide 】

Memberships in Academic Societies 【 Display / hide 】

• 情報処理学会, 

  2020.04

  -

  Present

• 日本物理学会, 

  2003.12

  -

  Present

Committee Experiences 【 Display / hide 】

Committee Experiences 【 Display / hide 】

• 2021.04

  -

  Present

  Journal of the Physical Society of Japan(JPSJ)第77期編集委員

• 2020.12

  -

  2021.06

  Adiabatic Quantum Computing Conference 2021 (AQC2021) local organizer

• 2020.04

  -

  Present

  情報処理学会量子ソフトウェア研究会幹事

• 2019.11

  -

  Present

  量子ICTフォーラム量子コンピューティング技術推進委員会幹事

• 2018.05

  -

  2018.12

  「(戦略プロポーザル)みんなの量子コンピューター〜情報・数理・電子工学と拓く新しいアプリ〜/ CRDS-FY2018-SP-04」(科学技術振興機構研究開発戦略センター)有識者

display all >>