Seiichiro Tani

77 papers A* 2A 4B 8C 2Misc 5Journal 50Unranked 6

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