Quantum computing: fault-tolerance, communication, and classical spin-offs December 2008 - February 2014
Collection
Collection
-
New Results on Quantum Property Testing In Proceedings
S. Chakraborty (Sourav), E. Fischer, A. Matsliah (Arie) and R.M. de Wolf (Ronald)
January 2010 -
Near-optimal and explicit Bell inequality violations In Proceedings
H.M. Buhrman (Harry), O. Regev (Oded), G. Scarpa (Giannicola) and R.M. de Wolf (Ronald)
January 2011 -
Quantum proofs for classical theorems Article
Theory of ComputingJanuary 2011
-
Uniform approximation by (quantum) polynomials Article
International Journal of Quantum Information, 11(3-4), 215-225.January 2011 -
New bounds on the classical and quantum communication complexity of some graph properties In Proceedings
G. Ivanyos, H. Klauck (Hartmut), T. J. Lee (Troy), M. Santha (Miklos) and R.M. de Wolf (Ronald)
January 2012
-
Linear vs semidefinite extended formulations: Exponential separation and strong lower bounds In Proceedings
S. Fiorini, S. Massar (Serge), S. Pokutta (Sebastian), H.R. Tiwary and R.M. de Wolf (Ronald)
January 2012 -
The power of noisy fermionic quantum computation Tech Report
F. de Melo (Fernando), P. Cwiklinski and B.M. Terhal (Barbara)
January 2012 -
Matrices if fidelities for ensembles of quantum states and the Holevo quantity Article
Quantum Information and Computation, 12(5/6)January 2012