From post

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.

 

Другие публикации лиц с тем же именем

On the quantum hardness of solving isomorphism problems as nonabelian hidden shift problems., и . Quantum Inf. Comput., 7 (5): 504-521 (2007)Optimal Quantum Adversary Lower Bounds for Ordered Search., и . ICALP (1), том 5125 из Lecture Notes in Computer Science, стр. 869-880. Springer, (2008)Quantum Property Testing for Bounded-Degree Graphs., , и . APPROX-RANDOM, том 6845 из Lecture Notes in Computer Science, стр. 365-376. Springer, (2011)Symmetries, Graph Properties, and Quantum Speedups., , , , , и . FOCS, стр. 649-660. IEEE, (2020)Quantum Query Complexity with Matrix-Vector Products., , и . ICALP, том 198 из LIPIcs, стр. 55:1-55:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)High-precision quantum algorithms for partial differential equations., , и . CoRR, (2020)Black-box hamiltonian simulation and unitary implementation., и . Quantum Inf. Comput., 12 (1-2): 29-62 (2012)Hamiltonian simulation using linear combinations of unitary operations., и . Quantum Inf. Comput., 12 (11-12): 901-924 (2012)Discrete-Query Quantum Algorithm for NAND Trees., , , и . Theory Comput., 5 (1): 119-123 (2009)Universal Computation by Quantum Walk. Phys. Rev. Lett., (мая 2009)