A new quantum lower bound method,

DOI10.1145/1132516.1132604zbMath1301.81041OpenAlexW2146817307WikidataQ130928977 ScholiaQ130928977MaRDI QIDQ2931423

Robert Špalek, Andris Ambainis, Ronald de Wolf

Publication date: 25 November 2014

Published in: Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1132516.1132604

zbMATH Keywords

lower boundsquantum computingtime-space tradeoffsdirect product theorems

Mathematics Subject Classification ID

Quantum computation (81P68)

Related Items (2)

A strong direct product theorem for quantum query complexity ⋮ Quantum and classical query complexities of local search are polynomially related

This page was built for publication: A new quantum lower bound method,