( en | de | ru )

 

Disambiguation of "Nishimura, Harumichi"

Author of the publication

copydeleteadd this publication to your clipboard
Interactive proofs with quantum finite automata.

, and . Theor. Comput. Sci., (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Kumi Nishimura

Masanobu Nishimura

Masanobu Nishimura

Tsuneko Nishimura

 

Other publications of authors with the same name

Quantum Minimal One Way Information: Relative Hardness and Quantum Advantage of Combinatorial Tasks, and . CoRR, (2005)Quantum Algorithms for Finding Constant-sized Sub-hypergraphs over 3-uniform Hypergraphs., , and . CoRR, (2013)Quantum Random Access Coding., and . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 92-A (5): 1268-1275 (2009)Quantum counterfeit coin problems., , , and . Theor. Comput. Sci., (2012)Computational Indistinguishability between Quantum States and Its Cryptographic Application., , , and . IACR Cryptology ePrint Archive, (2006)Impossibility of blind quantum sampling for classical client., , , and . CoRR, (2018)Quantum network coding - How can network coding be applied to quantum information?. NetCod, page 1-5. IEEE, (2013)Quantum Query Complexity of Boolean Functions with Small On-Sets., , , , , , and . ISAAC, volume 5369 of Lecture Notes in Computer Science, page 907-918. Springer, (2008)Quantum Logarithmic Space and Post-Selection., , and . TQC, volume 197 of LIPIcs, page 10:1-10:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Quantum Network Coding., , , , and . Complexity of Boolean Functions, volume 06111 of Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, (2006)