$k$-Forrelation Optimally Separates Quantum and Classical Query Complexity

Nikhil Bansal, Makrand Sinha. $k$-Forrelation Optimally Separates Quantum and Classical Query Complexity. Electronic Colloquium on Computational Complexity (ECCC), 27:127, 2020. [doi]

Possibly Related Publications

The following publications are possibly variants of this publication: