k-forrelation optimally separates Quantum and classical query complexity

DOI10.1145/3406325.3451040arXiv2008.07003WikidataQ130912987 ScholiaQ130912987MaRDI QIDQ6065254

Nikhil Bansal, Makrand Sinha

Publication date: 14 November 2023

Published in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2008.07003

zbMATH Keywords

stochastic calculusdecision treesquantum query complexityGaussian interpolationforrelation

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

Beyond quadratic speedups in quantum attacks on symmetric schemes ⋮ Following forrelation -- quantum algorithms in exploring Boolean functions' spectra

This page was built for publication: k-forrelation optimally separates Quantum and classical query complexity