Results 21 to 30 of about 35 (35)
Some of the next articles are maybe not open access.
Superlinear Advantage for Exact Quantum Algorithms
SIAM Journal on Computing, 2016Andris Ambainis
exaly
Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness
SIAM Journal on Computing, 2018Jieming Mao +2 more
exaly
Complexity Classification of Local Hamiltonian Problems
SIAM Journal on Computing, 2016Ashley Montanaro, Toby Cubitt
exaly
Strong Direct Product Theorems for Quantum Communication and Query Complexity
SIAM Journal on Computing, 2012Alexander Sherstov
exaly

