Seiichiro Tani

发表

Classical simulation of DQC1$_2$ or DQC2$_1$ implies collapse of the polynomial hierarchy

Keisuke Fujii, Hirotada Kobayashi, Tomoyuki Morimae, 2014, 1409.6777.

An Overview of Quantum Algorithms

Seiichiro Tani, 2020 .

Power of Quantum Computation with Few Clean Qubits

Keisuke Fujii, Tomoyuki Morimae, Hirotada Kobayashi, 2015, ICALP.

Computing the Tutte Polynomial of a Graph of Moderate Size

Hiroshi Imai, Seiichiro Tani, Kyoko Sekine, 1995, ISAAC.

DS-1-11 Reconstructing Strings from Substrings with Quantum Query

Harumichi Nishimura, Seiichiro Tani, Shigeru Yamashita, 2011 .

Efficient Path Selection for Delay Testing Based on Path Clustering

Seiichiro Tani, Tomoo Fukazawa, Mitsuo Teramoto, 1999, J. Electron. Test..

Active Network technology: Towards the adaptive Network infrastructure

Toshiaki Miyazaki, Noriyuki Takahashi, Takahiro Murooka, 2002 .

Constant-Depth Exact Quantum Circuits for the OR and Threshold Functions pdf

Yasuhiro Takahashi, Seiichiro Tani, S. Tani, 2011, ArXiv.

Efficient path selection for delay testing based on partial path evaluation

Seiichiro Tani, Tomoo Fukazawa, Mitsuo Teramoto, 1998, Proceedings. 16th IEEE VLSI Test Symposium (Cat. No.98TB100231).

Polylog-overhead highly fault-tolerant measurement-based quantum computation: all-Gaussian implementation with Gottesman-Kitaev-Preskill code

Masato Koashi, Seiichiro Tani, Yuki Takeuchi, 2020, 2006.05416.

Multi-party Quantum Communication Complexity with Routed Messages

Masaki Nakanishi, Seiichiro Tani, Shigeru Yamashita, 2008, COCOON.

Quantum Query Complexity of Boolean Functions with Small On-Sets

Andris Ambainis, Masaki Nakanishi, Raymond H. Putra, 2008, ISAAC.

Special section on frontier of quantum computing

Takeshi Koshiba, Mary Inaba, Seiichiro Tani, 2009 .

Claw finding algorithms using quantum walk

Seiichiro Tani, S. Tani, 2007, Theor. Comput. Sci..

Virtual BUS: A Simple Implementation of an Effortless Networking System Based on PVM

Shinya Ishihara, Atsushi Takahara, Seiichiro Tani, 1999, PVM/MPI.

Adaptive Stream Multicast Based on IP Unicast and Dynamic Commercial Attachment Mechanism: An Active Network Implementation

Toshiaki Miyazaki, Noriyuki Takahashi, Seiichiro Tani, 2001, IWAN.

Collapse of the Hierarchy of Constant-Depth Exact Quantum Circuits

Yasuhiro Takahashi, Seiichiro Tani, 2013, Computational Complexity Conference.

Virtual BUS: a network technology for setting up distributed resources in your own computer

Toshiaki Miyazaki, Shinya Ishihara, Atsushi Takahara, 2000, Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000.

Output-size Sensitiveness of OBDD Construction Through Maximal Independent Set Problem

Kunihiko Sadakane, Seiichiro Tani, Kazuyoshi Hayase, 1995, COCOON.

Design and implementation of advanced multicast router based on cluster computing

Toshiaki Miyazaki, Hirokazu Takahashi, Takeru Inoue, 2005, 11th International Conference on Parallel and Distributed Systems (ICPADS'05).

Simpler Exact Leader Election via Quantum Reduction

Keiji Matsumoto, Hirotada Kobayashi, Seiichiro Tani, 2014, Chic. J. Theor. Comput. Sci..

Quantum Algorithms for Finding Constant-Sized Sub-hypergraphs pdf

François Le Gall, Harumichi Nishimura, Seiichiro Tani, 2014, COCOON.

Commuting quantum circuits with few outputs are unlikely to be classically simulatable

Takeshi Yamazaki, Kazuyuki Tanaka, Yasuhiro Takahashi, 2014, Quantum Inf. Comput..

Power of uninitialized qubits in shallow quantum circuits

Seiichiro Tani, Yasuhiro Takahashi, 2021, Theor. Comput. Sci..

A fast exact quantum algorithm for solitude verification

Seiichiro Tani, S. Tani, 2016, Quantum Inf. Comput..

A Design Framework for Online Algorithms Solving the Object Replacement Problem

Toshiaki Miyazaki, Seiichiro Tani, T. Miyazaki, 2001 .

Impossibility of blind quantum sampling for classical client

Tomoyuki Morimae, Harumichi Nishimura, Seiichiro Tani, 2018, Quantum Inf. Comput..

Development of Fast Quantum Algorithms

Seiichiro Tani, Yasuhiro Takahashi, 2020 .

An Improved Claw Finding Algorithm Using Quantum Walk

Seiichiro Tani, 2007, MFCS.

Quantum addition circuits and unbounded fan-out

Yasuhiro Takahashi, Noboru Kunihiro, Seiichiro Tani, 2009, Quantum Inf. Comput..

Classically Simulating Quantum Circuits with Local Depolarizing Noise pdf

Seiichiro Tani, Yasuhiro Takahashi, Yuki Takeuchi, 2020, MFCS.

Multi-Party Quantum Communication Complexity with Routed Messages

Masaki Nakanishi, Seiichiro Tani, Shigeru Yamashita, 2009 .

Quantum algorithms for finding constant-sized sub-hypergraphs

François Le Gall, Harumichi Nishimura, Seiichiro Tani, 2013, Theor. Comput. Sci..

Collapse of the Hierarchy of Constant-Depth Exact Quantum Circuits

Yasuhiro Takahashi, Seiichiro Tani, S. Tani, 2011, 2013 IEEE Conference on Computational Complexity.

Quantum Algorithm for the Multicollision Problem

Seiichiro Tani, Akinori Hosoyamada, Yu Sasaki, 2019, Theor. Comput. Sci..

Reconstructing Strings from Substrings with Quantum Queries pdf

François Le Gall, Kazuo Iwama, Harumichi Nishimura, 2012, SWAT.

Average/Worst-Case Gap of Quantum Query Complexities by On-Set Size pdf

Andris Ambainis, Masaki Nakanishi, Raymond H. Putra, 2009, ArXiv.

Virtual BUS: an easy-to-use environment for distributed resources

Toshiaki Miyazaki, Shinya Ishihara, Atsushi Takahara, 1999, Proceedings 24th Conference on Local Computer Networks. LCN'99.

Efficiently generating ground states is hard for postselected quantum computation pdf

Seiichiro Tani, Yasuhiro Takahashi, Yuki Takeuchi, 2020, ArXiv.

A Reordering Operation for an Ordered Binary Decision Diagram and an Extended Framework for Combinatorics of Graphs

Hiroshi Imai, Seiichiro Tani, H. Imai, 1994, ISAAC.

Brief announcement: exactly electing a unique leader is not harder than computing symmetric functions on anonymous quantum networks

Keiji Matsumoto, Hirotada Kobayashi, Seiichiro Tani, 2009, PODC '09.

Exact Quantum Algorithms for the Leader Election Problem

Keiji Matsumoto, Hirotada Kobayashi, Seiichiro Tani, 2005, STACS.

Power of Uninitialized Qubits in Shallow Quantum Circuits

Yasuhiro Takahashi, Seiichiro Tani, S. Tani, 2016, STACS.

The quantum query complexity of certification pdf

Andris Ambainis, François Le Gall, Andrew M. Childs, 2010, Quantum Inf. Comput..

Shallow Quantum Circuits with Uninitialized Ancillary Qubits pdf

Yasuhiro Takahashi, Seiichiro Tani, 2016, ArXiv.

Quantum Query Complexity of Almost All Functions with Fixed On-set Size

Andris Ambainis, Masaki Nakanishi, Raymond H. Putra, 2016, computational complexity.

A Randomized Online Algorithm for the File Caching Problem

Seiichiro Tani, Thoshiari Miyazaki, 2003 .

An information-theoretic security analysis of quantum string sealing

Masaki Nakanishi, Seiichiro Tani, Shigeru Yamashita, 2007 .

Impossibility of Classically Simulating One-Clean-Qubit Model with Multiplicative Error.

Keisuke Fujii, Tomoyuki Morimae, Hirotada Kobayashi, 2014, Physical review letters.

Improved Quantum Multicollision-Finding Algorithm

Yu Sasaki, Seiichiro Tani, Akinori Hosoyamada, 2018, IACR Cryptol. ePrint Arch..

The One-Way Communication Complexity of Subgroup Membership

Alexander Russell, François Le Gall, Scott Aaronson, 2011, Chic. J. Theor. Comput. Sci..

The Complexity of the Optimal Variable Ordering Problems of Shared Binary Decision Diagrams

Shuzo Yajima, Kiyoharu Hamaguchi, Seiichiro Tani, 1993, ISAAC.

Computing on Anonymous Quantum Network pdf

Keiji Matsumoto, Hirotada Kobayashi, Seiichiro Tani, 2010, ArXiv.

Sumcheck-based delegation of quantum computing to rational server

Tomoyuki Morimae, Seiichiro Tani, Yuki Takeuchi, 2019, TAMC.

Exact Quantum Algorithms for the Leader Election Problem

Keiji Matsumoto, Hirotada Kobayashi, Seiichiro Tani, 2005, TOCT.

Hardness of efficiently generating ground states in postselected quantum computation

Seiichiro Tani, Yuki Takeuchi, Yasuhiro Takahashi, 2020, Physical Review Research.

Quadratic improvement on accuracy of approximating pure quantum states and unitary gates by probabilistic implementation

Go Kato, Seiichiro Tani, Seiseki Akibue, 2021 .

Computational self-testing for entangled magic states

Seiichiro Tani, Ryo Hiromasa, Yuki Takeuchi, 2021, IACR Cryptol. ePrint Arch..

Power of uninitialized qubits in shallow quantum circuits

Seiichiro Tani, Yasuhiro Takahashi, 2021, Theor. Comput. Sci..

Classically simulating quantum circuits with local depolarizing noise

Seiichiro Tani, Yuki Takeuchi, Yasuhiro Takahashi, 2021, Theor. Comput. Sci..

Global Multi-Point Streaming Experiments Based on the Flexcast Protocol

Toshiaki Miyazaki, Satoshi Kotabe, Takeru Inoue, 2004 .

Quantum Leader Election via Exact Amplitude Amplification

Hirotada Kobayashi, Seiichiro Tani, Keiji Matsumoto, 2005 .

Computing the Tutte Polynomial of a Graph and the Jones Polynomial of an Alternating Link of Moderat

Hiroshi Imai, Seiichiro Tani, Kyoko Sekine, 1995 .

Experimental demonstration of quantum leader election in linear optics

Akihisa Tomita, Seiichiro Tani, Xiang-Bin Wang, 2008 .