scientific article; zbMATH DE number 1500513

MaRDI QIDQ4501528zbMATH OpenFDO

Authors Andris Ambainis, Ronald de Wolf

Publication date 4 September 2000

zbMATH Keywords

quantum query complexitiestotal Boolean functions

Mathematics Subject Classification ID

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

Recommendations

• Average-case quantum query complexity
• Average case quantum lower bounds for computing the Boolean mean
• Quantum lower bounds by polynomials
• Understanding quantum algorithms via query complexity
• Quantum Query Complexity of Boolean Functions with Small On-Sets

Cited in

(12)

• Almost-everywhere superiority for quantum polynomial time
• Quantum algorithms for variants of average-case lattice problems via filtering
• Average case quantum lower bounds for computing the Boolean mean
• Average-case quantum query complexity
• Beyond quadratic speedups in quantum attacks on symmetric schemes
• Quantum Queries on Permutations with a Promise
• The quantum query complexity of approximating the median and related statistics
• Understanding quantum algorithms via query complexity
• Complexity measures and decision tree complexity: a survey.
• Quantum queries on permutations
• Almost all decision trees do not allow significant quantum speed-up
• The quantum black-box complexity of majority

This page was built for publication:

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