Average case quantum lower bounds for computing the Boolean mean
From MaRDI portal
Abstract: We study the average case approximation of the Boolean mean by quantum algorithms. We prove general query lower bounds for classes of probability measures on the set of inputs. We pay special attention to two probabilities, where we show specific query and error lower bounds and the algorithms that achieve them. We also study the worst expected error and the average expected error of quantum algorithms and show the respective query lower bounds. Our results extend the optimality of the algorithm of Brassard et al.
Recommendations
Cites work
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 46318 (Why is no real title available?)
- scientific article; zbMATH DE number 2051219 (Why is no real title available?)
- scientific article; zbMATH DE number 2103524 (Why is no real title available?)
- Quantum summation with an application to integration.
- The quantum query complexity of approximating the median and related statistics
Cited in
(4)
This page was built for publication: Average case quantum lower bounds for computing the Boolean mean
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1888378)