Nikhil Bansal, Makrand Sinha. $k$-Forrelation Optimally Separates Quantum and Classical Query Complexity. Electronic Colloquium on Computational Complexity (ECCC), 27:127, 2020. [doi]
@article{BansalS20-2,
title = {$k$-Forrelation Optimally Separates Quantum and Classical Query Complexity},
author = {Nikhil Bansal and Makrand Sinha},
year = {2020},
url = {https://eccc.weizmann.ac.il/report/2020/127},
researchr = {https://researchr.org/publication/BansalS20-2},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {27},
pages = {127},
}