Characterization of exact two-query quantum algorithms

DOI10.1016/J.IC.2024.105166MaRDI QIDQ6543265zbMATH OpenFDO

Authors Shaoliang Ye, Wei Yang, Liusheng Huang

Publication date 24 May 2024

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.IC.2024.105166

zbMATH Keywords

Boolean functionexact query algorithmquantum query complexity

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A group algebraic approach to NPN classification of Boolean functions
• Complexity measures and decision tree complexity: a survey.
• Degree vs. approximate degree and Quantum implications of Huang’s sensitivity theorem
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• On exact quantum query complexity
• Quantum algorithms revisited
• Quantum lower bounds by polynomials
• Quantum Walk Algorithm for Element Distinctness

Cited in

(1)

• Sensitivity of symmetric Boolean functions

This page was built for publication: Characterization of exact two-query quantum algorithms

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