KOBAYASHI Hirotada 小林弘忠

… Alternative Names

小林弘忠コバヤシヒロタダ

Less

Researcher Number	60413936
Affiliation (Current)	2025: 国立情報学研究所, 情報学プリンシプル研究系, 特任研究員
Affiliation (based on the past Project Information) *help	2021: 国立情報学研究所, 情報学プリンシプル系, 特任研究員 2016: 国立情報学研究所, 情報学プリンシプル系, 特任研究員 2016: 国立情報学研究所, 情報学プリンシプル研究系, 特任研究員 2014 – 2016: 国立情報学研究所, 情報学プリンシプル研究系, 研究員 2013: 国立情報学研究所, 大学共同利用機関等の部局等, 研究員 … More 2012: 国立情報学研究所, 情報学プリンシプル研究系, 研究員 2011: 国立情報学研究所, 情報学プリンシプル研究系, 研究員 2011: 国立情報学研究所, 情報学プリンシプル系, 研究員 2010: 埼玉大学, 国立情報学研究所, 研究員 2006 – 2009: 国立情報学研究所, プロジェクト研究員 Less
Review Section/Research Field	Except Principal Investigator Fundamental theory of informatics / Science and Engineering / Theory of informatics
Keywords	Except Principal Investigator 量子計算 / 量子アルゴリズム / 量子暗号 / 量子情報 / 暗号理論 / 計算量理論 / 量子計算量理論 / エンタングルメント / 対話証明 / 量子情報理論 … More / 量子通信 / プロトコル / ゲーム理論 / 量子プロトコル / 量子回路 / 量子対話型証明 / 計算モデル / 量子力学 / 計算の複雑さ / 暗号プロトコル / 分散計算 / 分散アルゴリズム / 通信計算量 / 質問計算料 / 通信複雑度 / 秘匿情報検索 / 量子対話証明 / 脱乱択化 / ネットワーク符号 / 隠れ部分群 / 量子計算理論 Less

Interpolative Expansion of Quantum Protocol Theory
- Principal Investigator
  
  Takeshi Koshiba
- Project Period (FY)
  2016 – 2020
- Research Category
  
  Grant-in-Aid for Scientific Research (A)
- Research Field
  
  Theory of informatics
- Research Institution
  Waseda University
  Saitama University
Deepening Theory of Quantum Protocols
- Principal Investigator
  
  KOSHIBA Takeshi
- Project Period (FY)
  2012 – 2015
- Research Category
  
  Grant-in-Aid for Scientific Research (A)
- Research Field
  
  Fundamental theory of informatics
- Research Institution
  Saitama University
An Approach to Understand the Limitations of Computation based on Quantum Mechanics
- Principal Investigator
  
  Yamashita Shigeru
- Project Period (FY)
  2012 – 2016
- Research Category
  
  Grant-in-Aid for Scientific Research on Innovative Areas (Research in a proposed research area)
- Review Section
  
  Science and Engineering
- Research Institution
  Ritsumeikan University
Advances in crossover between quantum information theory and quantum computational complexity theory
- Principal Investigator
  
  KOSHIBA Takeshi
- Project Period (FY)
  2009 – 2011
- Research Category
  
  Grant-in-Aid for Scientific Research (B)
- Research Field
  
  Fundamental theory of informatics
- Research Institution
  Saitama University
Crossover between Quantum Information Theory and Quantum Computational Complexity Theory
- Principal Investigator
  
  KOSHIBA Takeshi
- Project Period (FY)
  2006 – 2008
- Research Category
  
  Grant-in-Aid for Scientific Research (B)
- Research Field
  
  Fundamental theory of informatics
- Research Institution
  Saitama University

All 2019 2018 2016 2015 2013 2012 2011 2010 2009 2008 2007 Other

All Journal Article Presentation

[Journal Article] Generalized quantum Arthur-Merlin games2019
- Author(s)
  Hirotada Kobayashi, Francois Le Gall, Harumichi Nishimura
- Journal Title
  
  SIAM Journal on Computing
  
  Volume: 48 Issue: 3 Pages: 865-902
- DOI
  10.1137/17m1160173
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-16H01705, KAKENHI-PROJECT-16H05853, KAKENHI-PROJECT-19H04066
[Journal Article] Impossibility of Classically Simulating One-Clean-Qubit Model with Multiplicative Error2018
- Author(s)
  Keisuke Fujii, Hirotada Kobayashi, Tomoyuki Morimae, Harumichi Nishimura, Shuhei Tamate, Seiichiro Tani
- Journal Title
  
  Physical Review Letters
  
  Volume: 120 Issue: 20 Pages: 200502-200502
- DOI
  10.1103/physrevlett.120.200502
- NAID
  120006533116
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-16H01705, KAKENHI-PROJECT-16H02211, KAKENHI-PROJECT-26247016, KAKENHI-PROJECT-16K00015
[Journal Article] Space-Efficient Error Reduction for Unitary Quantum Computations2016
- Author(s)
  Bill Fefferman, Hirotada Kobayashi, Cedric Yen-Yu Lin, Tomoyuki Morimae, Harumichi Nishimura
- Journal Title
  
  Leibniz International Proceedings in Informatics (ICALP 2016)
  
  Volume: 55
- DOI
  10.4230/LIPIcs.ICALP.2016.14
- Peer Reviewed / Acknowledgement Compliant / Open Access / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-16H01705
[Journal Article] Power of Quantum Computation with Few Clean Qubits2016
- Author(s)
  Keisuke Fujii, Hirotada Kobayashi, Tomoyuki Morimae, Harumichi Nishimura, Shuhei Tamate, Seiichiro Tani
- Journal Title
  
  Leibniz International Proceedings in Informatics (ICALP 2016)
  
  Volume: 55
- DOI
  10.4230/LIPIcs.ICALP.2016.13
- Peer Reviewed / Acknowledgement Compliant / Open Access
- Data Source
  KAKENHI-PROJECT-16H01705, KAKENHI-PROJECT-16H02211
[Journal Article] Generalized Arthur-Merlin games2015
- Author(s)
  Hirotada Kobayashi, Francois Le Gall, Harumichi Nishimura
- Journal Title
  
  Leibniz International Proceedings in Informatics (30th Conference on Computational Complexity (CCC2015))
  
  Volume: 33 Pages: 488-511
- DOI
  10.4230/LIPIcs.CCC.2015.488
- Peer Reviewed / Acknowledgement Compliant / Open Access
- Data Source
  KAKENHI-PLANNED-24106009, KAKENHI-PROJECT-24240001, KAKENHI-PROJECT-24700005, KAKENHI-PROJECT-15H01677
[Journal Article] Generalized Quantum Arthur-Merlin Games2015
- Author(s)
  Hirotada Kobayashi, Francois Le Gall, and Harumichi Nishimura
- Journal Title
  
  Proceedings of the 30th Conference on Computational Complexity, CCC 2015, Leibniz International Proceedings in Informatics
  
  Volume: 未定
- Peer Reviewed / Acknowledgement Compliant / Open Access
- Data Source
  KAKENHI-PLANNED-24106009
[Journal Article] Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete.2015
- Author(s)
  Hirotada Kobayashi, Francois Le Gall and Harumichi Nishimura.
- Journal Title
  
  SIAM Journal on Computing, published online
  
  Volume: - Issue: 2 Pages: 243-289
- DOI
  10.1137/140971944
- NAID
  110009779047
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-23240001, KAKENHI-PROJECT-23246071, KAKENHI-PLANNED-24106009, KAKENHI-PROJECT-24240001, KAKENHI-PROJECT-25330012, KAKENHI-PROJECT-26247016
[Journal Article] Stronger methods of making quantum interactive proofs perfectly complete2013
- Author(s)
  Hirotada Kobayashi, Francois Le Gall, Harumichi Nishimura
- Journal Title
  
  Proceedings of the 4th ACM Conference on Innovations in Theoretical Computer Science
  
  Volume: 4 Pages: 329-352
- DOI
  10.1145/2422436.2422475
- NAID
  110009779047
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21244007, KAKENHI-PROJECT-22700014, KAKENHI-PLANNED-24106009
[Journal Article] Achieving perfect completeness in classical-witness quantum Merlin-Arthur proof systems2012
- Author(s)
  S.P.Jordan, H.Kobayashi, D.Nagaj, H.Nishimura
- Journal Title
  
  Quantum Information and Computation
  
  Volume: 12 Pages: 461-471
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21300002
[Journal Article] Achieving perfect completeness in classical-witness quantum Merlin-Arthur proof systems2012
- Author(s)
  Stephen P. Jordan, Hirotada Kobayashi, Daniel Nagaj, and Harumichi Nishimura
- Journal Title
  
  Quantum Information and Computation
  
  Volume: 12 Pages: 461-471
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-24240001
[Journal Article] Quantum Merlin-Arthur Proof Systems : Are Multiple Merlins More Helpful to Arthur?2009
- Author(s)
  Hirotada Kobayashi, Keiji Matsumoto, Tomoyuki Yamakami
- Journal Title
  
  Chicago Journal of Theoretical Computer Science
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21300002
[Journal Article] General scheme for perfect quantum network coding with free classical communication2009
- Author(s)
  H. Kobayashi, F. Le Gall, H. Nishimura, M.Rotteler
- Journal Title
  
  Lecture Notes in Computer Science 5555 (ICALP 2009)
  
  Pages: 622-633
- NAID
  110007227302
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21300002
[Journal Article] Using entanglement in quantum multi-prover interactive proofs2009
- Author(s)
  J. Kempe, H. Kobayashi, K. Matsumoto, T.Vidick
- Journal Title
  
  Computational Complexity
  
  Volume: 18 Pages: 273-307
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21300002
[Journal Article] Quantum Merlin-Arthur proof systems: Are multiple Merlins more helpful to Arthur?2009
- Author(s)
  H. Kobayashi, K. Matsumoto, T. Yamakami
- Journal Title
  
  Chicago Journal of Theoretical ComputerScience, Article 3
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21300002
[Journal Article] Using Entanglement in Quantum Multi-Prover Interactive Proofs2009
- Author(s)
  Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Thomas Vidick
- Journal Title
  
  Computational Complexity 18
  
  Pages: 273-307
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21300002
[Journal Article] Oracularization and Two-Prover One-Round Interactive Proofs against Nonlocal Strategies2009
- Author(s)
  Tsuyoshi Ito, Hirotada Kobayashi, Keiji Matsumoto
- Journal Title
  
  Proc.24th Annual IEEE Conference on Computational Complexity
  
  Pages: 217-228
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21300002
[Journal Article] General Scheme for Perfect Quantum Network Coding with Free Classical Communication2009
- Author(s)
  Hirotada Kobayashi, Francois Le Gall, Harumichi Nishimura, Martin Roetteler
- Journal Title
  
  Lecture Notes in Computer Science 5555
  
  Pages: 622-633
- NAID
  110007227302
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21300002
[Journal Article] Generalized Tsirelson inequalities, commuting-operator provers, and multi-prover interactive proof systems2008
- Author(s)
  Tsuyoshi Ito, Hirotada Kobayashi, Daniel Preda, Xiaoming Sun, Andrew C. -C. Yao
- Journal Title
  
  Proc. Twenty-Third Annual IEEE Conference on Computational Complexity
  
  Pages: 187-198
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-18300002
[Journal Article] Using entanglement in quantum multi-prover interacitve proofs2008
- Author(s)
  J. Kempe, H. Kobayashi, K. Matsumoto, T. Vidick
- Journal Title
  
  Proc.23^<rd> Annual IEEE Conference on Computational Complexity
  
  Pages: 211-222
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-18300002
[Journal Article] Using entanglement in quantum multi-prover interactive proofs2008
- Author(s)
  Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Thomas Vidick
- Journal Title
  
  Proc. Twenty-Third Annual IEEE Conference on Computational Complexity
  
  Pages: 211-222
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-18300002
[Journal Article] Quantum Measurements for Hidden Subgroup Problems with Optimal Sample Complexity2008
- Author(s)
  M.Hayashi, A.Kawachi, H.Kobayashi
- Journal Title
  
  Quantum Information and Computation 8(3-4)
  
  Pages: 345-358
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-18300002
[Journal Article] Quantum measurements for hidden subgroup problems with optimal sample complexity2008
- Author(s)
  M. Hayashi, A. Kawachi, H. Kobayashi
- Journal Title
  
  Quantum Information and Computation Vol.8
  
  Pages: 345-358
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-18300002
[Journal Article] Quantum measurements for hidden subgroup problems with optimal sample complexity2008
- Author(s)
  M. Hayashi, A. Kawachi, H. Kobayashi
- Journal Title
  
  Quantum Information and Computation Vol. 8
  
  Pages: 345-358
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-18300002
[Journal Article] Quantum Measurements for Hidden Subgroup Problems with Optimal Sample Complexity2008
- Author(s)
  Masahito Hayashi, Akinori Kawachi, Hirotada Kobayashi
- Journal Title
  
  Quantum Information and Computation Journal 8
  
  Pages: 345-358
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-18300002
[Journal Article] Generalized Tsirelson inequalities, commuting-operator provers, and multi-prover interactive proof systems2008
- Author(s)
  T. Ito, H. Kobayashi, D. Preda, X. Sun, A. C.-C. Yao
- Journal Title
  
  Proc. 23^<rd> Annual IEEE Conference on Computational Complexity
  
  Pages: 187-198
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-18300002
[Journal Article] Using entanglement in quantum multi-prover interacitve proofs2008
- Author(s)
  J. Kempe, H. Kobayashi, K. Matsumoto, T. Vidick
- Journal Title
  
  Proc. 23^<rd> Annual IEEE Conference on Computational Complexity
  
  Pages: 211-222
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-18300002
[Journal Article] Using Entanglement in Quantum Multi-Prover Interactive Proofs2008
- Author(s)
  J.Kempe, H.Kobayashi, K.Matsumoto, T.Vidick
- Journal Title
  
  Proc.23rd Annual IEEE Conference on Computational Complexity (採録決定)
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-18300002
[Journal Article] Generalized Tsirelson Inequalities,Commuting-Operator Provers,and Multi-Prover Interactive Proof Systems2007
- Author(s)
  T.Ito, H.Kobayashi, D.Preda, X.Sun, A.C.-C.Yao
- Journal Title
  
  Proc.23rd Annual IEEE Conference on Computational Complexity (採録決定)
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-18300002
[Presentation] Impossibility of classically simulating one-clean-qubit computation2015
- Author(s)
  藤井啓祐，小林弘忠，森前智行，西村治道，玉手修平，谷誠一郎
- Organizer
  電子情報通信学会コンピューテーション研究会
- Place of Presentation
  信州大学，長野市
- Year and Date
  2015-09-01
- Data Source
  KAKENHI-PROJECT-24240001
[Presentation] Quantum interactive proofs with weak error bounds2012
- Author(s)
  T.Ito, H, Kobayashi J.Watrous
- Organizer
  Innovations in Theoretical Computer Science 2012
- Place of Presentation
  Cambridge, MA, USA
- Year and Date
  2012-01-09
- Data Source
  KAKENHI-PROJECT-21300002
[Presentation] Quantum interactive proofs with weak error bounds2012
- Author(s)
  T. Ito, H. Kobayashi, J. Watrous
- Organizer
  Innovations in Theoretical ComputerScience 2012 (ITCS 2012)
- Place of Presentation
  Cambridge, MA, USA
- Year and Date
  2012-01-09
- Data Source
  KAKENHI-PROJECT-21300002
[Presentation] Constructing quantum network coding schemes from classical nonlinear protocols2011
- Author(s)
  H. Kobayashi, F. Le Gall, H. Nishimura, M.Rotteler
- Organizer
  2011 IEEE InternationalSymposium on Information Theory (ISIT2011)
- Place of Presentation
  St. Petersburg, Russia
- Year and Date
  2011-08-01
- Data Source
  KAKENHI-PROJECT-21300002
[Presentation] Constructing quantum network coding schemes from classical nonlinear Protocols2011
- Author(s)
  H.Kobayashi, F.Le Gall, H.Nishimura, M.Roetteler
- Organizer
  The 14^<th> Workshop on Quantum Information Processing (QIP 2011)
- Place of Presentation
  Singapore
- Year and Date
  2011-01-13
- Data Source
  KAKENHI-PROJECT-21300002
[Presentation] Constructing quantum network coding schemes from classical nonlinear protocols2011
- Author(s)
  H. Kobayashi, F. Le Gall, H. Nishimura, M.Rotteler
- Organizer
  The 14th Workshop on QuantumInformation Processing (QIP 2011)
- Place of Presentation
  Singapore
- Year and Date
  2011-01-13
- Data Source
  KAKENHI-PROJECT-21300002
[Presentation] Quantum interactive proofs with weak error bounds2011
- Author(s)
  T. Ito, H. Kobayashi, J. Watrous
- Organizer
  The 14th Workshop on Quantum Information Processing (QIP 2011)
- Place of Presentation
  Singapore
- Year and Date
  2011-01-10
- Data Source
  KAKENHI-PROJECT-21300002
[Presentation] Quantum interactive proofs with weak error bounds2011
- Author(s)
  T.Ito, H.Kobayashi, J.Watrous
- Organizer
  The 14^<th> Workshop on Quantum Information Processing (QIP 2011)
- Place of Presentation
  Singapore
- Year and Date
  2011-01-10
- Data Source
  KAKENHI-PROJECT-21300002
[Presentation] Constructing quantum network coding schemes from classical nonlinear protocols2011
- Author(s)
  H.Kobayashi, F.Le Gall, H.Nishimura, M.Rotteler
- Organizer
  2011 IEEE International Symposium on Information Theory
- Place of Presentation
  St.Potersburg, Russia
- Year and Date
  2011-08-01
- Data Source
  KAKENHI-PROJECT-21300002
[Presentation] Perfect quantum network communication protocol based on classical network coding2010
- Author(s)
  H. Kobayashi, F. Le Gall, H. Nishimura, M.Rotteler
- Organizer
  2010 IEEE International Symposium on Information Theory (ISIT2010)
- Place of Presentation
  Austin, Texas,USA
- Year and Date
  2010-06-18
- Data Source
  KAKENHI-PROJECT-21300002
[Presentation] Perfect Quantum Network Coding with Free Classical Communication2010
- Author(s)
  Hirotada Kobayashi, Francois Le Gall, Harumichi Nishimura, Martin Roetteler
- Organizer
  13^<th> Workshop on Quantum Information Processing, QIP 2010
- Place of Presentation
  Zurich, Switzerland
- Year and Date
  2010-01-21
- Data Source
  KAKENHI-PROJECT-21300002
[Presentation] Perfect quantum network communication protocol based on classical network coding2010
- Author(s)
  H.Kobayashi, F.Le Gall, H.Nishimura, M.Roetteler
- Organizer
  2010 IEEE International Symposium on Informati on Theory
- Place of Presentation
  Austin, Texas, USA
- Year and Date
  2010-06-18
- Data Source
  KAKENHI-PROJECT-21300002
[Presentation] Perfect quantum network coding with free classical communication2010
- Author(s)
  H. Kobayashi, F. Le Gall, H. Nishimura, M.Rotteler
- Organizer
  The 13th Workshop on Quantum InformationProcessing (QIP 2010)
- Place of Presentation
  Zurich, Switzerland
- Year and Date
  2010-01-21
- Data Source
  KAKENHI-PROJECT-21300002
[Presentation] Oracularization and Two-Prover One-Round Interactive Proofs against Nonlocal Strategies2009
- Author(s)
  Tsuyoshi Ito, Hirotada Kobayashi, Keiji Matsumoto
- Organizer
  24^<th> Annual IEEE Conference on Computational Complexity
- Place of Presentation
  Paris, France
- Year and Date
  2009-07-17
- Data Source
  KAKENHI-PROJECT-21300002
[Presentation] Oracularization and two-prover one-round interactive proofs against nonlocal strategies2009
- Author(s)
  Tsuyoshi Ito, Hirotada Kobayashi, Keiji Matsumoto
- Organizer
  The12th Workshop on Quantum Information Processing
- Place of Presentation
  Santa Fe, USA
- Year and Date
  2009-01-14
- Data Source
  KAKENHI-PROJECT-18300002
[Presentation] Oracularization and two-prover one-round interactive proofs against nonlocal strategies2009
- Author(s)
  T. Ito, H. Kobayashi, K. Matsumoto
- Organizer
  The 24th Annual IEEE Conference on Computational Complexity (CCC 2009)
- Place of Presentation
  Paris, France
- Year and Date
  2009-07-17
- Data Source
  KAKENHI-PROJECT-21300002
[Presentation] General Scheme for Perfect Quantum Network Coding with Free Classical Communication2009
- Author(s)
  Hirotada Kobayashi, Francois Le Gall, Harumichi Nishimura, Martin Roetteler
- Organizer
  36^<th> International Colloquium on Automata, Languages and Programming, ICALP 2009
- Place of Presentation
  Rhodes, Greece
- Year and Date
  2009-07-07
- Data Source
  KAKENHI-PROJECT-21300002
[Presentation] Generalized Tsirelson inequalities, commuting-operator provers, and multi-prover interactive proof systems2009
- Author(s)
  Tsuyoshi Ito, Hirotada Kobayashi, Daniel Preda, Xiaoming Sun, Andrew C.-C. Yao
- Organizer
  Twenty-Third Annual IEEE Conference on Computational Complexity
- Place of Presentation
  College Park, Maryland, USA
- Year and Date
  2009-06-25
- Data Source
  KAKENHI-PROJECT-18300002
[Presentation] Oracularization and two-prover one-round interactive proofs against nonlocal strategies2009
- Author(s)
  T. Ito, H. Kobayashi, K. Matsumoto
- Organizer
  The 12^<th> Workshop on Quantum Information Processing
- Place of Presentation
  Santa Fe, USA
- Year and Date
  2009-01-14
- Data Source
  KAKENHI-PROJECT-18300002
[Presentation] Using entanglement in quantum multi-prover interactive proofs2008
- Author(s)
  Julia KemPe, Hirotada Kobayashi, Keiji Matsumoto, Thomas Vidick
- Organizer
  Twenty-Third Annual IEEE Conference on Computational Complexity
- Place of Presentation
  College Park, Maryland, USA
- Year and Date
  2008-06-25
- Data Source
  KAKENHI-PROJECT-18300002
[Presentation] Generalized Tsirelson Inequalities,Commuting-Operator Provers, and Multi-Prover Interactive Proof Systems2007
- Author(s)
  T. Ito, H. Kobayashi, D. Preda, X. Sun, A. C. -C. Yao
- Organizer
  The 11th Workshop on Quantum Information Processing
- Place of Presentation
  New Delhi
- Data Source
  KAKENHI-PROJECT-18300002
[Presentation] Using entanglement in quantum multi-prover interactive proofs2007
- Author(s)
  J. Kempe, H. Kobayashi, K. Matsumoto, T. Vidick
- Organizer
  The 11^<th> Workshop on Quantum Information Processing
- Place of Presentation
  New Delhi, India
- Year and Date
  2007-12-17
- Data Source
  KAKENHI-PROJECT-18300002
[Presentation] Generalized Tsirelson inequalities, commuting-operator provers, and multi-prover interactiveproof systems2007
- Author(s)
  T. Ito, H. Kobayashi, D. Preda, X. Sun, A. C.-C. Yao
- Organizer
  The 11^<th> Workshop on Quantum Information Processing
- Place of Presentation
  New Delhi, India
- Year and Date
  2007-12-17
- Data Source
  KAKENHI-PROJECT-18300002
[Presentation] Using Entanglement in Quantum Multi-Prover Interactive Proofs2007
- Author(s)
  J. Kempe, H. Kobayashi, K. Matsumoto, T. Vidick
- Organizer
  The 11th workshop on Quantum Information Procesing
- Place of Presentation
  New Delhi
- Data Source
  KAKENHI-PROJECT-18300002
[Presentation] Towards Perfect Completeness in QMA
- Author(s)
  Stephen P. Jordan, Hirotada Kobayashi, Francois Le Gall, Daniel Nagaj, and Harumichi Nishimura
- Organizer
  The 16th Workshop on Quantum Information Processing (QIP 2013)
- Place of Presentation
  Tsinghua University, Beijing, China
- Data Source
  KAKENHI-PROJECT-24240001
[Presentation] Stronger methods of making quantum interactive proofs perfectly complete
- Author(s)
  Hirotada Kobayashi, Francois Le Gall, and Harumichi Nishimura
- Organizer
  2013 ACM Conference on Innovations in Theoretical Computer Science (ITCS 2013)
- Place of Presentation
  UC Berkeley, Berkeley, CA, USA
- Data Source
  KAKENHI-PROJECT-24240001
[Presentation] Stronger methods of making quantum interactive proofs perfectly complete
- Author(s)
  西村治道, 小林弘忠, Francois Le Gall
- Organizer
  電子情報通信学会コンピュテーション研究会
- Place of Presentation
  奈良女子大学, 奈良県
- Data Source
  KAKENHI-PLANNED-24106009
[Presentation] Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete
- Author(s)
  Hirotada Kobayashi, Francois Le Gall, Harumichi Nishimura
- Organizer
  電子情報通信学会コンピュテーション研究会
- Place of Presentation
  奈良女子大学記念館, 奈良
- Data Source
  KAKENHI-PROJECT-24240001

1. KAWACHI Akinori (00397035)

# of Collaborated Projects: 5 results

# of Collaborated Products: 4 results
2. KOSHIBA Takeshi (60400800)

# of Collaborated Projects: 4 results

# of Collaborated Products: 0 results
3. MATSUMOTO Keiji (60272390)

# of Collaborated Projects: 4 results

# of Collaborated Products: 16 results
4. TANAKA Keisuke (20334518)

# of Collaborated Projects: 3 results

# of Collaborated Products: 0 results
5. ルガルフランソワ (50584299)

# of Collaborated Projects: 3 results

# of Collaborated Products: 8 results
6. 西村治道 (70433323)

# of Collaborated Projects: 3 results

# of Collaborated Products: 13 results
7. 安永憲司 (50510004)

# of Collaborated Projects: 2 results

# of Collaborated Products: 0 results
8. Yamashita Shigeru (30362833)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
9. TANI Seiichiro (70396183)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
10. NEMOTO Kae (80370104)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
11. Murao Mio (30322671)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
12. 堀山貴史 (60314530)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
13. 中西正樹 (40324967)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
14. Ito Tsuyoshi

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results

KOBAYASHI Hirotada 小林 弘忠

小林 弘忠 コバヤシ ヒロタダ

Research Projects

Research Products

Co-Researchers

Interpolative Expansion of Quantum Protocol Theory

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Deepening Theory of Quantum Protocols

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

An Approach to Understand the Limitations of Computation based on Quantum Mechanics

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

Advances in crossover between quantum information theory and quantum computational complexity theory

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Crossover between Quantum Information Theory and Quantum Computational Complexity Theory

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

[Journal Article] Generalized quantum Arthur-Merlin games2019

Author(s)

Journal Title

DOI

Data Source

[Journal Article] Impossibility of Classically Simulating One-Clean-Qubit Model with Multiplicative Error2018

Author(s)

Journal Title

DOI

NAID

Data Source

[Journal Article] Space-Efficient Error Reduction for Unitary Quantum Computations2016

Author(s)

Journal Title

DOI

Data Source

[Journal Article] Power of Quantum Computation with Few Clean Qubits2016

Author(s)

Journal Title

DOI

Data Source

[Journal Article] Generalized Arthur-Merlin games2015

Author(s)

Journal Title

DOI

Data Source

[Journal Article] Generalized Quantum Arthur-Merlin Games2015

Author(s)

Journal Title

Data Source

[Journal Article] Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete.2015

Author(s)

Journal Title

DOI

NAID

Data Source

[Journal Article] Stronger methods of making quantum interactive proofs perfectly complete2013

Author(s)

Journal Title

DOI

NAID

Data Source

[Journal Article] Achieving perfect completeness in classical-witness quantum Merlin-Arthur proof systems2012

Author(s)

Journal Title

KOBAYASHI Hirotada 小林弘忠

小林弘忠コバヤシヒロタダ