On a Problem in Quantum Summation
classification
🪐 quant-ph
cs.NAmath.NA
keywords
computationproblemquantumsequencescasecomplexityconditionconsider
read the original abstract
We consider the computation of the mean of sequences in the quantum model of computation. We determine the query complexity in the case of sequences which satisfy a $p$-summability condition for $1\le p<2$. This settles a problem left open in Heinrich (2001).
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.