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

Interdisciplinary research on network coding and quantum computation and communication

Research Project

Project/Area Number 19700011
Research Category

Grant-in-Aid for Young Scientists (B)

Allocation TypeSingle-year Grants
Research Field Fundamental theory of informatics
Research InstitutionOsaka Prefecture University

Principal Investigator

NISHIMURA Harumichi  Osaka Prefecture University, 理学系研究科, 講師 (70433323)

Project Period (FY) 2007 – 2009
Project Status Completed (Fiscal Year 2009)
Budget Amount *help
¥3,370,000 (Direct Cost: ¥2,800,000、Indirect Cost: ¥570,000)
Fiscal Year 2009: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2008: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2007: ¥900,000 (Direct Cost: ¥900,000)
Keywordsネットワーク符号 / 量子計算 / 量子通信
Research Abstract

Network coding is a field of coding theory that studies if coding information at intermediate points on a network is useful for the communication among multiple parties. In this research, whether the technique of network coding is also useful for quantum information has been deeply investigated. As a result, the possibility of network coding for quantum information has been clarified under some reasonable condition. Moreover, several techniques obtained in the research have been applied to develop the theory of quantum computing and communication.

Report

(4 results)
  • 2009 Annual Research Report   Final Research Report ( PDF )
  • 2008 Annual Research Report
  • 2007 Annual Research Report
  • Research Products

    (62 results)

All 2010 2009 2008 2007 Other

All Journal Article (27 results) (of which Peer Reviewed: 17 results) Presentation (32 results) Remarks (3 results)

  • [Journal Article] General scheme for perfect quantum network coding with free classical communication, in Proceedings of 36th International Colloquium on Automata, Languages and Programming (ICALP 2009)2009

    • Author(s)
      Hirotada Kobayashi, Francois Le Gall, Harumichi Nishimura, Martin Rotteler
    • Journal Title

      Lecture Notes in Computer Science 5555

      Pages: 622-633

    • Related Report
      2009 Final Research Report
    • Peer Reviewed
  • [Journal Article] Quantum random access coding2009

    • Author(s)
      Harumichi Nishimura, Rudy Raymond
    • Journal Title

      IEICE Transactions 92-A(5)

      Pages: 1268-1275

    • NAID

      10026857481

    • Related Report
      2009 Final Research Report
    • Peer Reviewed
  • [Journal Article] 量子計算2009

    • Author(s)
      西村治道
    • Journal Title

      数学セミナー 48(12)

      Pages: 26-31

    • Related Report
      2009 Final Research Report
  • [Journal Article] General scheme for perfect quantum network coding with free classical communication2009

    • Author(s)
      Hirotada Kobayashi, Francois Le Gall, Harumichi Nishimura, Marin Rotteler
    • Journal Title

      Lecture Notes in Computer Science 5555

      Pages: 271-282

    • NAID

      110007227302

    • Related Report
      2009 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Quantum random access coding2009

    • Author(s)
      Harumichi Nishimura, Rudy Raymond
    • Journal Title

      IEICE Transactions 92-A(no.5)

      Pages: 1268-1275

    • NAID

      10026857481

    • Related Report
      2009 Annual Research Report
    • Peer Reviewed
  • [Journal Article] General scheme for perfect quantum network coding with free classical communication2009

    • Author(s)
      小林弘忠, Francois Le Gall, 西村治道, Martin Rotteler
    • Journal Title

      電子情報通信学会技術報告 109(no.9)

      Pages: 51-58

    • NAID

      110007227302

    • Related Report
      2009 Annual Research Report
  • [Journal Article] Designing quantum game strategies from quantum communication protocols2009

    • Author(s)
      岩間一雄, 西村治道, Rudy Raymond
    • Journal Title

      電子情報通信学会技術報告 109(no.54)

      Pages: 21-28

    • NAID

      110007338423

    • Related Report
      2009 Annual Research Report
  • [Journal Article] Designing quantum game strategies from quantum communication protocols2009

    • Author(s)
      岩間一雄, 西村治道, Rudy Raymond
    • Journal Title

      量子情報技術研究会資料 20

      Pages: 49-54

    • NAID

      110007338423

    • Related Report
      2009 Annual Research Report
  • [Journal Article] General scheme for perfect quantum network coding with free classical communication2009

    • Author(s)
      小林弘忠, Francois Le Gall, 西村治道, Martin Rotteler
    • Journal Title

      量子情報技術研究会資料 20

      Pages: 55-60

    • NAID

      110007227302

    • Related Report
      2009 Annual Research Report
  • [Journal Article] 量子計算2009

    • Author(s)
      西村治道
    • Journal Title

      数学セミナー 48(no.12)

      Pages: 26-31

    • Related Report
      2009 Annual Research Report
  • [Journal Article] Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families2009

    • Author(s)
      Harumichi Nishimura, Masanao Ozawa
    • Journal Title

      Quantum Information Processing 8

      Pages: 13-24

    • Related Report
      2008 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Unbounded-error quantum query complexity, in Proceedings of 19th International Symposium on Algorithms and Computation (ISAAC2008)2008

    • Author(s)
      Ashley Montanaro, Harumichi Nishimura, Rudy Raymond
    • Journal Title

      Lecture Notes in Computer Science 5369

      Pages: 919-930

    • Related Report
      2009 Final Research Report
    • Peer Reviewed
  • [Journal Article] Quantum query complexity of Boolean functions with small on-sets, in Proceedings of 19th International Symposium on Algorithms and Computation (ISAAC2008)2008

    • Author(s)
      Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond, Seiichiro Tani, Shigeru Yamashita
    • Journal Title

      Lecture Notes in Computer Science 5369

      Pages: 907-918

    • Related Report
      2009 Final Research Report
    • Peer Reviewed
  • [Journal Article] The efficiency of quantum identity testing of multiple states2008

    • Author(s)
      Masaru Kada, Harumichi Nishimura, Tomoyuki Yamakami
    • Journal Title

      Journal of Physics A: Mathematical and Theoretical 41,Articleno.395309

    • Related Report
      2009 Final Research Report
    • Peer Reviewed
  • [Journal Article] Polynomial-time construction of linear network coding, in Proceedings of 35th International Colloquium on Automata, Languages and Programming (ICALP 2008)2008

    • Author(s)
      Kazuo Iwama, Harumichi Nishimura, Mike Paterson, Rudy Raymond, Shigeru Yamashita
    • Journal Title

      Lecture Notes in Computer Science 5125

      Pages: 271-282

    • Related Report
      2009 Final Research Report
    • Peer Reviewed
  • [Journal Article] Polynomial-time construction of linear network coding2008

    • Author(s)
      Kazuo Iwama, Harumichi Nishimura, Mike Paterson, Rudy Raymond, Shigeru Yamashita
    • Journal Title

      Proceedings of 35th International Colloquium on Automata, Languages and Programming (ICALP2008), Lecture Note in Compilter Science 5125

      Pages: 271-282

    • Related Report
      2008 Annual Research Report
    • Peer Reviewed
  • [Journal Article] The efficiency of quantum identity testing of multiple states2008

    • Author(s)
      Masaru Kada, Harumichi Nishimura. Tomovuki Yamakami
    • Journal Title

      Journal of Physics A : Mathematical and Theoretical 41, Article no.395 309

    • Related Report
      2008 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Quantum query complexity of Boolean functions with small on-sets2008

    • Author(s)
      Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond, Seiichiro Tani, Shigeru Yamashita
    • Journal Title

      Proceedings of 19th International Symposium on Algorithms and Computation (ISAAC2008), Lecture Notes in Computer Science 5369

      Pages: 907-918

    • Related Report
      2008 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Unbounded-error quantum query complexity2008

    • Author(s)
      Ashley Montanaro, Harumichi Nishimura, Rudy Raymond
    • Journal Title

      Proceedings of 19th International Symposium on Algorithms and Computation (ISAAC2008), Lecture Notes in Computer Science 5369

      Pages: 919-930

    • NAID

      110006782071

    • Related Report
      2008 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Efficiency of quantum identity testing of multiple states2008

    • Author(s)
      Masaru Kada, Harumichi Nishimura, Tomoyuki Yamakami
    • Journal Title

      量子情報技術研究会資料 18

      Pages: 143-146

    • Related Report
      2008 Annual Research Report
  • [Journal Article] Quantum query complexity of Boolean functions with small on-sets2008

    • Author(s)
      Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond, Seiichiro Tani, Shigeru Yamashita
    • Journal Title

      量子情報技術研究会資料 19

      Pages: 39-44

    • Related Report
      2008 Annual Research Report
  • [Journal Article] Unbounded-error quantum query complexity2008

    • Author(s)
      Ashley Montanaro, 西村治道, Rudy Raymond
    • Journal Title

      電子情報通信学会技術報告 107

      Pages: 9-14

    • NAID

      110006782071

    • Related Report
      2007 Annual Research Report
  • [Journal Article] Unbounded-error classical and quantum communication complexity, in Proceedings of 18th International Symposium on Algorithms and Computation (ISAAC2007)2007

    • Author(s)
      Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita
    • Journal Title

      Lecture Notes in Computer Science 4835

      Pages: 100-111

    • Related Report
      2009 Final Research Report
    • Peer Reviewed
  • [Journal Article] Unbounded-error one-way classical and quantum communication complexity, in Proceedings of 34th International Colloquium on Automata, Languages and Programming (ICALP2007)2007

    • Author(s)
      Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita
    • Journal Title

      Lecture Notes in Computer Science 4596

      Pages: 110-121

    • Related Report
      2009 Final Research Report
    • Peer Reviewed
  • [Journal Article] Unbounded-error one-way classical and quantum communication complexity2007

    • Author(s)
      Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita
    • Journal Title

      Proceedings of 34th International Colloquium on Automata, Languages and Programming(ICALP2007), Lecture Note in Cbmputer Science 4596

      Pages: 110-121

    • Related Report
      2007 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Unbounded-error classical and quantum communication complexity2007

    • Author(s)
      Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita
    • Journal Title

      Proceedings of 18th International Symposium on Algorithms and Computation(ISAAC2007), Lecture Note in computer Science 4835

      Pages: 100-111

    • Related Report
      2007 Annual Research Report
    • Peer Reviewed
  • [Journal Article] 非有界誤り一方向量子および古典通信計算量2007

    • Author(s)
      岩間 一雄, 西村 治道, Rudy Raymond, 山下 茂
    • Journal Title

      量子情報技術研究会資料 16

      Pages: 106-111

    • Related Report
      2007 Annual Research Report
  • [Presentation] Quantum counterfeit coin problems2010

    • Author(s)
      Harumichi Nishimura
    • Organizer
      2010 International Workshop on Quantum Information Science
    • Place of Presentation
      東京大学(東京)
    • Year and Date
      2010-03-08
    • Related Report
      2009 Annual Research Report
  • [Presentation] Quantum counterfeit coin problems2010

    • Author(s)
      Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Junichi Teruyama
    • Organizer
      13th Workshop on Quantum Information Processing (QIP2010)
    • Place of Presentation
      Zurich (Switzerland)
    • Related Report
      2009 Final Research Report
  • [Presentation] Quantum counterfeit coin problems2010

    • Author(s)
      Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Junichi Teruyama
    • Organizer
      13th Workshop on Quantum Information Processing
    • Place of Presentation
      Zurich (Switzerland)
    • Related Report
      2009 Annual Research Report
  • [Presentation] General scheme for perfect quantum network coding with free classical communication2010

    • Author(s)
      Hirotada Kobayashi, Francois LeGall, Harumichi Nishimura, Martin Rotteler
    • Organizer
      13th Workshop on Quantum Information Processing
    • Place of Presentation
      Zurich (Switzerland)
    • Related Report
      2009 Annual Research Report
  • [Presentation] Rudy Raymond, Designing quantum game strategies from quantum communication protocols2009

    • Author(s)
      岩間一雄, 西村治道
    • Organizer
      コンピューテーション研究会
    • Place of Presentation
      埼玉
    • Year and Date
      2009-05-26
    • Related Report
      2009 Final Research Report
  • [Presentation] Designing quantum game strategies from quantum communication protocols2009

    • Author(s)
      岩間一雄, 西村治道, Rudy Raymond
    • Organizer
      コンピュテーション研究会
    • Place of Presentation
      埼玉大学(埼玉)
    • Year and Date
      2009-05-24
    • Related Report
      2009 Annual Research Report
  • [Presentation] General scheme for perfect quantum network coding with free classical communication2009

    • Author(s)
      小林弘忠, Francois Le Gall, 西村治道, Martin Rotteler
    • Organizer
      コンピュテーション研究会
    • Place of Presentation
      京都大学(京都)
    • Year and Date
      2009-04-17
    • Related Report
      2009 Annual Research Report
  • [Presentation] Worst-case winning probabilities for the sum of CHSH games2009

    • Author(s)
      Harumichi Nishimura
    • Organizer
      International Conference on Quantum Information and Technology 2009 (ICQIT2009)
    • Place of Presentation
      Tokyo (Japan)
    • Related Report
      2009 Final Research Report
  • [Presentation] 古典及び量子通信計算量2009

    • Author(s)
      西村治道
    • Organizer
      第21回量子情報技術研究会
    • Place of Presentation
      調布
    • Related Report
      2009 Final Research Report
  • [Presentation] 量子コンピュータに基づく計算量理論とその周辺2009

    • Author(s)
      西村治道
    • Organizer
      日本数学会
    • Place of Presentation
      大阪
    • Related Report
      2009 Final Research Report
  • [Presentation] General scheme for perfect quantum network coding with free classical communication2009

    • Author(s)
      小林弘忠, Francois Le Gall, 西村治道, Martin Rotteler
    • Organizer
      第20回量子情報技術研究会
    • Place of Presentation
      広島
    • Related Report
      2009 Final Research Report
  • [Presentation] Designing quantum game strategies from quantum communication protocols2009

    • Author(s)
      岩間一雄, 西村治道, Rudy Raymond
    • Organizer
      量子情報技術研究会
    • Place of Presentation
      広島大学(広島)
    • Related Report
      2009 Annual Research Report
  • [Presentation] General scheme for perfect quantum network coding with free classical communication2009

    • Author(s)
      小林弘忠, Francois Le Gall, 西村治道, Martin Rotteler
    • Organizer
      量子情報技術研究会
    • Place of Presentation
      広島大学(広島)
    • Related Report
      2009 Annual Research Report
  • [Presentation] General scheme for perfect quantum network coding with free classical communication2009

    • Author(s)
      Hirotada Kobayashi, Francois LeGall, Harumichi Nishimura, Martin Rotteler
    • Organizer
      36th International Colloquium on Automata, Languages and Programming
    • Place of Presentation
      Rhodes (Greece)
    • Related Report
      2009 Annual Research Report
  • [Presentation] 量子コンピュータに基づく計算量理論とその周辺2009

    • Author(s)
      西村治道
    • Organizer
      日本数学会
    • Place of Presentation
      大阪大学(大阪)
    • Related Report
      2009 Annual Research Report
  • [Presentation] 古典及び量子通信計算量2009

    • Author(s)
      西村治道
    • Organizer
      量子情報技術研究会
    • Place of Presentation
      電気通信大学(東京)
    • Related Report
      2009 Annual Research Report
  • [Presentation] Worst-case winning probabilities for the sum of CHSH games2009

    • Author(s)
      Harumichi Nishimura
    • Organizer
      International Conference on Quantum Information and Technology
    • Place of Presentation
      国立情報学研究所(東京)
    • Related Report
      2009 Annual Research Report
  • [Presentation] Average/Worst-Case Gap of Quantum Query Complexities2009

    • Author(s)
      Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond, Seiichiro Tani, Shigeru Yamashita
    • Organizer
      12th Workshop on Quantum Information Processing (QIP2009)
    • Place of Presentation
      Santa Fe (USA)
    • Related Report
      2008 Annual Research Report
  • [Presentation] Unbounded-error quantum query complexity2008

    • Author(s)
      Ashley Montanaro, 西村治道, Rudy Raymond
    • Organizer
      コンピューテーション研究会
    • Place of Presentation
      大和
    • Year and Date
      2008-03-10
    • Related Report
      2009 Final Research Report 2007 Annual Research Report
  • [Presentation] Quantum query complexity of Boolean functions with small on-sets2008

    • Author(s)
      Andris Ambainis, 岩間一雄, 中西正樹, 西村治道, Rudy Raymond, 谷誠一郎, 山下茂
    • Organizer
      第19回量子情報技術研究会
    • Place of Presentation
      堺
    • Related Report
      2009 Final Research Report 2008 Annual Research Report
  • [Presentation] 多数の量子状態に対する等価性判定の効率的方法2008

    • Author(s)
      嘉田勝, 西村治道, 山上智幸
    • Organizer
      第18回量子情報技術研究会
    • Place of Presentation
      東京
    • Related Report
      2009 Final Research Report 2008 Annual Research Report
  • [Presentation] Polynomial-time construction of linear network coding2008

    • Author(s)
      Kazuo Iwama, Harumichi Nishimura, Mike Paterson, Rudy Raymond, Shigeru Yamashita
    • Organizer
      35th International Colloquium on Automata, Languages and Programming (ICALP2008)
    • Place of Presentation
      Reykjavik (Iceland)
    • Related Report
      2008 Annual Research Report
  • [Presentation] Quantum query complexity of Boolean functions with small on-sets2008

    • Author(s)
      Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond, Seiichiro Tani, Shigeru Yamashita
    • Organizer
      19th International Symposium on Algorithms and Computation (ISAAC2008)
    • Place of Presentation
      Goldcoast (Australia)
    • Related Report
      2008 Annual Research Report
  • [Presentation] Unbounded-error quantum query complexity2008

    • Author(s)
      Ashley Montanaro, Harumichi Nishimura, Rudy Raymond
    • Organizer
      19th International Symposium on Algorithms and Computation (ISAAC2008)
    • Place of Presentation
      Goldcoast (Australia)
    • Related Report
      2008 Annual Research Report
  • [Presentation] Unbounded-error classical and quantum communication complexity2007

    • Author(s)
      Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita
    • Organizer
      11th Workshop on Quantum Information Processing (QIP2008)
    • Place of Presentation
      New Delhi (India)
    • Related Report
      2009 Final Research Report
  • [Presentation] 古典及び量子通信計算量2007

    • Author(s)
      西村治道
    • Organizer
      数学基礎論若手の会
    • Place of Presentation
      焼津
    • Related Report
      2009 Final Research Report
  • [Presentation] 量子Turing機械の停止問題2007

    • Author(s)
      小澤正直, 西村治道
    • Organizer
      日本数学会
    • Place of Presentation
      仙台
    • Related Report
      2009 Final Research Report 2007 Annual Research Report
  • [Presentation] 非有界誤り一方向量子および古典通信計算量2007

    • Author(s)
      岩間一雄, 西村治道, Rudy Raymond, 山下茂
    • Organizer
      第16回量子情報技術研究会
    • Place of Presentation
      厚木
    • Related Report
      2009 Final Research Report 2007 Annual Research Report
  • [Presentation] Unbounded-error classical and quantum communication complexity2007

    • Author(s)
      Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita
    • Organizer
      34th International Colloquium on Automata, Languages and Programming(ICALP2007)
    • Place of Presentation
      Wroclaw(Poland)
    • Related Report
      2007 Annual Research Report
  • [Presentation] 古典および量子通信計算量2007

    • Author(s)
      西村治道
    • Organizer
      数学基礎論若手の会
    • Place of Presentation
      焼津
    • Related Report
      2007 Annual Research Report
  • [Presentation] Unbounded-error classical and quantum communication complexity2007

    • Author(s)
      Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita
    • Organizer
      18th International Symposium on Algorithms and Computation(ISAA2007)
    • Place of Presentation
      Sendai(Japan)
    • Related Report
      2007 Annual Research Report
  • [Presentation] Unbounded-error classical and quantum communication complexity2007

    • Author(s)
      Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita
    • Organizer
      11th Workshop on Quantum Information Processing(QIP2008)
    • Place of Presentation
      New Dehil(India)
    • Related Report
      2007 Annual Research Report
  • [Remarks]

    • URL

      http://www.mi.s.osakafu-u.ac.jp/~hnishimura

    • Related Report
      2009 Final Research Report
  • [Remarks]

    • URL

      http://www.mi.s.osakafu-u.ac.jp/~hnishimura

    • Related Report
      2009 Annual Research Report
  • [Remarks]

    • URL

      http://www.mi.s.osakafu-u.ac.jp/~hnishimura

    • Related Report
      2007 Annual Research Report

URL: 

Published: 2007-04-01   Modified: 2016-04-21  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi