Quantum query algorithms and lower bounds

Author(s):  
Andris Ambainis
2019 ◽  
Vol 48 (3) ◽  
pp. 903-925 ◽  
Author(s):  
Srinivasan Arunachalam ◽  
Jop Briët ◽  
Carlos Palazuelos

Algorithmica ◽  
2015 ◽  
Vol 77 (2) ◽  
pp. 459-486 ◽  
Author(s):  
Troy Lee ◽  
Frédéric Magniez ◽  
Miklos Santha

2014 ◽  
Vol 43 (3) ◽  
pp. 1206-1219 ◽  
Author(s):  
Ben W. Reichardt

2018 ◽  
Vol 18 (15&16) ◽  
pp. 1332-1349
Author(s):  
Ehsan Ebrahimi ◽  
Dominique Unruh

We study the quantum query complexity of finding a collision for a function f whose outputs are chosen according to a non-uniform distribution D. We derive some upper bounds and lower bounds depending on the min-entropy and the collision-entropy of D. In particular, we improve the previous lower bound by Ebrahimi Targhi et al. from \Omega(2^{k/9}) to \Omega(2^{k/5}) where k is the min-entropy of D.


2008 ◽  
Vol 38 (1) ◽  
pp. 46-62 ◽  
Author(s):  
Sophie Laplante ◽  
Frédéric Magniez

Author(s):  
Stacey Jeffery ◽  
Frederic Magniez ◽  
Ronald de Wolf

Sign in / Sign up

Export Citation Format

Share Document