k-forrelation optimally separates Quantum and classical query complexity. Bansal, N. & Sinha, M. In Khuller, S. & Williams, V. V., editors, STOC, pages 1303-1316, 2021. ACM.
k-forrelation optimally separates Quantum and classical query complexity. [link]Link  k-forrelation optimally separates Quantum and classical query complexity. [link]Paper  bibtex   
@inproceedings{conf/stoc/BansalS21,
  added-at = {2025-01-19T00:00:00.000+0100},
  author = {Bansal, Nikhil and Sinha, Makrand},
  biburl = {https://www.bibsonomy.org/bibtex/227c4e1695e8d97e9a0916018d77458ce/dblp},
  booktitle = {STOC},
  crossref = {conf/stoc/2021},
  editor = {Khuller, Samir and Williams, Virginia Vassilevska},
  ee = {https://www.wikidata.org/entity/Q130912987},
  interhash = {cdd578c8407d1512d240bec635b3cfaa},
  intrahash = {27c4e1695e8d97e9a0916018d77458ce},
  isbn = {978-1-4503-8053-9},
  keywords = {dblp},
  pages = {1303-1316},
  publisher = {ACM},
  timestamp = {2025-01-27T10:49:35.000+0100},
  title = {k-forrelation optimally separates Quantum and classical query complexity.},
  url = {http://dblp.uni-trier.de/db/conf/stoc/stoc2021.html#BansalS21},
  year = 2021
}

Downloads: 0