Yasuhiro Takahashi / 高橋 康博

日本語版へ

Research Interests

Quantum Computing, Computational Complexity Theory, Cryptography

List of Publications

Journal Papers

• 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.

Conference Papers

• 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.

Presentations at Domestic Workshops

• Eri Koseki, Noboru Kunihiro, Yasuhiro Takahashi. An Efficient Quantum Circuit for Order-Finding on a Linear Nearest Neighbor Architecture. Symposium on Cryptography and Information Security (SCIS 2008), 2008.

• Eri Koseki, Noboru Kunihiro, Yasuhiro Takahashi, Kazuo Ohta. Resource Evaluations of Quantum Circuits for Order-Finding Using 2n+O(1) Qubits. The 17th Quantum Information Technology Symposium (QIT17), pp. 112-117, 2007.

• Eri Koseki, Noboru Kunihiro, Yasuhiro Takahashi, Kazuo Ohta. Strict Evaluations of Quantum Circuits for Order-Finding Using 2n+\alpha Qubits. Symposium on Cryptography and Information Security (SCIS 2007), 2007.

• Yasuhiro Takahashi. Introduction to Quantum Computation : Quantum Circuit Model, Quantum Information and Computing Seminar in Sendai 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.

Society Membership

The Institute of Electronics, Information and Communication Engineers (IEICE)

Information Processing Society of Japan (IPSJ)

Committee

Conference on Theory of Quantum Computation, Communication, and Cryptography (TQC 2012), program committee

Workshop on Theory of Quantum Computation, Communication, and Cryptography (TQC 2008), organizing committee

Workshop on Theory of Quantum Computation, Communication, and Cryptography (TQC 2007), organizing committee

Workshop on Theory of Quantum Computation, Communication, and Cryptography (TQC 2006), organizing committee

Biography

2008.3 Ph.D. in Engineering from the University of Electro-Communications.

Ph.D. Thesis：Efficient Quantum Circuits for Arithmetic Operations and Their Applications

2000.4 Joined in NTT Communication Science Laboratories.

2000.3 M.S. in Mathematics from Tohoku University.

Master Thesis：Second Order Arithmetic and Theory of Ordinal Numbers

1998.3 B.S. in Mathematics from Tohoku University.