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.

 

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

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