scholarly journals The Quantum Adversary Method and Classical Formula Size Lower Bounds

Author(s):  
S. Laplante ◽  
T. Lee ◽  
M. Szegedy
2006 ◽  
Vol 15 (2) ◽  
pp. 163-196 ◽  
Author(s):  
Sophie Laplante ◽  
Troy Lee ◽  
Mario Szegedy

2018 ◽  
Vol 18 (3&4) ◽  
pp. 198-222
Author(s):  
Aleksandrs Belovs ◽  
Ansis Rosmanis

We prove tight \Omega(n^{1/3}) lower bounds on the quantum query complexity of the Collision and the Set Equality problems, provided that the size of the alphabet is large enough. We do this using the negative-weight adversary method. Thus, we reprove the result by Aaronson and Shi, as well as a more recent development by Zhandry.


Author(s):  
Parinya CHALERMSOOK ◽  
Hiroshi IMAI ◽  
Vorapong SUPPAKITPAISARN

2020 ◽  
Vol 148 (2) ◽  
pp. 321-327
Author(s):  
Rodolfo Gutiérrez-Romo ◽  
Carlos Matheus
Keyword(s):  

10.37236/1188 ◽  
1994 ◽  
Vol 1 (1) ◽  
Author(s):  
Geoffrey Exoo

For $k \geq 5$, we establish new lower bounds on the Schur numbers $S(k)$ and on the k-color Ramsey numbers of $K_3$.


Sign in / Sign up

Export Citation Format

Share Document