Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: Seiichiro
    Last name: Tani
    DBLP: 42/1198
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 1 to 25 of 50  
    Select a publication
    Show Title Venue Rating Date
    Journal article
    Seiichiro Tani.
    A fast exact quantum algorithm for solitude verification.
    Quantum Information Computation 2017, Volume 17 (0) 2017
    Journal article
    François Le Gall, Harumichi Nishimura, Seiichiro Tani.
    Quantum algorithms for finding constant-sized sub-hypergraphs.
    Theor. Comput. Sci. 2016, Volume 609 (0) 2016
    Conference paper
    Yasuhiro Takahashi, Seiichiro Tani, Takeshi Yamazaki, Kazuyuki Tanaka.
    Commuting quantum circuits with few outputs are unlikely to be classically simulatable.
    Quantum Information Computation 2016, Volume 16 (0) 2016
    Conference paper
    Keisuke Fujii, Hirotada Kobayashi, Tomoyuki Morimae, Harumichi Nishimura, Shuhei Tamate, Seiichiro Tani.
    Power of Quantum Computation with Few Clean Qubits.
    43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy 2016 (0) 2016
    Journal article
    Yasuhiro Takahashi, Seiichiro Tani.
    Shallow Quantum Circuits with Uninitialized Ancillary Qubits.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Raymond H. Putra, Seiichiro Tani, Shigeru Yamashita.
    Quantum Query Complexity of Almost All Functions with Fixed On-set Size.
    Computational Complexity 2016, Volume 25 (0) 2016
    Conference paper
    Yasuhiro Takahashi, Seiichiro Tani.
    Collapse of the Hierarchy of Constant-Depth Exact Quantum Circuits.
    Computational Complexity 2016, Volume 25 (0) 2016
    Journal article
    Seiichiro Tani.
    A Fast Exact Quantum Algorithm for Solitude Verification.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Hirotada Kobayashi, Keiji Matsumoto, Seiichiro Tani.
    Simpler Exact Leader Election via Quantum Reduction.
    Chicago J. Theor. Comput. Sci. 2015, Volume 2015 (0) 2015
    Conference paper
    Yasuhiro Takahashi, Seiichiro Tani, Takeshi Yamazaki, Kazuyuki Tanaka.
    Commuting Quantum Circuits with Few Outputs are Unlikely to be Classically Simulatable.
    Computing and Combinatorics - 21st International Conference, COCOON 2015, Beijing, China, August 4-6, 2015, Proceedings 2015 (0) 2015
    Journal article
    Keisuke Fujii, Hirotada Kobayashi, Tomoyuki Morimae, Harumichi Nishimura, Shuhei Tamate, Seiichiro Tani.
    Power of Quantum Computation with Few Clean Qubits.
    CoRR 2015, Volume 0 (0) 2015
    Conference paper
    François Le Gall, Harumichi Nishimura, Seiichiro Tani.
    Quantum Algorithms for Finding Constant-Sized Sub-hypergraphs.
    Computing and Combinatorics - 20th International Conference, COCOON 2014, Atlanta, GA, USA, August 4-6, 2014. Proceedings 2014 (0) 2014
    Journal article
    Yasuhiro Takahashi, Seiichiro Tani, Takeshi Yamazaki, Kazuyuki Tanaka.
    Commuting Quantum Circuits with Few Outputs are Unlikely to be Classically Simulatable.
    CoRR 2014, Volume 0 (0) 2014
    Conference paper
    Hirotada Kobayashi, Keiji Matsumoto, Seiichiro Tani.
    Simpler Exact Leader Election via Quantum Reduction.
    Chicago J. Theor. Comput. Sci. 2014, Volume 2014 (0) 2014
    Conference paper
    Keisuke Fujii, Hirotada Kobayashi, Tomoyuki Morimae, Harumichi Nishimura, Shuhei Tamate, Seiichiro Tani.
    Impossibility of Classically Simulating One-Clean-Qubit Computation.
    CoRR 2014, Volume 0 (0) 2014
    Journal article
    François Le Gall, Harumichi Nishimura, Seiichiro Tani.
    Quantum Algorithms for Finding Constant-sized Sub-hypergraphs over 3-uniform Hypergraphs.
    CoRR 2013, Volume 0 (0) 2013
    Conference paper
    Yasuhiro Takahashi, Seiichiro Tani.
    Collapse of the Hierarchy of Constant-Depth Exact Quantum Circuits.
    Proceedings of the 28th Conference on Computational Complexity, CCC 2013, K.lo Alto, California, USA, 5-7 June, 2013 2013 (0) 2013
    Conference paper
    Seiichiro Tani.
    Compression of View on Anonymous Networks - Folded View -.
    IEEE Trans. Parallel Distrib. Syst. 2012, Volume 23 (0) 2012
    Journal article
    Seiichiro Tani, Hirotada Kobayashi, Keiji Matsumoto.
    Exact Quantum Algorithms for the Leader Election Problem.
    TOCT 2012, Volume 4 (0) 2012
    Conference paper
    Richard Cleve, Kazuo Iwama, François Le Gall, Harumichi Nishimura, Seiichiro Tani, Junichi Teruyama, Shigeru Yamashita.
    Reconstructing Strings from Substrings with Quantum Queries.
    Algorithm Theory - SWAT 2012 - 13th Scandinavian Symposium and Workshops, Helsinki, Finland, July 4-6, 2012. Proceedings 2012 (0) 2012
    Conference paper
    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, Volume 0 (0) 2012
    Journal article
    Scott Aaronson, François Le Gall, Alexander Russell, Seiichiro Tani.
    The One-Way Communication Complexity of Subgroup Membership.
    Chicago J. Theor. Comput. Sci. 2011, Volume 2011 (0) 2011
    Conference paper
    Yasuhiro Takahashi, Seiichiro Tani.
    Constant-Depth Exact Quantum Circuits for the OR and Threshold Functions
    CoRR 2011, Volume 0 (0) 2011
    Journal article
    Yasuhiro Takahashi, Seiichiro Tani, Noboru Kunihiro.
    Quantum addition circuits and unbounded fan-out.
    Quantum Information Computation 2010, Volume 10 (0) 2010
    Conference paper
    Andris Ambainis, Andrew M. Childs, François Le Gall, Seiichiro Tani.
    The quantum query complexity of certification.
    Quantum Information Computation 2010, Volume 10 (0) 2010
    Show item 1 to 25 of 50  

    Your query returned 50 matches in the database.