A note on quantum black-box complexity of almost all Boolean functions

DOI10.1016/S0020-0190(99)00079-4MaRDI QIDQ1606953zbMATH OpenOpenAlexFDO

Authors Andris Ambainis

Publication date 25 July 2002

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0190(99)00079-4

zbMATH Keywords

Boolean functions

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Quantum computation (81P68)

Cited in

(6)

• On fractional block sensitivity
• Extremal properties of polynomial threshold functions
• Unbounded-error quantum query complexity
• Quantum certificate complexity
• Quantum query complexity of almost all functions with fixed on-set size
• Complexity measures and decision tree complexity: a survey.

This page was built for publication: A note on quantum black-box complexity of almost all Boolean functions

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