Nonadaptive quantum query complexity

DOI10.1016/j.ipl.2010.09.009zbMath1379.68135arXiv1001.0018OpenAlexW2133905777WikidataQ58478286 ScholiaQ58478286MaRDI QIDQ1675876

Ashley Montanaro

Publication date: 3 November 2017

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

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

zbMATH Keywords

quantum computingtheory of computationquantum query complexitydecision tree complexity

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (5)

Optimal parallel quantum query algorithms ⋮ Quantum Query Algorithms are Completely Bounded Forms. ⋮ Quantum Query Algorithms Are Completely Bounded Forms ⋮ On exact quantum query complexity ⋮ Quantum algorithms for learning symmetric juntas via the adversary bound

Cites Work

• Unnamed Item
• Complexity measures and decision tree complexity: a survey.
• Queries and concept learning
• Polynomial degree vs. quantum query complexity
• Adversary Lower Bounds for Nonadaptive Quantum Algorithms
• On the Power of Quantum Computation
• Quantum Complexity Theory
• Mathematical Foundations of Computer Science 2004
• Quantum lower bounds by polynomials

This page was built for publication: Nonadaptive quantum query complexity