Results 21 to 30 of about 33 (33)
Some of the next articles are maybe not open access.

Superlinear Advantage for Exact Quantum Algorithms

SIAM Journal on Computing, 2016
Andris Ambainis
exaly  

Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness

SIAM Journal on Computing, 2018
Mark Braverman   +2 more
exaly  

Search via Quantum Walk

SIAM Journal on Computing, 2011
Frédéric Magniez   +2 more
exaly  

Complexity Classification of Local Hamiltonian Problems

SIAM Journal on Computing, 2016
Toby S Cubitt, Ashley Montanaro
exaly  

Strong Direct Product Theorems for Quantum Communication and Query Complexity

SIAM Journal on Computing, 2012
Alexander A Sherstov
exaly  

Hidden Symmetry Subgroup Problems

SIAM Journal on Computing, 2013
Gabor Ivanyos   +2 more
exaly  

Forrelation: A Problem That Optimally Separates Quantum from Classical Computing

SIAM Journal on Computing, 2018
Scott Aaronson, Andris Ambainis
exaly  

Interpolating Parametrized Quantum Circuits Using Blackbox Queries

SIAM Journal of Scientific Computing
Manuel Radons
exaly  

Spectral Gap Amplification

SIAM Journal on Computing, 2013
exaly  

Home - About - Disclaimer - Privacy