Quantum adversary (upper) bound

DOI10.1007/978-3-642-31594-7_47MaRDI QIDQ2843280zbMATH OpenOpenAlexFDO

Authors Shelby Kimmel

Publication date 12 August 2013

Published in Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-31594-7_47

zbMATH Keywords

quantum algorithmquantum Haar transformquantum query complexity

Mathematics Subject Classification ID

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

Recommendations

• Quantum adversary (upper) bound
• Quantum lower bounds by quantum arguments
• Adversary lower bounds for nonadaptive quantum algorithms
• Quantum lower bounds by quantum arguments
• Reflections for quantum query algorithms

Cited in

(10)

• The quantum adversary method and classical formula size power bounds
• scientific article; zbMATH DE number 5899240 (Why is no real title available?)
• The quantum query complexity of certification
• Upper bounds on quantum query complexity inspired by the Elitzur-Vaidman bomb tester
• A universal adiabatic quantum query algorithm
• Reflections for quantum query algorithms
• Quantum adversary (upper) bound
• Quantum bounds for 2D-grid and Dyck language
• Symmetries, graph properties, and quantum speedups
• Adversary lower bounds for nonadaptive quantum algorithms

This page was built for publication: Quantum adversary (upper) bound

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