( en | de | ru )

 

Disambiguation of "Tani, Seiichiro"

Author of the publication

copydeleteadd this publication to your clipboard
Power of Quantum Computation with Few Clean Qubits.

, , , , , and . ICALP, volume 55 of LIPIcs, page 13:1-13:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)

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.

Roman Taniel

Yasaburo Taniguchi

Roman Taniel

Nobuko Tanimura

Mouham Tanimou

 

Other publications of authors with the same name

The quantum query complexity of certification, , , and . CoRR, (2009)Commuting Quantum Circuits with Few Outputs are Unlikely to be Classically Simulatable., , , and . COCOON, volume 9198 of Lecture Notes in Computer Science, page 223-234. Springer, (2015)Reconstructing Strings from Substrings with Quantum Queries., , , , , , and . SWAT, volume 7357 of Lecture Notes in Computer Science, page 388-397. Springer, (2012)Quantum algorithm for the multicollision problem., , , and . Theor. Comput. Sci., (2020)Sumcheck-Based Delegation of Quantum Computing to Rational Server., , and . TAMC, volume 12337 of Lecture Notes in Computer Science, page 69-81. Springer, (2020)Power of Quantum Computation with Few Clean Qubits., , , , , and . CoRR, (2015)Compression of View on Anonymous Networks - Folded View -.. IEEE Trans. Parallel Distributed Syst., 23 (2): 255-262 (2012)A fast exact quantum algorithm for solitude verification.. Quantum Inf. Comput., 17 (1&2): 15-40 (2017)The quantum query complexity of certification., , , and . Quantum Inf. Comput., 10 (3&4): 181-189 (2010)Quantum algorithms for finding constant-sized sub-hypergraphs., , and . Theor. Comput. Sci., (2016)