Seiichiro Tani

Publication Activity (10 Years)

Years Active: 1993-2023
Publications (10 Years): 32

Top Topics

Hierarchically Organized

Variable Ordering

Quantum Computation

Wall Street Journal

Top Venues

Theor. Comput. Sci.

Quantum Inf. Comput.

Publications

Ryo Hiromasa, Akihiro Mizutani, Yuki Takeuchi, Seiichiro Tani
Rewindable Quantum Computation and Its Equivalence to Cloning and Adaptive Postselection. TQC (2023)
Yuki Takeuchi, Tomoyuki Morimae, Seiichiro Tani
Sumcheck-based delegation of quantum computing to rational server. Theor. Comput. Sci. 924 (2022)
Seiichiro Tani
Space-Bounded Unitary Quantum Computation with Postselection. MFCS (2022)
Yuki Takeuchi, Yasuhiro Takahashi, Tomoyuki Morimae, Seiichiro Tani
Divide-and-conquer verification method for noisy intermediate-scale quantum computation. Quantum 6 (2022)
Ryo Hiromasa, Akihiro Mizutani, Yuki Takeuchi, Seiichiro Tani
Rewindable Quantum Computation and Its Equivalence to Cloning and Adaptive Postselection. CoRR (2022)
Seiichiro Tani
Space-Bounded Unitary Quantum Computation with Postselection. CoRR (2022)
Akihiro Mizutani, Yuki Takeuchi, Ryo Hiromasa, Yusuke Aikawa, Seiichiro Tani
Computational self-testing for entangled magic states. IACR Cryptol. ePrint Arch. 2021 (2021)
Yasuhiro Takahashi, Yuki Takeuchi, Seiichiro Tani
Classically simulating quantum circuits with local depolarizing noise. Theor. Comput. Sci. 893 (2021)
Yasuhiro Takahashi, Seiichiro Tani
Power of uninitialized qubits in shallow quantum circuits. Theor. Comput. Sci. 851 (2021)
Seiichiro Tani
Quantum Algorithm for Finding the Optimal Variable Ordering for Binary Decision Diagrams. SWAT (2020)
Yasuhiro Takahashi, Yuki Takeuchi, Seiichiro Tani
Classically Simulating Quantum Circuits with Local Depolarizing Noise. MFCS (2020)
Akinori Hosoyamada, Yu Sasaki, Seiichiro Tani, Keita Xagawa
Quantum algorithm for the multicollision problem. Theor. Comput. Sci. 842 (2020)
Yuki Takeuchi, Yasuhiro Takahashi, Seiichiro Tani
Efficiently generating ground states is hard for postselected quantum computation. CoRR (2020)
Yasuhiro Takahashi, Yuki Takeuchi, Seiichiro Tani
Classically Simulating Quantum Circuits with Local Depolarizing Noise. CoRR (2020)
Yuki Takeuchi, Tomoyuki Morimae, Seiichiro Tani
Sumcheck-Based Delegation of Quantum Computing to Rational Server. TAMC (2020)
Akinori Hosoyamada, Yu Sasaki, Seiichiro Tani, Keita Xagawa
Improved Quantum Multicollision-Finding Algorithm. PQCrypto (2019)
Tomoyuki Morimae, Harumichi Nishimura, Yuki Takeuchi, Seiichiro Tani
Impossibility of blind quantum sampling for classical client. Quantum Inf. Comput. 19 (9&10) (2019)
Yuki Takeuchi, Tomoyuki Morimae, Seiichiro Tani
Sumcheck-based delegation of quantum computing to rational server. CoRR (2019)
Akinori Hosoyamada, Yu Sasaki, Seiichiro Tani, Keita Xagawa
Quantum Algorithm for the Multicollision Problem. CoRR (2019)
Seiichiro Tani
Quantum Algorithm for Finding the Optimal Variable Ordering for Binary Decision Diagrams. CoRR (2019)
Yasuhiro Takahashi, Seiichiro Tani
Power of Uninitialized Qubits in Shallow Quantum Circuits. STACS (2018)
Akinori Hosoyamada, Yu Sasaki, Seiichiro Tani, Keita Xagawa
Improved Quantum Multicollision-Finding Algorithm. IACR Cryptol. ePrint Arch. 2018 (2018)
Tomoyuki Morimae, Harumichi Nishimura, Yuki Takeuchi, Seiichiro Tani
Impossibility of blind quantum sampling for classical client. CoRR (2018)
Akinori Hosoyamada, Yu Sasaki, Seiichiro Tani, Keita Xagawa
Improved Quantum Multicollision-Finding Algorithm. CoRR (2018)
Seiichiro Tani
A fast exact quantum algorithm for solitude verification. Quantum Inf. Comput. 17 (1&2) (2017)
Seiichiro Tani
A Fast Exact Quantum Algorithm for Solitude Verification. CoRR (2016)
Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond, Seiichiro Tani, Shigeru Yamashita
Quantum Query Complexity of Almost All Functions with Fixed On-set Size. Comput. Complex. 25 (4) (2016)
Yasuhiro Takahashi, Seiichiro Tani, Takeshi Yamazaki, Kazuyuki Tanaka
Commuting quantum circuits with few outputs are unlikely to be classically simulatable. Quantum Inf. Comput. 16 (3&4) (2016)
François Le Gall, Harumichi Nishimura, Seiichiro Tani
Quantum algorithms for finding constant-sized sub-hypergraphs. Theor. Comput. Sci. 609 (2016)
Keisuke Fujii, Hirotada Kobayashi, Tomoyuki Morimae, Harumichi Nishimura, Shuhei Tamate, Seiichiro Tani
Power of Quantum Computation with Few Clean Qubits. ICALP (2016)
Yasuhiro Takahashi, Seiichiro Tani
Collapse of the Hierarchy of Constant-Depth Exact Quantum Circuits. Comput. Complex. 25 (4) (2016)
Yasuhiro Takahashi, Seiichiro Tani
Shallow Quantum Circuits with Uninitialized Ancillary Qubits. CoRR (2016)
Yasuhiro Takahashi, Seiichiro Tani, Takeshi Yamazaki, Kazuyuki Tanaka
Commuting Quantum Circuits with Few Outputs are Unlikely to be Classically Simulatable. COCOON (2015)
Keisuke Fujii, Hirotada Kobayashi, Tomoyuki Morimae, Harumichi Nishimura, Shuhei Tamate, Seiichiro Tani
Power of Quantum Computation with Few Clean Qubits. CoRR (2015)
Hirotada Kobayashi, Keiji Matsumoto, Seiichiro Tani
Simpler Exact Leader Election via Quantum Reduction. Chic. J. Theor. Comput. Sci. 2014 (2014)
Yasuhiro Takahashi, Seiichiro Tani, Takeshi Yamazaki, Kazuyuki Tanaka
Commuting Quantum Circuits with Few Outputs are Unlikely to be Classically Simulatable. CoRR (2014)
Keisuke Fujii, Hirotada Kobayashi, Tomoyuki Morimae, Harumichi Nishimura, Shuhei Tamate, Seiichiro Tani
Impossibility of Classically Simulating One-Clean-Qubit Computation. CoRR (2014)
François Le Gall, Harumichi Nishimura, Seiichiro Tani
Quantum Algorithms for Finding Constant-Sized Sub-hypergraphs. COCOON (2014)
Yasuhiro Takahashi, Seiichiro Tani
Collapse of the Hierarchy of Constant-Depth Exact Quantum Circuits. Computational Complexity Conference (2013)
François Le Gall, Harumichi Nishimura, Seiichiro Tani
Quantum Algorithms for Finding Constant-sized Sub-hypergraphs over 3-uniform Hypergraphs. CoRR (2013)
Richard Cleve, Kazuo Iwama, François Le Gall, Harumichi Nishimura, Seiichiro Tani, Junichi Teruyama, Shigeru Yamashita
Reconstructing Strings from Substrings with Quantum Queries. SWAT (2012)
Richard Cleve, Kazuo Iwama, François Le Gall, Harumichi Nishimura, Seiichiro Tani, Junichi Teruyama, Shigeru Yamashita
Reconstructing Strings from Substrings with Quantum Queries CoRR (2012)
Seiichiro Tani
Compression of View on Anonymous Networks - Folded View -. IEEE Trans. Parallel Distributed Syst. 23 (2) (2012)
Seiichiro Tani, Hirotada Kobayashi, Keiji Matsumoto
Exact Quantum Algorithms for the Leader Election Problem. ACM Trans. Comput. Theory 4 (1) (2012)
Scott Aaronson, François Le Gall, Alexander Russell, Seiichiro Tani
The One-Way Communication Complexity of Subgroup Membership. Chic. J. Theor. Comput. Sci. 2011 (2011)
Yasuhiro Takahashi, Seiichiro Tani
Constant-Depth Exact Quantum Circuits for the OR and Threshold Functions CoRR (2011)
Hirotada Kobayashi, Keiji Matsumoto, Seiichiro Tani
Computing on Anonymous Quantum Network CoRR (2010)
Andris Ambainis, Andrew M. Childs, François Le Gall, Seiichiro Tani
The quantum query complexity of certification. Quantum Inf. Comput. 10 (3&4) (2010)
Yasuhiro Takahashi, Seiichiro Tani, Noboru Kunihiro
Quantum addition circuits and unbounded fan-out. Quantum Inf. Comput. 10 (9&10) (2010)
Seiichiro Tani, Masaki Nakanishi, Shigeru Yamashita
Multi-Party Quantum Communication Complexity with Routed Messages. IEICE Trans. Inf. Syst. (2) (2009)
Seiichiro Tani
Claw finding algorithms using quantum walk. Theor. Comput. Sci. 410 (50) (2009)
Hirotada Kobayashi, Keiji Matsumoto, Seiichiro Tani
Brief announcement: exactly electing a unique leader is not harder than computing symmetric functions on anonymous quantum networks. PODC (2009)
Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond, Seiichiro Tani, Shigeru Yamashita
Average/Worst-Case Gap of Quantum Query Complexities by On-Set Size CoRR (2009)
Andris Ambainis, Andrew M. Childs, François Le Gall, Seiichiro Tani
The quantum query complexity of certification CoRR (2009)
Scott Aaronson, François Le Gall, Alexander Russell, Seiichiro Tani
The One-Way Communication Complexity of Group Membership CoRR (2009)
Seiichiro Tani
Foreword. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (5) (2009)
Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond, Seiichiro Tani, Shigeru Yamashita
Quantum Query Complexity of Boolean Functions with Small On-Sets. ISAAC (2008)
Seiichiro Tani, Masaki Nakanishi, Shigeru Yamashita
Multi-party Quantum Communication Complexity with Routed Messages. COCOON (2008)
Seiichiro Tani
Claw Finding Algorithms Using Quantum Walk. CoRR (2007)
Seiichiro Tani, Hirotada Kobayashi, Keiji Matsumoto
Exact Quantum Algorithms for the Leader Election Problem. CoRR (2007)
Seiichiro Tani
An Improved Claw Finding Algorithm Using Quantum Walk. MFCS (2007)
Takeru Inoue, Seiichiro Tani, Hirokazu Takahashi, Toshiaki Miyazaki, Kan Toyoshima
Design and Implementation of Advanced Multicast Router Based on Cluster Computing. ICPADS (1) (2005)
Seiichiro Tani, Hirotada Kobayashi, Keiji Matsumoto
Exact Quantum Algorithms for the Leader Election Problem. STACS (2005)
Seiichiro Tani, Toshiaki Miyazaki, Noriyuki Takahashi
Adaptive Stream Multicast Based on IP Unicast and Dynamic Commercial Attachment Mechanism: An Active Network Implementation. IWAN (2001)
Toshiaki Miyazaki, Atsushi Takahara, Shinya Ishihara, Seiichiro Tani, Takahiro Murooka, Tomoo Fukazawa, Mitsuo Teramoto, Kazuyoshi Matsuhiro
Virtual BUS: A Network Technology for Setting up Distributed Resources in Your Own Computer. IPDPS (2000)
Shinya Ishihara, Seiichiro Tani, Atsushi Takahara
Virtual BUS: A Simple Implementation of an Effortless Networking System Based on PVM. PVM/MPI (1999)
Atsushi Takahara, Seiichiro Tani, Shinya Ishihara, Toshiaki Miyazaki, Mitsuo Teramoto, Tomoo Fukazawa, Kazuyoshi Matsuhiro
Virtual BUS: An Easy-to-Use Environment for Distributed Resources. LCN (1999)
Seiichiro Tani, Mitsuo Teramoto, Tomoo Fukazawa, Kazuyoshi Matsuhiro
Efficient Path Selection for Delay Testing Based on Path Clustering. J. Electron. Test. 15 (1-2) (1999)
Seiichiro Tani, Mitsuo Teramoto, Tomoo Fukazawa, Kazuyoshi Matsuhiro
Efficient Path Selection for Delay Testing Based on Partial Path Evaluation. VTS (1998)
Kyoko Sekine, Hiroshi Imai, Seiichiro Tani
Computing the Tutte Polynomial of a Graph of Moderate Size. ISAAC (1995)
Kazuyoshi Hayase, Kunihiko Sadakane, Seiichiro Tani
Output-size Sensitiveness of OBDD Construction Through Maximal Independent Set Problem. COCOON (1995)
Seiichiro Tani, Hiroshi Imai
A Reordering Operation for an Ordered Binary Decision Diagram and an Extended Framework for Combinatorics of Graphs. ISAAC (1994)
Seiichiro Tani, Kiyoharu Hamaguchi, Shuzo Yajima
The Complexity of the Optimal Variable Ordering Problems of Shared Binary Decision Diagrams. ISAAC (1993)