Quantum Computing: algorithms, proofs and tradeoffs December 2005 - November 2008
Collection
Collection
-
A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs In Proceedings
A. Ambainis (Andris), R. Spalek (Robert) and R.M. de Wolf (Ronald)
January 2006 -
Exponential Separations for One-Way Quantum Communication Complexity, with Applications to Cryptography In Proceedings
D. Gavinsky, J. Kempe, I. Kerenidis, R. Raz and R.M. de Wolf (Ronald)
January 2007
-
Quantum and classical strong direct product theorems and optimal time-space tradeoffs Article
SIAM Journal on Computing, 36(5), 1472-1493.H. Klauck (Hartmut), R. Spalek (Robert) and R.M. de Wolf (Ronald)
January 2007
-
On Computation and Communication with Small Bias In Proceedings
H.M. Buhrman (Harry), N.K. Vereshchagin (Nikolay Konstantinovich) and R.M. de Wolf (Ronald)
January 2007
-
Robust Polynomials and Quantum Algorithms Article
Theory of Computing Systems, 40(4), 379-395.H.M. Buhrman (Harry), I. Newman, H. Röhrig (Hein) and R.M. de Wolf (Ronald)
January 2007
-
Upper Bounds on the Noise Threshold for Fault-tolerant Quantum Computing In Proceedings
J. Kempe, O. Regev (Oded), F.P. Unger (Falk) and R.M. de Wolf (Ronald)
January 2008
-
A Hypercontractive Inequality for Matrix-Valued Functions with Applications to Quantum Computing and LDCs In Proceedings
January 2008
-
A note on quantum algorithms and the minimal degree of epsilon-error polynomials for symmetric functions Article
Quantum Information and Computation, 9(1), 943-950.January 2008