Updated on 2024/02/27
博士（学術） （ 2001.3 名古屋大学 ）
computational complexity
quantum computing
quantum complexity theory
名古屋大学・准教授
2012.4
Country：Japan
大阪府立大学・講師
2006.4 - 2012.3
Country：Japan
京都大学・特任助手
2005.10 - 2006.3
Country：Japan
科学技術振興機構今井量子計算機構プロジェクト・研究員
2004.7 - 2005.9
Country：Japan
Nagoya University Graduate School, Division of Human Informatics
- 2001.3
Country： Japan
Nagoya University Faculty of Science
- 1994.3
Country： Japan
日本数学会
情報処理学会
量子情報技術研究会 委員
2012.11 - 2014.11
量子情報技術研究会 幹事
2010.11 - 2012.11
コンピュテーション研究会 専門委員
2008.6 - 2014.5
日本数学会数学基礎論および歴史分科会 運営委員
2007.10 - 2010.9
量子情報技術研究会 委員
2006.11 - 2010.11
Distributed Merlin-Arthur Synthesis of Quantum States and Its Applications Reviewed
Francois Le Gall, Masayuki Miyamoto, Harumichi Nishimura
Leibniz International Proceedings in Informatics 2023.8
Distributed Quantum Interactive Proofs Reviewed
Francois Le Gall, Masayuki Miyamoto, Harumichi Nishimura
Leibniz International Proceedings in Informatics Vol. 254 page： 42:1 - 42:21 2023.3
Brief Announcement: Distributed Quantum Interactive Proofs Reviewed
Francois Le Gall, Masayuki Miyamoto, Harumichi Nishimura
Leibniz International Proceedings in Informatics Vol. 246 2022.10
Quantum logarithmic space and post-selection Reviewed International coauthorship
Francois Le Gall, Harumichi Nishimura, Abuzer Yakaryilmaz
Leibniz International Proceedings in Informatics Vol. 197 2021.7
Communication Complexity of Private Simultaneous Quantum Messages Protocols Reviewed
Akinori Kawachi, Harumichi Nishimura
Leibniz International Proceedings in Informatics Vol. 199 2021.7
Distributed quantum proofs for replicated data Reviewed International coauthorship
Pierre Fraigniaud, Francois Le Gall, Harumichi Nishimura, Ami Paz
Leibniz International Proceedings in Informatics Vol. 185 page： 28:1 - 28:20 2021.1
Brief Announcement: Distributed quantum proofs for replicated data Reviewed International coauthorship
Pierre Fraigniaud, Francois Le Gall, Harumichi Nishimura, Ami Paz
Leibniz International Proceedings in Informatics Vol. 179 page： 43:1 - 43:3 2020.10
Rational proofs for quantum computing Reviewed
Tomoyuki Morimae, Harumichi Nishimura
Quantum Information and Computation Vol. 20 page： 181-193 2020.4
Impossibility of blind quantum sampling for classical client Reviewed
Tomoyuki Morimae, Harumichi Nishimura, Yuki Takeuchi, Seiichiro Tani
Quantum Information and Computation Vol. 19 page： 793-806 2019.8
Quantum Arthur-Merlin Games Reviewed
Hirotada Kobayashi, Francois Le Gall, Harumichi Nishimura
SIAM Journal on Computing Vol. 48 page： 865-902 2019.5
Quantum advantage for the LOCAL model in distributed computing Reviewed
Francois Le Gall, Harumichi Nishimura, Ansis Rosmanis
Leibniz International Proceedings in Informatics Vol. 126 page： 49:1-49:14 2019.3
Merlin-Arthur with efficient quantum Merlin and quantum supremacy for the second level of the Fourier hierarchy
Tomoyuki Morimae, Yuki Takeuchi, Harumichi Nishimura
Quantum Vol. 2 2018.11
Impossibility of classically simulating one-clean-qubit model with multiplicative error
Keisuke Fujii, Hirotada Kobayashi, Tomoyuki Morimae, Harumichi Nishimura, Shuhei Tamate, Seiichiro Tani
Physical Review Letters Vol. 120 2018.5
Merlinization of complexity classes above BQP Reviewed
Tomoyuki Morimae, Harumichi Nishimura
Quantum Information and Computation Vol. 17 ( 11-12 ) page： 0959-0972 2017.9
Quantum algorithms for matrix products over semirings Reviewed
Francois Le Gall, Harumichi Nishimura
Chicago Journal of Theoretical Computer Science Vol. 2017 2017.5
Power of one nonclean qubit Reviewed
Tomoyuki Morimae, Keisuke Fujii, Harumichi Nishimura
Physical Review A Vol. 95 2017.4
Modified group non-membership is in promise-AWPP relative to group oracles Reviewed
Tomoyuki Morimae, Harumichi Nishimura, Francois Le Gall
Quantum Information and Computation Vol. 17 ( 3-4 ) page： 242-250 2017.3
Quantum query complexity of almost all functions with fixed on-set size Reviewed
Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond, Seiichiro Tani, Shigeru Yamashita
Computational Complexity Vol. 25 ( 4 ) page： 723-735 2016.12
Space-Efficient Error Reduction for Unitary Quantum Computations Reviewed
Bill Fefferman, Hirotada Kobayashi, Cedric Yen-Yu Lin, Tomoyuki Morimae, Harumichi Nishimura
Leibniz International Proceedings in Informatics Vol. 55 page： 14:1-14:14 2016.7
Power of quantum computation with few clean qubits Reviewed
Keisuke Fujii, Hirotada Kobayashi, Tomoyuki Morimae, Harumichi Nishimura, Shuhei Tamate, Seiichiro Tani
Leibniz International Proceedings in Informatics Vol. 55 page： 13:1-13:14 2016.7
Quantum interpretations of AWPP and APP Reviewed
Tomoyuki Morimae, Harumichi Nishimura
Quantum Information and Computation Vol. 16 ( 5-6 ) page： 498-514 2016.4
Quantum algorithms for finding constant-sized sub-hypergraphs Reviewed
Francois Le Gall, Harumichi Nishimura, Seiichiro Tani
Theoretical Computer Science Vol. 609 ( 3 ) page： 569-582 2016.1
Quantum Merlin-Arthur with Clifford Arthur
Tomoyuki Morimae, Masahito Hayashi, Harumichi Nishimura, Keisuke Fujii
Quantum Information and Computation Vol. 15 ( 15-16 ) page： 1420-1430 2015.11
Generalized quantum Arthur-Merlin games Reviewed
Hirotada Kobayashi, Francois Le Gall, Harumichi Nishimura
Leibniz International Proceedings in Informatics Vol. 33 page： 488-511 2015.6
Stronger methods of making quantum interactive proofs perfectly complete Reviewed
Hirotada Kobayashi, Francois Le Gall, Harumichi Nishimura
SIAM Journal on Computing Vol. 44 ( 2 ) page： 243-289 2015.3
Interactive proofs with quantum finite automata Reviewed
Harumichi Nishimura, Tomoyuki Yamakami
Theoretical Computer Science Vol. 568 page： 1-18 2015.2
Quantum network coding and the current status of its studies
Harumichi Nishimura
Proceedings of the International Symposium on Information Theory and Its Applications (ISITA2014) page： 331-334 2014.10
Quantum algorithms for finding constant-sized subgraphs
Francois Le Gall, Harumichi Nishimura, Seiichiro Tani
Lecture Notes in Computer Science (Proceedings of 20th International Conference on Computing and Combinatorics) Vol. 8591 page： 429-440 2014.8
Quantum algorithms for matrix product over semirings
Francois Le Gall, Harumichi Nishimura
Lecture Notes in Computer Science (Proceedings of 14th Scandinavian Symposium and Workshops) Vol. 8503 page： 331-343 2014.7
RECOVERING STRINGS IN ORACLES: QUANTUM AND CLASSIC
Kazuo Iwama, Harumichi Nishimura
International Journal of Foundations of Computer Science Vol. 24 ( 7 ) page： 979-993 2013.11
Quantum network coding - How can network coding be applied to quantum information?
Harumichi Nishimura
Proceedings of the 2013 IEEE International Symposium on Network Coding 2013.6
Stronger methods of making quantum interactive proofs perfectly complete Reviewed
Hirotada Kobayashi, Francois Le Gall, Harumichi Nishimura
Proceedings of the 4th ACM Conference on Innovations in Theoretical Computer Science Conference (ITCS2013) page： 329-352 2013.1
On QMA protocols with two short quantum proofs
Francois Le Gall, Shota Nakagawa, Harumichi Nishimura
Quantum Information & Computation Vol. 12 page： 589-600 2012.8
Quantum counterfeit coin problems
Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Junichi Teruyama
Theoretical Computer Science Vol. 456 page： 51-64 2012.8
Reconstructing strings from substrings with quantum queries
Richard Cleve, Kazuo Iwama, Francois Le Gall, Harumichi Nishimura, Seiichiro Tani, Junichi Teruyama, Shigeru Yamashita
Lecture Notes in Computer Science (Proceedings of 13th Scandinavian Symposium and Workshops) Vol. 7357 page： 622-633 2012.7
Computational indistinguishability between quantum states and its cryptographic application
Akinori Kawachi, Takeshi Koshiba, Harumichi Nishimura, Tomoyuki Yamakami
Journal of Cryptology Vol. 25 page： 528-555 2012.7
Achieving perfect completeness in classical-witness quantum Merlin-Arthur proof systems
Stephen P. Jordan, Hirotada Kobayashi, Daniel Nagaj, Harumichi Nishimura
Quantum Information & Computation Vol. 12 page： 461-471 2012.6
Unbounded-error quantum query complexity
Ashley Montanaro, Harumichi Nishimura, Rudy Raymond
Theoretical Computer Science Vol. 412 page： 4619-4628 2011
Constructing quantum network coding schemes from classical nonlinear protocols
Hirotada Kobayashi, Francois Le Gall, Harumichi Nishimura, Martin Roetteler
Proceedings of IEEE International Symposium on Information Theory 2011 page： 109-113 2011
Quantum counterfeit coin problems
Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Junichi Teruyama
Lecture Notes in Computer Science (Proceedings of 21st International Symposium on Algorithms and Computation) Vol. 6506 page： 73-84 2010
Perfect quantum network communication protocol based on classical network coding
Hirotada Kobayashi, Francois Le Gall, Harumichi Nishimura, Martin Roetteler
Proceedings of IEEE International Symposium on Information Theory 2010 page： 2686-2690 2010
An application of quantum finite automata to interactive proof systems
Harumichi Nishimura, Tomoyuki Yamakami
Journal of Computer and System Sciences Vol. 75 page： 255-269 2009
Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families
Harumichi Nishimura, Masanao Ozawa
Quantum Information Processing Vol. 8 page： 13-24 2009
Quantum random access coding
Harumichi Nishimura, Rudy Raymond
IEICE Transactions Vol. 92 ( A(5) ) page： 1268-1275 2009
General scheme for perfect quantum network coding with free classical communication
Hirotada Kobayashi, Francois Le Gall, Harumichi Nishimura, Martin Roetteler
Lecture Notes in Computer Science (Proceedings of 36th International Colloquium on Automata, Languages and Programming) Vol. 5555 page： 622-633 2009
Unbounded-error quantum query complexity
Ashley Montanaro, Harumichi Nishimura, Rudy Raymond
Lecture Notes in Computer Science (Proceedings of 19th International Symposium on Algorithms and Computation) Vol. 5369 page： 919-930 2008
Polynomial-time construction of linear network coding
Kazuo Iwama, Harumichi Nishimura, Mike Paterson, Rudy Raymond, Shigeru Yamashita
Lecture Notes in Computer Science (Proceedings of 35th International Colloquium on Automata, Languages and Programming) Vol. 5125 page： 271-282 2008
The efficiency of quantum identity testing of multiple states
Masaru Kada, Harumichi Nishimura, Tomoyuki Yamakami
Journal of Physics A: Mathematical and Theoretical Vol. 41 ( Article no. 395309 ) page： 1-13 2008
Quantum query complexity of Boolean functions with small on-sets
Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond, Seiichiro Tani, Shigeru Yamashita
Lecture Notes in Computer Science (Proceedings of 19th International Symposium on Algorithms and Computation) Vol. 5369 page： 907-918 2008
Unbounded-error classical and quantum communication complexity
Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita
Lecture Notes in Computer Science (Proceedings of 18th International Symposium on Algorithms and Computation) Vol. 4835 page： 100-111 2007
Quantum network coding
Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita
Lecture Notes in Computer Science (Proceedings of 24th Annual Symposium on Theoretical Aspects of Computer Science) Vol. 4393 page： 610-621 2007
Unbounded-error one-way classical and quantum communication complexity
Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita
Lecture Notes in Computer Science (Proceedings of 34th International Colloquium on Automata, Languages and Programming) Vol. 4596 page： 110-121 2007
(4,1)-quantum random access coding does not exist - one qubit is not enough to recover one of four bits
Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita
New Journal of Physics Vol. 8 ( Article no. 129 ) page： 1-11 2006
Quantum computation with supplementary information
Harumichi Nishimura
IPSJ Journal Vol. 46 page： 2392-2399 2005
Uniformity of quantum circuit families for error-free algorithms
Harumichi Nishimura, Masanao Ozawa
Theoretical Computer Science Vol. 332 page： 487-496 2005
Polynomial-time quantum computation with advice
Harumichi Nishimura, Tomoyuki Yamakami
Information Processing Letters Vol. 90 page： 195-204 2004
An Algorithmic Argument for Nonadaptive Query Complexity Lower Bounds on Advised Quantum Computation Reviewed
Harumichi Nishimura, Tomoyuki Yamakami
Lecture Notes in Computer Science (Proceedings of the 29th International Symposium on Mathematical Foundations of Computer Science) Vol. 3153 page： 827-838 2004
Quantum Computation With Restricted Amplitudes Reviewed
Harumichi Nishimura
International Journal of Foundations of Computer Science Vol. 14 page： 853-870 2003
On quantum one-way permutations Reviewed
Elham Kashefi, Harumichi Nishimura, Vlatko Vedral
Quantum Information and Computation Vol. 2 page： 379-398 2002
Computational complexity of uniform quantum circuit families and quantum Turing machines Reviewed
Harumichi Nishimura, Masanao Ozawa
Theoretical Computer Science Vol. 276 page： 147-181 2002
Local transition functions of quantum Turing machines Reviewed
Masanao Ozawa, Harumichi Nishimura
RAIRO Theoretical Informatics and Applications Vol. 34 page： 379-402 2000
基礎から学ぶ量子計算
西村治道（ Role： Sole author）
オーム社 2022.11
理論計算機科学事典
西村治道（ Role： Contributor , 3.7節 量子計算）
朝倉書店 2022.1
電子情報通信学会ハンドブック「知識ベース 知識の森」 S2群5編3章1節 量子計算理論
西村治道（ Role： Sole author）
電子情報通信学会 2011
電子情報通信学会ハンドブック「知識ベース 知識の森」 6群2編6章2節 通信計算量
西村治道（ Role： Sole author）
電子情報通信学会 2011
情報と計算機
西村治道
数理科学 Vol. 723 page： 36 - 42 2023.8
量子回路の計算複雑性について
西村治道
数学セミナー Vol. 61 ( 1 ) page： 26 - 31 2022.1
Quantum distributed proofs
Harumichi Nishimura
NII Shonan Meeting on New Directions in Provable Quantum Advantage 2023.12
Distributed Quantum Merlin-Arthur Protocols: Improvement and Extension
Harumichi Nishimura
Shenzhen-Nagoya Workshop on Quantum Science 2023 2023.9
Power of Distributed Quantum Merlin-Arthur Proofs International conference
Harumichi Nishimura
SUSTech-Nagoya workshop on Quantum Science 2022.6
Simultaneous Message Passing Models and Private Simultaneous Messages Protocols with Shared Entanglement
Harumichi Nishimura
3rd Workshop on Quantum and Classical Cryogenic Devices, Circuits, and Systems
SMP model, PSM protocols, and their quantum analogues International conference
Harumichi Nishimura
SUSTech-Nagoya workshop on Quantum Science
Distributed quantum proofs for replicated data International coauthorship International conference
Pierre Fraigniaud, Francois Le Gall, Harumichi Nishimura, Ami Paz
24th Annual Conference on Quantum Information Processing 2021.2.5
SWAP test and its applications to quantum distribued computing International conference
Harumichi Nishimura
2nd Workshop on Quantum and Classical Cryogenic Devices, Circuits, and Systems 2020.12.14
Distributed quantum proofs for replicated data International coauthorship
Pierre Fraigniaud, Francois Le Gall, Harumichi Nishimura, Ami Paz
2020.10.16
量子通信複雑性理論 Invited
西村治道
京大量子情報ユニット・基研量子情報スクール 2020.7.2
More approaches for studying classical verification of quantum computation Invited International conference
Harumichi Nishimura
1st Workshop on Quantum and Classical Cryogenic Devices, Circuits, and Systems 2019.11.12
Classical verification for quantum computation Invited International conference
Harumichi Nishimura
Workshop on Quantum Protocols 2019.8.9
Rational proofs for quantum computing
合理的なサーバーによる量子計算の検証
森前智行, 西村治道
第39回量子情報技術研究会
Interactive proofs with polynomial-time quantum prover for computing the order of solvable groups International conference
Francois Le Gall, Tomoyuki Morimae, Harumichi Nishimura, Yuki Takeuchi
18th Asian Quantum Information Science Conference (AQIS2018)
Rational proofs for quantum computing International conference
Tomoyuki Morimae, Harumichi Nishimura
18th Asian Quantum Information Science Conference (AQIS2018)
Interactive proofs with polynomial-time quantum prover for computing the order of solvable groups International conference
Francois Le Gall, Tomoyuki Morimae, Harumichi Nishimura, Yuki Takeuchi
43rd International Symposium on Mathematical Foundations of Computer Science (MFCS2018)
量子計算量クラスについて Invited
西村治道
ImPACT未来開拓研究会2018
make10の一般化について
佐伯元春, 西村治道
第１３回組合せゲーム・パズル研究集会
Merlinization of complexity classes above BQP
Modified group nonmembership is in AWPP
Power of quantum computation with few clean qubits
Space-efficient error reduction for unitary quantum computations International conference
Bill Fefferman, Hirotada Kobayashi, Cedric Yen-Yu Lin, Tomoyuki Morimae, Harumichi Nishimura
16th Asian Quantum Information Science Conference (AQIS2016)
メモリ限定量子計算量について Invited
西村治道
研究会「量子情報と有限張理論の新展開」
Power of quantum computation with few clean qubits International conference
Keisuke Fujii, Hirotada Kobayashi, Tomoyuki Morimae, Harumichi Nishimura, Shuhei Tamate, Seiichiro Tani
43rd International Colloquium on Automata, Languages, and Programming (ICALP2016)
Space-efficient error reduction for unitary quantum computations International conference
Bill Fefferman, Hirotada Kobayashi, Cedric Yen-Yu Lin, Tomoyuki Morimae, Harumichi Nishimura
43rd International Colloquium on Automata, Languages, and Programming (ICALP2016)
Power of quantum computation with few clean qubits International conference
Harumichi Nishimura
Workshop around BQP
量子版NPと量子版AMの計算複雑さ
西村治道
第３３回量子情報技術研究会
AWPPの量子計算による解釈
森前智行, 西村治道
第３３回量子情報技術研究会
クリフォードゲートのみの検証者によるQMA
森前智行, 林正人, 西村治道, 藤井啓祐
コンピュテーション研究会
AWPPの量子計算による解釈
森前智行, 西村治道
コンピュテーション研究会
Impossibility of classical simulating one-clean-qubit computation
藤井啓祐, 小林弘忠, 森前智行, 西村治道, 玉手修平, 谷誠一郎
コンピュテーション研究会
量子計算量クラス‐PとNPの量子版とその先
西村治道
基礎物理学研究所研究会「量子制御技術の発展により拓かれる量子情報の新時代」
Generalized quantum Arthur-Merlin games International conference
Hirotada Kobayashi, Francois Le Gall, Harumichi Nishimura
30th Computational Complexity Conference (CCC2015)
Quantum algorithms for finding constant-sized sub-hypergraphs International conference
Francois Le Gall, Harumichi Nishimura, Seiichiro Tani
18th Workshop on Quantum Information Processing
Generalized quantum Arthur-Merlin games International conference
Harumichi Nishimura
Australia-Japan Workshop on Multi-user Quantum Network
Generalized quantum Arthur-Merlin games International conference
Harumichi Nishimura
ELC Workshop at the University of Tokyo on Quantum Computational Complexity
局所ハミルトニアンの非冗長性の計算量
川崎涼, 西村治道
コンピュテーション研究会
Quantum Arthur and quantum Merlin International conference
Harumichi Nishimura
5th Nagoya Winter Workshop on Quantum Information, Measurement, and Foundations (NWW2014)
定数サイズ部分ハイパーグラフ発見に対する量子アルゴリズム
Francois Le Gall, 西村治道, 谷誠一郎
第２９回量子情報技術研究会
Stronger methods of making quantum interactive proofs perfectly complete
Quantum network coding - How can network coding be applied to quantum information? International conference
Harumichi Nishimura
The 2013 IEEE International Symposium on Network Coding
Quantum algorithms for matrix products over semirings
時間ドロボー問題の物質的ゼロ知識証明
上田圭祐, 西村治道
2012年冬のLAシンポジウム
Towards Perfect Completeness in QMA International conference
Stephen Jordan, Hirotada Kobayashi, Francois Le Gall, Daniel Nagaj, Harumichi Nishimura.
16th Workshop on Quantum Information Processing (QIP2013)
衝突の列挙に関する量子質問計算量
大和雅英, 西村治道
第27回量子情報技術研究会
Reducing error probabilities of quantum Merlin-Arthur proof systems International conference
Harumichi Nishimura
Japan-Singapore Workshop on Multi-user Quantum Networks
Reconstructing strings from substrings with quantum queries International conference
Richard Cleve, Kazuo Iwama, Francois Le Gall, Harumichi Nishimura, Seiichiro Tani, Junichi Teruyama, Shigeru Yamashita
13th Scandinavian Symposium and Workshop
Reconstructing strings from substrings with quantum queries
Richard Cleve, Kazuo Iwama, Francois Le Gall, Harumichi Nishimura, Seiichiro Tani, Junichi Teruyama, Shigeru Yamashita
Improved quantum algorithms for reconstructing strings from substrings International conference
Richard Cleve, Kazuo Iwama, Francois Le Gall, Harumichi Nishimura, Seiichiro Tani, Junichi Teruyama, Shigeru Yamashita
5th Annual Meetings of the Asian Association for Algorithms and Computation
Quantum counterfeit coin problems International conference
Harumichi Nishimura
2010 International Workshop on Quantum Information Science
Worst-case winning probabilities for the sum of CHSH games International conference
Harumichi Nishimura
International Conference on Quantum Information and Technology 2009
古典及び量子通信計算量
西村治道
第２１回量子情報技術研究会
量子コンピュータに基づく計算量理論とその周辺
西村治道
日本数学会
Quantum random access coding and its application International conference
Harumichi Nishimura
Workshop of Theory on Quantum Computation, Communication and Cryptography 2006
量子計算機の数理モデルとその計算能力について
西村治道
日本数学会
量子プロトコル理論の線的展開
2016.4 - 2021.3
科学研究費補助金 基盤研究(A)
小柴健史
Authorship：Coinvestigator(s)
量子通信及び量子計算を限定した量子対話型証明の解析
2016.4 - 2020.3
科学研究費補助金 基盤研究(C)
西村 治道
Authorship：Principal investigator
量子論の基礎原理に関する数学的研究
2014.4 - 2019.3
科学研究費補助金 基盤研究(A)
小澤正直
Authorship：Coinvestigator(s)
量子検証システムの計算量的解析
2013.4 - 2017.3
科学研究費補助金 基盤研究(C)
Authorship：Principal investigator
量子プロトコル理論の深化
2012.4 - 2017.3
科学研究費補助金 基盤研究(A)
小柴健史
Authorship：Coinvestigator(s)
量子力学からの計算限界解明へのアプローチ
2012.4 - 2017.3
科学研究費補助金 新学術領域研究
山下茂
Authorship：Coinvestigator(s)
マルチユーザ型量子ネットワーク
2011.4 - 2016.3
科学研究費補助金 基盤研究(A)
林正人
Authorship：Coinvestigator(s)
量子通信計算量とその応用に関する研究
2010.4 - 2014.3
科学研究費補助金 若手研究(B)
Authorship：Principal investigator
量子情報の数学的基礎研究
2009.4 - 2014.3
科学研究費補助金 基盤研究(A)
小澤正直
Authorship：Coinvestigator(s)
情報理論特論
2016
数理情報学５
2016
数理情報学５
2015
微分積分学II
2015
微分積分学I
2015
数理情報学５
2014
線形代数学I
2014
情報理論特論
2014
数理情報学5
2013
線形代数学II
2013
線形代数学I
2013
線形代数学II
2012
情報理論特論
2012
