$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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.