高橋 康博

高橋 康博

NTT コミュニケーション科学基礎研究所
メディア情報研究部
情報基礎理論研究グループ
主任研究員,博士(工学)

〒 243-0198 神奈川県厚木市森の里若宮 3-1
E-mail: takahashi.yasuhiro (at) lab.ntt.co.jp

English version
研究成果に関する一般向け講演動画, オープンハウス2018, 2018年5月31日.

興味のある分野

量子計算,計算量理論,暗号理論

論文リスト

解説記事と翻訳

  • 高橋康博. 量子回路と古典回路の相違. 日本オペレーションズ・リサーチ学会機関誌「オペレーションズ・リサーチ」, Vol. 63 No. 6, pp. 319-325, 2018.

  • 高橋康博. ステップ数の少ない量子回路の計算能力. 電子情報通信学会誌, Vol. 97 No. 12, pp. 1110-1114, 2014.

  • 高橋康博. 量子回路と古典回路の相違:加算回路を例として. 情報処理学会誌「情報処理」, Vol. 55 No. 7, pp. 689-694, 2014.

  • Yasuhiro Takahashi. Reducing the resources in measurement-only quantum computation. NTT Technical Review, Vol. 9 No. 7, 2011.

  • 高橋康博. 量子情報処理〜超高速計算を目指して〜. ITUジャーナル, Vol. 38 No. 8, pp. 20-21, 2008.

  • 田中一之 (監訳). 確かさを求めて‐数学の基礎についての哲学論考. 培風館, 2007. (第 I 部と第 II 部を担当)

  • 高橋康博. Shor のアルゴリズムのための効率的な量子回路. 情報処理学会誌「情報処理」, Vol. 47 No. 12, pp. 1323-1328, 2006.

論文誌

  • Yasuhiro Takahashi and Seiichiro Tani. Power of uninitialized qubits in shallow quantum circuits, submitted.

  • Yuki Takeuchi and Yasuhiro Takahashi. Ancilla-driven instantaneous quantum polynomial time circuit for quantum supremacy. Physical Review A 94, 062336, 2016.

  • Yasuhiro Takahashi and Seiichiro Tani. Collapse of the hierarchy of constant-depth exact quantum circuits. Computational Complexity, Vol. 25 Issue 4, pp. 849-881, 2016.

  • Yasuhiro Takahashi, Seiichiro Tani, Takeshi Yamazaki, Kazuyuki Tanaka. Commuting quantum circuits with few outputs are unlikely to be classically simulatable. Quantum Information and Computation, Vol. 16 No. 3&4, pp. 251-270, 2016.

  • Yasuhiro Takahashi, Takeshi Yamazaki, Kazuyuki Tanaka. Hardness of classically simulating quantum circuits with unbounded Toffoli and fan-out gates. Quantum Information and Computation, Vol. 14 No. 13&14, pp. 1149-1164, 2014.

  • Yasuhiro Takahashi. An approximately universal set consisting of two observables. International Journal of Quantum Information, Vol. 9 No. 6, pp. 1393-1412, 2011.

  • Yasuhiro Takahashi, Seiichiro Tani, Noboru Kunihiro. Quantum addition circuits and unbounded fan-out. Quantum Information and Computation, Vol. 10 No. 9&10, pp. 872-890, 2010.

  • Yasuhiro Takahashi. Simple sets of measurements for universal quantum computation and graph state preparation. International Journal of Quantum Information, Vol. 8 No. 6, pp. 1001-1012, 2010.

  • Yasuhiro Takahashi. Quantum arithmetic circuits: a survey. IEICE Trans. Fundamentals, Vol. E92-A No. 5, pp. 1276-1283, 2009. (Invited Paper)

  • Yasuhiro Takahashi and Noboru Kunihiro. A fast quantum circuit for addition with few qubits. Quantum Information and Computation, Vol. 8 No. 6&7, pp. 636-649, 2008.

  • Yasuhiro Takahashi, Noboru Kunihiro, Kazuo Ohta. The quantum Fourier transform on a linear nearest neighbor architecture. Quantum Information and Computation, Vol. 7 No. 4, pp. 383-391, 2007.

  • Yasuhiro Takahashi and Noboru Kunihiro. A quantum circuit for Shor's factoring algorithm using 2n+2 qubits. Quantum Information and Computation, Vol. 6 No. 2, pp. 184-192, 2006.

  • Yasuhiro Takahashi and Noboru Kunihiro. A linear-size quantum circuit for addition with no ancillary qubits. Quantum Information and Computation, Vol. 5 No. 6, pp. 440-448, 2005.

国際会議

  • Yasuhiro Takahashi and Seiichiro Tani. Power of uninitialized qubits in shallow quantum circuits. The 22nd Annual Conference on Quantum Information Processing 2019 (QIP 2019), 2019.

  • Yasuhiro Takahashi and Seiichiro Tani. Power of uninitialized qubits in shallow quantum circuits. The 18th Asian Quantum Information Science Conference (AQIS 2018), p. 49, 2018.

  • Yasuhiro Takahashi and Seiichiro Tani. Power of uninitialized qubits in shallow quantum circuits. The 35th International Symposium on Theoretical Aspects of Computer Science (STACS 2018), Leibniz International Proceedings in Informatics (LIPIcs) 96, pp. 57:1-57:13, 2018.

  • Yasuhiro Takahashi. On the computational power of constant-depth exact quantum circuits. Computability Theory and Foundations of Mathematics (CTFM 2015), 2015.

  • Yasuhiro Takahashi. On the computational power of constant-depth exact quantum circuits. Minisymposium "Quantum Computation and Quantum Information", the 8th International Congress on Industrial and Applied Mathematics (ICIAM 2015), 2015. (Invited Talk)

  • Yasuhiro Takahashi, Seiichiro Tani, Takeshi Yamazaki, Kazuyuki Tanaka. Commuting quantum circuits with few outputs are unlikely to be classically simulatable. The 21st International Computing and Combinatorics Conference (COCOON 2015), LNCS 9198, pp. 223-234, 2015.

  • Yasuhiro Takahashi. On the computational power of constant-depth exact quantum circuits. ELC Workshop at the University of Tokyo on Quantum Complexity Theory (Satellite workshop of AQIS 2014), 2014. (Invited Talk)

  • Yasuhiro Takahashi, Takeshi Yamazaki, Kazuyuki Tanaka. Hardness of classically simulating quantum circuits with unbounded Toffoli and fan-out gates. The 38th International Symposium on Mathematical Foundations of Computer Science (MFCS 2013), LNCS 8087, pp. 801-812, 2013.

  • Yasuhiro Takahashi and Seiichiro Tani. Collapse of the hierarchy of constant-depth exact quantum circuits. The 28th IEEE Conference on Computational Complexity (CCC 2013), pp. 168-178, 2013.

  • Yasuhiro Takahashi. An approximately universal set consisting of two observables. The 6th Conference on Theory of Quantum Computation, Communication, and Cryptography (TQC 2011), 2011.

  • Yasuhiro Takahashi. Reducing the resources of measurement-only quantum computation. The 14th Workshop on Quantum Information Processing 2011 (QIP 2011), 2011.

  • Yasuhiro Takahashi. Simple sets of measurements for universal quantum computation and graph state preparation. The 5th Conference on Theory of Quantum Computation, Communication, and Cryptography (TQC 2010), 2010. LNCS 6519, pp. 26-34, 2011.

  • Yasuhiro Takahashi, Seiichiro Tani, Noboru Kunihiro. Quantum addition circuits and unbounded fan-out. The 13th Workshop on Quantum Information Processing 2010 (QIP 2010), 2010.

  • Yasuhiro Takahashi, Seiichiro Tani, Noboru Kunihiro. Quantum addition circuits and unbounded fan-out. Asian Conference on Quantum Information Science 2009 (AQIS'09), pp. 45-46, 2009.

  • Yasuhiro Takahashi and Noboru Kunihiro. Circuit for Shor's factoring algorithm with at most 2n+2 qubits. The 4th Workshop on Theory of Quantum Computation, Communication, and Cryptography (TQC 2009), 2009.

  • Yasuhiro Takahashi and Noboru Kunihiro. Addition on a linear nearest neighbor architecture. Asian Conference on Quantum Information Science 2008 (AQIS'08), pp. 139-140, 2008.

  • Yasuhiro Takahashi and Noboru Kunihiro. A fast quantum circuit for addition with few qubits. The 3rd Workshop on Theory of Quantum Computation, Communication, and Cryptography (TQC 2008), pp. 35-36, 2008.

  • Yasuhiro Takahashi and Noboru Kunihiro. A fast quantum circuit for addition with few qubits. The 11th Workshop on Quantum Information Processing 2008 (QIP 2008), 2007.

  • Yasuhiro Takahashi, Noboru Kunihiro, Kazuo Ohta. The quantum Fourier transform on a linear nearest neighbor architecture. Asian Conference on Quantum Information Science 2007 (AQIS'07), pp. 10-11, 2007.

  • Yasuhiro Takahashi, Noboru Kunihiro, Kazuo Ohta. The quantum Fourier transform on a linear nearest neighbor architecture. The 10th Workshop on Quantum Information Processing 2007 (QIP 2007), 2007.

  • Yasuhiro Takahashi, Noboru Kunihiro, Kazuo Ohta. An efficient quantum circuit for addition in GF(p) and Shor's algorithm. Asian Conference on Quantum Information Science 2006 (AQIS'06), pp. 109-110, 2006.

  • Yasuhiro Takahashi and Noboru Kunihiro. A quantum circuit for Shor's factoring algorithm using 2n+2 qubits. Workshop on Theory of Quantum Computation, Communication, and Cryptography (TQC 2006), pp. 4-5, 2006.

  • Yasuhiro Takahashi and Noboru Kunihiro. A linear-size quantum circuit for addition with no ancillary qubits. ERATO Conference on Quantum Information Science 2005 (EQIS'05), pp. 113-114, 2005.

  • Noboru Kunihiro, Hirokazu Suzuki, Yasuhiro Takahashi. Shor's factoring algorithm with approximate modular addition. The 8th Workshop on Quantum Information Processing 2005 (QIP 2005), 2005.

  • Yasuhiro Takahashi. Some examples of one-way permutations for constant-depth quantum circuits. ERATO Conference on Quantum Information Science 2004 (EQIS'04), pp. 177-178, 2004.

  • Yasuhiro Takahashi, Seiichiro Tani, Yasuhito Kawano. An explicit construction of one-way permutations for constant-depth quantum circuits. International Symposium on Mesoscopic Superconductivity and Spintronics 2004 (MS+S 2004), 2004.

  • Noboru Kunihiro, Yasuhiro Takahashi, Yasuhito Kawano. Reversibility of modular squaring. International Symposium on Mesoscopic Superconductivity and Spintronics 2004 (MS+S2004), 2004.

  • Yasuhito Kawano, Seiichiro Tani, Yasuhiro Takahashi, Mayumi Oto, Noboru Kunihiro. NP-completeness of the initial arrangement of qubits. International Symposium on Mesoscopic Superconductivity and Spintronics 2004 (MS+S 2004), 2004.

  • Yasuhiro Takahashi, Yasuhito Kawano, Masahiro Kitagawa. On the computational power of constant-depth quantum circuits with gates for addition. IEEE Congress on Evolutionary Computation 2003 (CEC 2003), Vol. 1, pp. 154-161, 2003.

  • Yasuhiro Takahashi, Yasuhito Kawano, Masahiro Kitagawa. Constant-depth quantum circuits with gates for addition. ERATO Conference on Quantum Information Science 2003 (EQIS'03), pp. 127-128, 2003.

  • Yasuhito Kawano, Yasuhiro Takahashi, Shigeru Yamashita, Masahiro Kitagawa. Explicit implementation of quantum computers on a unidirectional periodic structure. Carrier Interactions and Spintronics in Nanostructures (CISN 2003), 2003.

国内学会

  • Yasuhiro Takahashi and Seiichiro Tani. Power of uninitialized qubits in shallow quantum circuits. The 38th Quantum Information Technology Symposium (QIT38), pp. 13-18, 2018.

  • 竹内勇貴, 高橋康博. 古典模倣困難性を有するアンシラ駆動型可換量子回路. The 38th Quantum Information Technology Symposium (QIT38), pp. 8-12, 2018.

  • Yasuhiro Takahashi and Seiichiro Tani. Power of uninitialized qubits in shallow quantum circuits. Theoretical Foundations of Computing (COMP), COMP2018-2, pp. 23-26, 2018.

  • Yasuhiro Takahashi. Quantum addition circuits and unbounded fan-out. CryptoMathCREST Mini-Workshop "Quantum and Cryptography", 2018. (招待講演)

  • 竹内勇貴, 高橋康博. 古典模倣困難性を有するアンシラ駆動型可換量子回路. 日本物理学会 第72回年次大会, 2017.

  • Yasuhiro Takahashi, Takeshi Yamazaki, Kazuyuki Tanaka. Hardness of classically simulating quantum circuits with unbounded Toffoli and fan-out gates. Theoretical Foundations of Computing (COMP), COMP2013-29, pp. 27-34, 2013. (招待講演)

  • 高橋康博. 深さを制限した量子回路の計算能力. The 28th Quantum Information Technology Symposium (QIT28), 2013. (招待講演)

  • 小関恵梨, 國廣昇, 高橋康博. LNN 上における効率的な位数発見量子回路の構成. Symposium on Cryptography and Information Security (SCIS 2008), 2008.

  • 小関恵梨, 國廣昇, 高橋康博, 太田和夫. 2n+O(1) 個の量子ビットを用いた位数発見回路に対するリソースの評価. The 16th Quantum Information Technology Symposium (QIT16), pp. 112-117, 2007.

  • 小関恵梨, 國廣昇, 高橋康博, 太田和夫. 2n+α 個の量子ビットを用いた位数発見回路の厳密な評価. Symposium on Cryptography and Information Security (SCIS 2007), 2007.

  • 高橋康博. 量子計算入門 I:量子回路計算モデル. 第2回量子情報と量子計算 仙台研究会, 2004.

  • Yasuhiro Takahashi, Yasuhito Kawano, Masahiro Kitagawa. Elementary arithmetic operations in constant-depth quantum circuits. The Eighth Quantum Information Technology Symposium (QIT8), pp. 195-198, 2003.

所属学会

  • 電子情報通信学会 (IEICE)

  • 情報処理学会 (IPSJ)

学会活動, 教育活動, 社会活動

  • 立命館大学大学院情報理工学研究科情報理工学専攻 学位審査委員 (2017年)

  • 文部科学省 科学技術・学術政策研究所 科学技術予測センター 専門調査員 (2017年--現在)

  • Conference on Reversible Computation (RC 2017) プログラム委員 (2017年)

  • 情報処理学会 論文誌ジャーナル/JIP編集委員会 小委員会 (基盤グループ) 編集委員 (2016年--現在)

  • The 33rd Quantum Information Technology Symposium (QIT33) 組織委員 (2015年)

  • Conference on Reversible Computation (RC 2014) プログラム委員 (2014年)

  • Conference on Theory of Quantum Computation, Communication, and Cryptography (TQC 2012) プログラム委員 (2012年)

  • Seoul National University (Department of Mathematical Sciences) 学位審査委員 (2011年--2012年)

  • 東北大学大学院理学研究科数学専攻 非常勤講師 (2011年)

  • 電子情報通信学会 コンピュテーション研究専門委員会 専門委員 (2009年--2015年)

  • 電子情報通信学会 会誌編集委員会 WG-A 編集委員 (2008年--2010年)

  • Workshop on Theory of Quantum Computation, Communication, and Cryptography (TQC 2008) 組織委員 (2008年)

  • Workshop on Theory of Quantum Computation, Communication, and Cryptography (TQC 2007) 組織委員 (2007年)

  • Workshop on Theory of Quantum Computation, Communication, and Cryptography (TQC 2006) 組織委員 (2006年)

  • 電子情報通信学会 ソサイエティ論文誌編集委員会 査読委員 (2005年--現在)

表彰

  • 量子アルゴリズムに関する先駆的研究. 電子情報通信学会 業績賞, 2019.

  • 物理的実現性の高い量子回路の計算能力の解明. NTT コミュニケーション科学基礎研究所 所長表彰 研究開発賞, 2016.

  • 四則演算能力における量子回路と古典回路の相違の発見. NTT コミュニケーション科学基礎研究所 所長表彰 奨励賞, 2004.

略歴

  • 2008年3月 電気通信大学大学院電気通信学研究科情報通信工学専攻 博士後期課程修了,博士(工学)

    • 博士論文:Efficient quantum circuits for arithmetic operations and their applications (指導教官: 國廣昇 准教授)

  • 2006年4月 電気通信大学大学院電気通信学研究科情報通信工学専攻 博士後期課程入学

  • 2000年4月 日本電信電話株式会社 入社(NTT コミュニケーション科学基礎研究所 配属),現在に至る

  • 2000年3月 東北大学大学院理学研究科数学専攻 博士前期課程修了,修士(理学)

    • 修士論文:2階算術と順序数の理論 (指導教官: 田中一之 教授)

  • 1998年4月 東北大学大学院理学研究科数学専攻 博士前期課程入学

  • 1998年3月 東北大学理学部数学科 卒業,学士(理学)

  • 1975年5月 岩手県に生まれる

最終更新:2019年2月21日