default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSeiichiro Tani
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c27]Ryo Hiromasa, Akihiro Mizutani, Yuki Takeuchi, Seiichiro Tani:
Rewindable Quantum Computation and Its Equivalence to Cloning and Adaptive Postselection. TQC 2023: 9:1-9:23- 2022
- [j21]Yuki Takeuchi
, Yasuhiro Takahashi, Tomoyuki Morimae, Seiichiro Tani:
Divide-and-conquer verification method for noisy intermediate-scale quantum computation. Quantum 6: 758 (2022) - [j20]Yuki Takeuchi, Tomoyuki Morimae, Seiichiro Tani:
Sumcheck-based delegation of quantum computing to rational server. Theor. Comput. Sci. 924: 46-67 (2022) - [c26]Seiichiro Tani:
Space-Bounded Unitary Quantum Computation with Postselection. MFCS 2022: 81:1-81:15 - [i25]Ryo Hiromasa, Akihiro Mizutani, Yuki Takeuchi, Seiichiro Tani:
Rewindable Quantum Computation and Its Equivalence to Cloning and Adaptive Postselection. CoRR abs/2206.05434 (2022) - [i24]Seiichiro Tani:
Space-Bounded Unitary Quantum Computation with Postselection. CoRR abs/2206.15122 (2022) - 2021
- [j19]Yasuhiro Takahashi, Seiichiro Tani:
Power of uninitialized qubits in shallow quantum circuits. Theor. Comput. Sci. 851: 129-153 (2021) - [j18]Yasuhiro Takahashi, Yuki Takeuchi, Seiichiro Tani:
Classically simulating quantum circuits with local depolarizing noise. Theor. Comput. Sci. 893: 117-132 (2021) - [i23]Akihiro Mizutani, Yuki Takeuchi, Ryo Hiromasa, Yusuke Aikawa, Seiichiro Tani:
Computational self-testing for entangled magic states. IACR Cryptol. ePrint Arch. 2021: 1473 (2021) - 2020
- [j17]Akinori Hosoyamada, Yu Sasaki, Seiichiro Tani, Keita Xagawa:
Quantum algorithm for the multicollision problem. Theor. Comput. Sci. 842: 100-117 (2020) - [c25]Yasuhiro Takahashi, Yuki Takeuchi, Seiichiro Tani:
Classically Simulating Quantum Circuits with Local Depolarizing Noise. MFCS 2020: 83:1-83:13 - [c24]Seiichiro Tani:
Quantum Algorithm for Finding the Optimal Variable Ordering for Binary Decision Diagrams. SWAT 2020: 36:1-36:19 - [c23]Yuki Takeuchi, Tomoyuki Morimae, Seiichiro Tani:
Sumcheck-Based Delegation of Quantum Computing to Rational Server. TAMC 2020: 69-81 - [i22]Yasuhiro Takahashi, Yuki Takeuchi, Seiichiro Tani:
Classically Simulating Quantum Circuits with Local Depolarizing Noise. CoRR abs/2001.08373 (2020) - [i21]Yuki Takeuchi, Yasuhiro Takahashi, Seiichiro Tani:
Efficiently generating ground states is hard for postselected quantum computation. CoRR abs/2006.12125 (2020)
2010 – 2019
- 2019
- [j16]Tomoyuki Morimae, Harumichi Nishimura, Yuki Takeuchi, Seiichiro Tani:
Impossibility of blind quantum sampling for classical client. Quantum Inf. Comput. 19(9&10): 793-806 (2019) - [c22]Akinori Hosoyamada, Yu Sasaki, Seiichiro Tani, Keita Xagawa:
Improved Quantum Multicollision-Finding Algorithm. PQCrypto 2019: 350-367 - [i20]Seiichiro Tani:
Quantum Algorithm for Finding the Optimal Variable Ordering for Binary Decision Diagrams. CoRR abs/1909.12658 (2019) - [i19]Akinori Hosoyamada, Yu Sasaki, Seiichiro Tani, Keita Xagawa:
Quantum Algorithm for the Multicollision Problem. CoRR abs/1911.02822 (2019) - [i18]Yuki Takeuchi, Tomoyuki Morimae, Seiichiro Tani:
Sumcheck-based delegation of quantum computing to rational server. CoRR abs/1911.04734 (2019) - 2018
- [c21]Yasuhiro Takahashi, Seiichiro Tani:
Power of Uninitialized Qubits in Shallow Quantum Circuits. STACS 2018: 57:1-57:13 - [i17]Akinori Hosoyamada, Yu Sasaki, Seiichiro Tani, Keita Xagawa:
Improved Quantum Multicollision-Finding Algorithm. CoRR abs/1811.08097 (2018) - [i16]Tomoyuki Morimae, Harumichi Nishimura, Yuki Takeuchi, Seiichiro Tani:
Impossibility of blind quantum sampling for classical client. CoRR abs/1812.03703 (2018) - [i15]Akinori Hosoyamada, Yu Sasaki, Seiichiro Tani, Keita Xagawa:
Improved Quantum Multicollision-Finding Algorithm. IACR Cryptol. ePrint Arch. 2018: 1122 (2018) - 2017
- [j15]Seiichiro Tani:
A fast exact quantum algorithm for solitude verification. Quantum Inf. Comput. 17(1&2): 15-40 (2017) - 2016
- [j14]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): 723-735 (2016) - [j13]Yasuhiro Takahashi, Seiichiro Tani:
Collapse of the Hierarchy of Constant-Depth Exact Quantum Circuits. Comput. Complex. 25(4): 849-881 (2016) - [j12]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): 251-270 (2016) - [j11]François Le Gall, Harumichi Nishimura, Seiichiro Tani:
Quantum algorithms for finding constant-sized sub-hypergraphs. Theor. Comput. Sci. 609: 569-582 (2016) - [c20]Keisuke Fujii, Hirotada Kobayashi, Tomoyuki Morimae, Harumichi Nishimura, Shuhei Tamate, Seiichiro Tani:
Power of Quantum Computation with Few Clean Qubits. ICALP 2016: 13:1-13:14 - [i14]Yasuhiro Takahashi, Seiichiro Tani:
Shallow Quantum Circuits with Uninitialized Ancillary Qubits. CoRR abs/1608.07020 (2016) - [i13]Seiichiro Tani:
A Fast Exact Quantum Algorithm for Solitude Verification. CoRR abs/1612.05317 (2016) - 2015
- [c19]Yasuhiro Takahashi, Seiichiro Tani, Takeshi Yamazaki, Kazuyuki Tanaka:
Commuting Quantum Circuits with Few Outputs are Unlikely to be Classically Simulatable. COCOON 2015: 223-234 - [i12]Keisuke Fujii, Hirotada Kobayashi, Tomoyuki Morimae, Harumichi Nishimura, Shuhei Tamate, Seiichiro Tani:
Power of Quantum Computation with Few Clean Qubits. CoRR abs/1509.07276 (2015) - 2014
- [j10]Hirotada Kobayashi, Keiji Matsumoto, Seiichiro Tani:
Simpler Exact Leader Election via Quantum Reduction. Chic. J. Theor. Comput. Sci. 2014 (2014) - [c18]François Le Gall, Harumichi Nishimura, Seiichiro Tani:
Quantum Algorithms for Finding Constant-Sized Sub-hypergraphs. COCOON 2014: 429-440 - [i11]Keisuke Fujii, Hirotada Kobayashi, Tomoyuki Morimae, Harumichi Nishimura, Shuhei Tamate, Seiichiro Tani:
Impossibility of Classically Simulating One-Clean-Qubit Computation. CoRR abs/1409.6777 (2014) - [i10]Yasuhiro Takahashi, Seiichiro Tani, Takeshi Yamazaki, Kazuyuki Tanaka:
Commuting Quantum Circuits with Few Outputs are Unlikely to be Classically Simulatable. CoRR abs/1409.6792 (2014) - 2013
- [c17]Yasuhiro Takahashi, Seiichiro Tani:
Collapse of the Hierarchy of Constant-Depth Exact Quantum Circuits. CCC 2013: 168-178 - [i9]François Le Gall, Harumichi Nishimura, Seiichiro Tani:
Quantum Algorithms for Finding Constant-sized Sub-hypergraphs over 3-uniform Hypergraphs. CoRR abs/1310.4127 (2013) - 2012
- [j9]Seiichiro Tani, Hirotada Kobayashi, Keiji Matsumoto:
Exact Quantum Algorithms for the Leader Election Problem. ACM Trans. Comput. Theory 4(1): 1:1-1:24 (2012) - [j8]Seiichiro Tani:
Compression of View on Anonymous Networks - Folded View -. IEEE Trans. Parallel Distributed Syst. 23(2): 255-262 (2012) - [c16]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: 388-397 - [i8]Richard Cleve, Kazuo Iwama, François Le Gall, Harumichi Nishimura, Seiichiro Tani, Junichi Teruyama, Shigeru Yamashita:
Reconstructing Strings from Substrings with Quantum Queries. CoRR abs/1204.4691 (2012) - 2011
- [j7]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) - [i7]Yasuhiro Takahashi, Seiichiro Tani:
Constant-Depth Exact Quantum Circuits for the OR and Threshold Functions. CoRR abs/1112.6063 (2011) - 2010
- [j6]Andris Ambainis, Andrew M. Childs, François Le Gall, Seiichiro Tani:
The quantum query complexity of certification. Quantum Inf. Comput. 10(3&4): 181-189 (2010) - [j5]Yasuhiro Takahashi, Seiichiro Tani, Noboru Kunihiro:
Quantum addition circuits and unbounded fan-out. Quantum Inf. Comput. 10(9&10): 872-890 (2010) - [i6]Hirotada Kobayashi, Keiji Matsumoto, Seiichiro Tani:
Computing on Anonymous Quantum Network. CoRR abs/1001.5307 (2010)
2000 – 2009
- 2009
- [j4]Seiichiro Tani, Masaki Nakanishi, Shigeru Yamashita:
Multi-Party Quantum Communication Complexity with Routed Messages. IEICE Trans. Inf. Syst. 92-D(2): 191-199 (2009) - [j3]Seiichiro Tani:
Foreword. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(5): 1253 (2009) - [j2]Seiichiro Tani:
Claw finding algorithms using quantum walk. Theor. Comput. Sci. 410(50): 5285-5297 (2009) - [c15]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: 334-335 - [i5]Scott Aaronson, François Le Gall, Alexander Russell, Seiichiro Tani:
The One-Way Communication Complexity of Group Membership. CoRR abs/0902.3175 (2009) - [i4]Andris Ambainis, Andrew M. Childs, François Le Gall, Seiichiro Tani:
The quantum query complexity of certification. CoRR abs/0903.1291 (2009) - [i3]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 abs/0908.2468 (2009) - 2008
- [c14]Seiichiro Tani, Masaki Nakanishi, Shigeru Yamashita:
Multi-party Quantum Communication Complexity with Routed Messages. COCOON 2008: 180-190 - [c13]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: 907-918 - 2007
- [c12]Seiichiro Tani:
An Improved Claw Finding Algorithm Using Quantum Walk. MFCS 2007: 536-547 - [i2]Seiichiro Tani:
Claw Finding Algorithms Using Quantum Walk. CoRR abs/0708.2584 (2007) - [i1]Seiichiro Tani, Hirotada Kobayashi, Keiji Matsumoto:
Exact Quantum Algorithms for the Leader Election Problem. CoRR abs/0712.4213 (2007) - 2005
- [c11]Takeru Inoue, Seiichiro Tani, Hirokazu Takahashi, Toshiaki Miyazaki, Kan Toyoshima:
Design and Implementation of Advanced Multicast Router Based on Cluster Computing. ICPADS (1) 2005: 328-335 - [c10]Seiichiro Tani, Hirotada Kobayashi, Keiji Matsumoto:
Exact Quantum Algorithms for the Leader Election Problem. STACS 2005: 581-592 - 2001
- [c9]Seiichiro Tani, Toshiaki Miyazaki, Noriyuki Takahashi:
Adaptive Stream Multicast Based on IP Unicast and Dynamic Commercial Attachment Mechanism: An Active Network Implementation. IWAN 2001: 116-133 - 2000
- [c8]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: 535-540
1990 – 1999
- 1999
- [j1]Seiichiro Tani, Mitsuo Teramoto, Tomoo Fukazawa, Kazuyoshi Matsuhiro:
Efficient Path Selection for Delay Testing Based on Path Clustering. J. Electron. Test. 15(1-2): 75-85 (1999) - [c7]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: 62-70 - [c6]Shinya Ishihara, Seiichiro Tani, Atsushi Takahara:
Virtual BUS: A Simple Implementation of an Effortless Networking System Based on PVM. PVM/MPI 1999: 461-468 - 1998
- [c5]Seiichiro Tani, Mitsuo Teramoto, Tomoo Fukazawa, Kazuyoshi Matsuhiro:
Efficient Path Selection for Delay Testing Based on Partial Path Evaluation. VTS 1998: 188-193 - 1995
- [c4]Kazuyoshi Hayase, Kunihiko Sadakane, Seiichiro Tani:
Output-size Sensitiveness of OBDD Construction Through Maximal Independent Set Problem. COCOON 1995: 229-234 - [c3]Kyoko Sekine, Hiroshi Imai, Seiichiro Tani:
Computing the Tutte Polynomial of a Graph of Moderate Size. ISAAC 1995: 224-233 - 1994
- [c2]Seiichiro Tani, Hiroshi Imai:
A Reordering Operation for an Ordered Binary Decision Diagram and an Extended Framework for Combinatorics of Graphs. ISAAC 1994: 575-583 - 1993
- [c1]Seiichiro Tani, Kiyoharu Hamaguchi, Shuzo Yajima:
The Complexity of the Optimal Variable Ordering Problems of Shared Binary Decision Diagrams. ISAAC 1993: 389-398
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
