Seiichiro Tani

According to our database, Seiichiro Tani authored at least 49 papers between 1993 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Rewindable Quantum Computation and Its Equivalence to Cloning and Adaptive Postselection.

Ryo Hiromasa, Akihiro Mizutani, Yuki Takeuchi, Seiichiro Tani

Proceedings of the 18th Conference on the Theory of Quantum Computation, 2023

2022

Sumcheck-based delegation of quantum computing to rational server.

Yuki Takeuchi, Tomoyuki Morimae, Seiichiro Tani

Theor. Comput. Sci., 2022

Divide-and-conquer verification method for noisy intermediate-scale quantum computation.

Yuki Takeuchi, Yasuhiro Takahashi, Tomoyuki Morimae, Seiichiro Tani

Quantum, 2022

Space-Bounded Unitary Quantum Computation with Postselection.

Seiichiro Tani

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

2021

Classically simulating quantum circuits with local depolarizing noise.

Yasuhiro Takahashi, Yuki Takeuchi, Seiichiro Tani

Theor. Comput. Sci., 2021

Power of uninitialized qubits in shallow quantum circuits.

Yasuhiro Takahashi, Seiichiro Tani

Theor. Comput. Sci., 2021

Computational self-testing for entangled magic states.

Akihiro Mizutani, Yuki Takeuchi, Ryo Hiromasa, Yusuke Aikawa, Seiichiro Tani

IACR Cryptol. ePrint Arch., 2021

2020

Quantum algorithm for the multicollision problem.

Akinori Hosoyamada, Yu Sasaki, Seiichiro Tani, Keita Xagawa

Theor. Comput. Sci., 2020

Efficiently generating ground states is hard for postselected quantum computation.

Yuki Takeuchi, Yasuhiro Takahashi, Seiichiro Tani

CoRR, 2020

Quantum Algorithm for Finding the Optimal Variable Ordering for Binary Decision Diagrams.

Seiichiro Tani

Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020

2019

Impossibility of blind quantum sampling for classical client.

Tomoyuki Morimae, Harumichi Nishimura, Yuki Takeuchi, Seiichiro Tani

Quantum Inf. Comput., 2019

2018

Improved Quantum Multicollision-Finding Algorithm.

Akinori Hosoyamada, Yu Sasaki, Seiichiro Tani, Keita Xagawa

IACR Cryptol. ePrint Arch., 2018

2017

A fast exact quantum algorithm for solitude verification.

Seiichiro Tani

Quantum Inf. Comput., 2017

2016

Quantum algorithms for finding constant-sized sub-hypergraphs.

François Le Gall, Harumichi Nishimura, Seiichiro Tani

Theor. Comput. Sci., 2016

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

Yasuhiro Takahashi, Seiichiro Tani, Takeshi Yamazaki, Kazuyuki Tanaka

Quantum Inf. Comput., 2016

Shallow Quantum Circuits with Uninitialized Ancillary Qubits.

Yasuhiro Takahashi, Seiichiro Tani

CoRR, 2016

Collapse of the Hierarchy of Constant-Depth Exact Quantum Circuits.

Yasuhiro Takahashi, Seiichiro Tani

Comput. Complex., 2016

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

Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond, Seiichiro Tani, Shigeru Yamashita

Comput. Complex., 2016

Power of Quantum Computation with Few Clean Qubits.

Keisuke Fujii, Hirotada Kobayashi, Tomoyuki Morimae, Harumichi Nishimura, Shuhei Tamate, Seiichiro Tani

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2014

Impossibility of Classically Simulating One-Clean-Qubit Computation.

Keisuke Fujii, Hirotada Kobayashi, Tomoyuki Morimae, Harumichi Nishimura, Shuhei Tamate, Seiichiro Tani

CoRR, 2014

Simpler Exact Leader Election via Quantum Reduction.

Hirotada Kobayashi, Keiji Matsumoto, Seiichiro Tani

Chic. J. Theor. Comput. Sci., 2014

2013

Quantum Algorithms for Finding Constant-sized Sub-hypergraphs over 3-uniform Hypergraphs.

François Le Gall, Harumichi Nishimura, Seiichiro Tani

CoRR, 2013

2012

Compression of View on Anonymous Networks - Folded View -.

Seiichiro Tani

IEEE Trans. Parallel Distributed Syst., 2012

Exact Quantum Algorithms for the Leader Election Problem.

Seiichiro Tani, Hirotada Kobayashi, Keiji Matsumoto

ACM Trans. Comput. Theory, 2012

Reconstructing Strings from Substrings with Quantum Queries.

Richard Cleve, Kazuo Iwama, François Le Gall, Harumichi Nishimura, Seiichiro Tani, Junichi Teruyama, Shigeru Yamashita

Proceedings of the Algorithm Theory - SWAT 2012, 2012

2011

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

Yasuhiro Takahashi, Seiichiro Tani

CoRR, 2011

The One-Way Communication Complexity of Subgroup Membership.

Scott Aaronson, François Le Gall, Alexander Russell, Seiichiro Tani

Chic. J. Theor. Comput. Sci., 2011

2010

Quantum addition circuits and unbounded fan-out.

Yasuhiro Takahashi, Seiichiro Tani, Noboru Kunihiro

Quantum Inf. Comput., 2010

The quantum query complexity of certification.

Andris Ambainis, Andrew M. Childs, François Le Gall, Seiichiro Tani

Quantum Inf. Comput., 2010

Computing on Anonymous Quantum Network

Hirotada Kobayashi, Keiji Matsumoto, Seiichiro Tani

CoRR, 2010

2009

Claw finding algorithms using quantum walk.

Seiichiro Tani

Theor. Comput. Sci., 2009

Multi-Party Quantum Communication Complexity with Routed Messages.

Seiichiro Tani, Masaki Nakanishi, Shigeru Yamashita

IEICE Trans. Inf. Syst., 2009

Foreword.

Seiichiro Tani

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2009

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

Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond, Seiichiro Tani, Shigeru Yamashita

CoRR, 2009

The One-Way Communication Complexity of Group Membership

Scott Aaronson, François Le Gall, Alexander Russell, Seiichiro Tani

CoRR, 2009

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

Hirotada Kobayashi, Keiji Matsumoto, Seiichiro Tani

Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

2008

Quantum Query Complexity of Boolean Functions with Small On-Sets.

Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond, Seiichiro Tani, Shigeru Yamashita

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

2007

An Improved Claw Finding Algorithm Using Quantum Walk.

Seiichiro Tani

Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

2005

Design and Implementation of Advanced Multicast Router Based on Cluster Computing.

Takeru Inoue, Seiichiro Tani, Hirokazu Takahashi, Toshiaki Miyazaki, Kan Toyoshima

Proceedings of the 11th International Conference on Parallel and Distributed Systems, 2005

2001

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

Seiichiro Tani, Toshiaki Miyazaki, Noriyuki Takahashi

Proceedings of the Active Networks, IFIP-TC6 Third International Working Conference, 2001

2000

Virtual BUS: A Network Technology for Setting up Distributed Resources in Your Own Computer.

Toshiaki Miyazaki, Atsushi Takahara, Shinya Ishihara, Seiichiro Tani, Takahiro Murooka, Tomoo Fukazawa, Mitsuo Teramoto, Kazuyoshi Matsuhiro

Proceedings of the 14th International Parallel & Distributed Processing Symposium (IPDPS'00), 2000

1999

Efficient Path Selection for Delay Testing Based on Path Clustering.

Seiichiro Tani, Mitsuo Teramoto, Tomoo Fukazawa, Kazuyoshi Matsuhiro

J. Electron. Test., 1999

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

Shinya Ishihara, Seiichiro Tani, Atsushi Takahara

Proceedings of the Recent Advances in Parallel Virtual Machine and Message Passing Interface, 1999

Virtual BUS: An Easy-to-Use Environment for Distributed Resources.

Atsushi Takahara, Seiichiro Tani, Shinya Ishihara, Toshiaki Miyazaki, Mitsuo Teramoto, Tomoo Fukazawa, Kazuyoshi Matsuhiro

Proceedings of the Proceedings 26th Conference on Local Computer Networks, 1999

1998

Efficient Path Selection for Delay Testing Based on Partial Path Evaluation.

Seiichiro Tani, Mitsuo Teramoto, Tomoo Fukazawa, Kazuyoshi Matsuhiro

Proceedings of the 16th IEEE VLSI Test Symposium (VTS '98), 28 April, 1998

1995

Computing the Tutte Polynomial of a Graph of Moderate Size.

Kyoko Sekine, Hiroshi Imai, Seiichiro Tani

Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

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

Kazuyoshi Hayase, Kunihiko Sadakane, Seiichiro Tani

Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1994

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

Seiichiro Tani, Hiroshi Imai

Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

1993

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

Seiichiro Tani, Kiyoharu Hamaguchi, Shuzo Yajima

Proceedings of the Algorithms and Computation, 4th International Symposium, 1993