An Optimal Separation of Randomized and Quantum Query Complexity

Alexander A. Sherstov, Andrey A. Storozhenko, Pei Wu. An Optimal Separation of Randomized and Quantum Query Complexity. Electronic Colloquium on Computational Complexity (ECCC), 27:128, 2020. [doi]

@article{SherstovSW20,
  title = {An Optimal Separation of Randomized and Quantum Query Complexity},
  author = {Alexander A. Sherstov and Andrey A. Storozhenko and Pei Wu},
  year = {2020},
  url = {https://eccc.weizmann.ac.il/report/2020/128},
  researchr = {https://researchr.org/publication/SherstovSW20},
  cites = {0},
  citedby = {0},
  journal = {Electronic Colloquium on Computational Complexity (ECCC)},
  volume = {27},
  pages = {128},
}