Quantum Computing: algorithms, proofs and tradeoffs December 2005 - November 2008
Collection
Collection
-
A Brief Introduction to Fourier Analysis on the Boolean Cube Article
ACM Computers in Entertainment, 6(1), 1-10.September 2008
-
Near-optimal and explicit Bell inequality violations Article
Theory of Computing, 8(27), 623-645.H.M. Buhrman (Harry), O. Regev (Oded), G. Scarpa (Giannicola) and R.M. de Wolf (Ronald)
January 2012
-
Optimal quantum query bounds for almost all Boolean functions Tech Report
A. Ambainis (Andris), A. Backurs, J. Smotrovs (Juris) and R.M. de Wolf (Ronald)
January 2012 -
How low can approximate degree and quantum query complexity be for total Boolean functions? Tech Report
January 2012 -
The non-adaptive query complexity of testing k-parities Tech Report
H.M. Buhrman (Harry), D. Garcia Soriano (David), A. Matsliah (Arie) and R.M. de Wolf (Ronald)
January 2012