All quantum adversary methods are equivalent

DOI10.1007/11523468_105MaRDI QIDQ5716754zbMATH OpenOpenAlexFDO

Authors Robert Špalek, Mario Szegedy

Publication date 10 January 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11523468, https://ir.cwi.nl/pub/15655

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 5899240
• All classical adversary methods are equivalent for total functions
• All Classical Adversary Methods Are Equivalent for Total Functions
• Quantum lower bounds by quantum arguments
• Adversary lower bounds for nonadaptive quantum algorithms

Cited in

(8)

• Polynomial degree vs. quantum query complexity
• scientific article; zbMATH DE number 5899240 (Why is no real title available?)
• All classical adversary methods are equivalent for total functions
• All Classical Adversary Methods Are Equivalent for Total Functions
• Two new results about quantum exact learning
• On the power of Ambainis lower bounds
• Quantum separation of local search and fixed point computation
• Adversary lower bounds for nonadaptive quantum algorithms

This page was built for publication: All quantum adversary methods are equivalent

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