Author of the publication

Efficient Quantum Tensor Product Expanders and k-Designs.

, and . APPROX-RANDOM, volume 5687 of Lecture Notes in Computer Science, page 548-561. Springer, (2009)

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

The quantum Schur and Clebsch-Gordan transforms: I. efficient qudit circuits., , and . SODA, page 1235-1244. SIAM, (2007)Quantum computational supremacy, and . Nature, 549 (7671): 203--209 (September 2017)Adversarial hypothesis testing and a quantum stein's lemma for restricted measurements., , , and . ITCS, page 183-194. ACM, (2014)Algorithms, Bounds, and Strategies for Entangled XOR Games., , , and . ITCS, volume 124 of LIPIcs, page 10:1-10:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Efficient Quantum Tensor Product Expanders and k-Designs., and . APPROX-RANDOM, volume 5687 of Lecture Notes in Computer Science, page 548-561. Springer, (2009)Quantum de finetti theorems under local measurements with applications., and . STOC, page 861-870. ACM, (2013)Simulated Quaotum Annealing Can Be Exponentially Faster Than Classical Simulated Annealing., and . FOCS, page 714-723. IEEE Computer Society, (2016)Superpolynomial Speedups Based on Almost Any Quantum Circuit., and . ICALP (1), volume 5125 of Lecture Notes in Computer Science, page 782-795. Springer, (2008)Local Tests of Global Entanglement and a Counterexample to the Generalized Area Law., , , , , and . FOCS, page 246-255. IEEE Computer Society, (2014)Quantum Algorithm for Linear Systems of Equations, , and . Physical Review Letters, 103 (15): 150502+ (October 2009)