Publication
-
January 2012
-
How low can approximate degree and quantum query complexity be for total Boolean functions? Tech Report
January 2012 -
January 2012
-
Fooling one-sided quantum protocols Tech Report
January 2012 -
January 2012
-
Near-optimal and explicit Bell inequality violations Article
Theory of Computing, 8(27), 623-645.January 2012
-
January 2012
-
Complete Insecurity of Quantum Protocols for Classical Two-Party Computation Article
Physical Review LettersJanuary 2012