Progress in quantum computing:Algorithms, communication, and applications March 2014 - February 2019
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
-
Rational approximations and quantum algorithms with postselection Article
Quantum Information and Computation, 15(3&4), 297-309.January 2014
-
Query complexity in expectation In Proceedings
January 2015
-
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
-
Is absolute separability determined by the partial transpose? Article
Quantum Information and Computation, 15(7&8), 694-720.S. Arunachalam (Srinivasan), N. Johnston and V. Russo (Vincent)
January 2015
-
Optimal quantum sample complexity of learning algorithms In Proceedings
July 2017 -
Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization Article
Mathematical Programming, 170(1), 5-42.S.J. Gribling (Sander), D. de Laat (David) and M. Laurent (Monique)
May 2018