Improved quantum query upper bounds based on classical decision trees

DOI10.4230/LIPICS.FSTTCS.2022.15MaRDI QIDQ6604618zbMATH OpenFDO

Authors Arjan Cornelissen, Nikhil S. Mande

Publication date 12 September 2024

Full work available at URL https://doi.org/10.4230/LIPICS.FSTTCS.2022.15

zbMATH Keywords

decision tree rankdecision treesquantum query complexity

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

Cited in

(2)

• On the communication complexity of finding a king in a tournament
• Lifting to randomized parity decision trees

This page was built for publication: Improved quantum query upper bounds based on classical decision trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6604618)