Quantum Algorithmics May 2013 - April 2016
Collection
Collection
-
Optimal parallel quantum query algorithms In Proceedings
January 2014
-
How low can approximate degree and quantum query complexity be for total Boolean functions? Article
Computational Complexity, 23(2), 305-322.January 2014
-
Quantum linear network coding as one-way quantum computation In Proceedings
January 2014
-
January 2014
-
Exponential Lower Bounds for Polytopes in Combinatorial Optimization Article
Journal of the ACM, 62(2), 1-23.S. Fiorini, S. Massar (Serge), S. Pokutta (Sebastian), H.R. Tiwary and R.M. de Wolf (Ronald)
January 2015
-
Query complexity in expectation In Proceedings
January 2015