# The quantum complexity of approximating the frequency moments

@article{Montanaro2016TheQC,
title={The quantum complexity of approximating the frequency moments},
author={Ashley Montanaro},
journal={Quantum Inf. Comput.},
year={2016},
volume={16},
pages={1169-1190}
}
• A. Montanaro
• Published 1 May 2015
• Computer Science
• Quantum Inf. Comput.
The $k$'th frequency moment of a sequence of integers is defined as $F_k = \sum_j n_j^k$, where $n_j$ is the number of times that $j$ occurs in the sequence. Here we study the quantum complexity of approximately computing the frequency moments in two settings. In the query complexity setting, we wish to minimise the number of queries to the input used to approximate $F_k$ up to relative error $\epsilon$. We give quantum algorithms which outperform the best possible classical algorithms up to…
Quantum Chebyshev's Inequality and Applications
• Computer Science, Mathematics
ICALP
• 2019
A new quantum paradigm that is based on a refinement of the Amplitude Estimation algorithm of Brassard et al. is developed, and it is demonstrated that, in a certain model of quantum sampling, one can approximate with relative error the mean of any random variable with a number of quantum samples that is linear in the ratio of the square root of the variance to the mean.
The polynomial method strikes back: tight quantum query bounds via dual polynomials
• Computer Science
Electron. Colloquium Comput. Complex.
• 2017
The upper bound for Surjectivity introduces new techniques for approximating Boolean functions by low-degree polynomials, and the approximate degree and quantum query complexity of the following natural problems are resolved.
Space efficient quantum algorithms for mode, min-entropy and k-distinctness
• Computer Science
ArXiv
• 2021
A quantum algorithm for a promised version of the problem of determining if the mode of the output distribution of a quantum circuit given as a black-box is larger than a given threshold whose space complexity is logarithmic in the size of the domain of the distribution.
23 : 2 Quantum Chebyshev ’ s Inequality and Applications
A new quantum paradigm is developed that is based on a refinement of the Amplitude Estimation algorithm, and it is demonstrated that, in a certain model of quantum sampling, one can approximate with relative error the mean of any random variable with a number of quantum samples that is linear in the ratio of the square root of the variance to the mean.
Quantum Communication Complexity of Distribution Testing
• Computer Science, Mathematics
Quantum Information and Computation
• 2021
The present paper shows that the quantum communication complexity of this problem is $\tilde{O}(n/(t\epsilon^2))$ qubits when the distributions have low $l_2$-norm, which gives a quadratic improvement over the classical communication complexity obtained.
Quantum Query Complexity of Entropy Estimation
• Computer Science
IEEE Transactions on Information Theory
• 2019
The first quantum algorithms for estimating Shannon and Rényi entropies of unknown discrete distributions and quantum upper bounds for estimating min-entropy anddistinctness problems are given.
A Quantum Advantage for a Natural Streaming Problem
• John Kallaugher
• Computer Science
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)
• 2022
This work gives a one-pass quantum streaming algorithm for one of the best-studied problems in classical graph streaming-the triangle counting problem, and uses polynomially less space in certain regions of the parameter space.
Augmented Index and Quantum Streaming Algorithms for DYCK(2)
• Computer Science
Computational Complexity Conference
• 2017
By providing a quantum generalization of the argument of Jain and Nayak, this work leverages this to obtain a lower bound on the space complexity of multi-pass, unidirectional quantum streaming algorithms for the DYCK(2) language.
Augmented index and quantum streaming algorithms for DYCK(2)
• Computer Science
• 2017
By providing a quantum generalization of the argument of Jain and Nayak, this work leverages this to obtain a lower bound on the space complexity of multi-pass, unidirectional quantum streaming algorithms for the Dyck(2) language.
Quantum Algorithms for Classical Probability Distributions
It is proved that quantum query complexity of distinguishing two probability distributions is given by their inverse Hellinger distance, which gives a quadratic improvement over classical query complexity for any pair of distributions.

## References

SHOWING 1-10 OF 50 REFERENCES
The Complexity of Estimating R\'enyi Entropy
• Computer Science, Mathematics
• 2014
The number of samples needed to estimate H(p) is determined, showing that $\alpha 1$ requires a near-linear $k$ samples, but, perhaps surprisingly, integer $\alpha>1$ requires only $\Theta(k^{1-1/\alpha})$ samples.
The quantum query complexity of approximating the median and related statistics
• Computer Science, Mathematics
STOC '99
• 1999
The main ingredient in the proof is a polynomial degree lower bound for real multilinear polynomials that approximate'' symmetric partial boolean functions, which immediately yields lower bounds for the problems of approximating the kth-smallest element, approximates the mean of a sequence of numbers, and that of approximately counting the number of ones of a boolean function.
An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance
• Computer Science, Mathematics
SIAM J. Comput.
• 2010
We prove an optimal $\Omega(n)$ lower bound on the randomized communication complexity of the much-studied gap-hamming-distance problem. As a consequence, we obtain essentially optimal multipass
Quantum Amplitude Amplification and Estimation
• Mathematics
• 2000
Consider a Boolean function $\chi: X \to \{0,1\}$ that partitions set $X$ between its good and bad elements, where $x$ is good if $\chi(x)=1$ and bad otherwise. Consider also a quantum algorithm
Quantum lower bounds by polynomials
• Computer Science
JACM
• 2001
This work examines the number of queries to input variables that a quantum algorithm requires to compute Boolean functions on {0,1}N in the black-box model and gives asymptotically tight characterizations of T for all symmetric f in the exact, zero-error, and bounded-error settings.
An Optimal Algorithm for Large Frequency Moments Using O(n^(1-2/k)) Bits
• Computer Science, Mathematics
APPROX-RANDOM
• 2014
This paper provides an upper bound on the space required to find a k-th frequency moment of O(n^(1-2/k) bits that matches, up to a constant factor, the lower bound of Woodruff et.
Quantum and classical strong direct product theorems and optimal time-space tradeoffs
• Computer Science, Mathematics
45th Annual IEEE Symposium on Foundations of Computer Science
• 2004
Theorems for the classical as well as quantum query complexity of the OR function are established, which imply a time-space tradeoff T/sup 2/S = /spl Omega/(N/sup 3/) for sorting N items on a quantum computer, which is optimal up to polylog factors.
Efficient Quantum Algorithms for (Gapped) Group Testing and Junta Testing
• Computer Science, Mathematics
SODA
• 2016
This tester is based on a new quantum algorithm for a gapped version of the combinatorial group testing problem, with an up to quartic improvement over the query complexity of the best classical algorithm.
The communication complexity of the Hamming distance problem
• Wei Huang
• Computer Science
Inf. Process. Lett.
• 2006
The quantum query complexity of AC0
• Computer Science
Quantum Inf. Comput.
• 2012
It is shown that any quantum algorithm deciding whether an input function f from [ n] to [n] is 2-to-1 or almost 2- to-1 requires Θ(n) queries to f, and a nearly linear Ω(n/log n) lower bound on the quantum query complexity of AC0 is shown.