Author of the publication

From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups.

, , and . FOCS, page 469-478. IEEE Computer Society, (2005)

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.

 

Other publications of authors with the same name

Quantum algorithms for some hidden shift problems., , and . SODA, page 489-498. ACM/SIAM, (2003)Two-qubit Stabilizer Circuits with Recovery I: Existence., and . TQC, volume 111 of LIPIcs, page 7:1-7:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups., , and . FOCS, page 469-478. IEEE Computer Society, (2005)Quantum Entanglement and the Communication Complexity of the Inner Product Function., , , and . QCQC, volume 1509 of Lecture Notes in Computer Science, page 61-74. Springer, (1998)The statistical strength of nonlocality proofs., , and . IEEE Trans. Inf. Theory, 51 (8): 2812-2835 (2005)Optimal Quantum Algorithm for Polynomial Interpolation., , , and . ICALP, volume 55 of LIPIcs, page 16:1-16:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates, , , and . CoRR, (1999)Classical and Quantum Algorithms for Exponential Congruences., and . TQC, volume 5106 of Lecture Notes in Computer Science, page 1-10. Springer, (2008)Recent Progress in Quantum Algorithms, and . Commun. ACM, 53 (2): 84--93 (February 2010)How Powerful is Adiabatic Quantum Computation?., , and . FOCS, page 279-287. IEEE Computer Society, (2001)