# Quantum Coupon Collector

@article{Arunachalam2020QuantumCC,
title={Quantum Coupon Collector},
author={Srinivasan Arunachalam and A. Belovs and Andrew M. Childs and Robin Kothari and A. Rosmanis and R. D. Wolf},
journal={ArXiv},
year={2020},
volume={abs/2002.07688}
}
We study how efficiently a $k$-element set $S\subseteq[n]$ can be learned from a uniform superposition $|S\rangle$ of its elements. One can think of $|S\rangle=\sum_{i\in S}|i\rangle/\sqrt{|S|}$ as the quantum version of a uniformly random sample over $S$, as in the classical analysis of the coupon collector problem.'' We show that if $k$ is close to $n$, then we can learn $S$ using asymptotically fewer quantum samples than random samples. In particular, if there are $n-k=O(1)$ missing… Expand
1 Citations

#### References

SHOWING 1-10 OF 33 REFERENCES
Two new results about quantum exact learning
• Physics, Computer Science
• ICALP
• 2019
• 13
• PDF
Improved Bounds on Quantum Learning Algorithms
• Computer Science, Physics
• Quantum Inf. Process.
• 2005
• 57
• PDF
Optimal Quantum Sample Complexity of Learning Algorithms
• Mathematics, Physics
• Computational Complexity Conference
• 2017
• 46
• PDF
Quantum Algorithms for Learning and Testing Juntas
• Mathematics, Computer Science
• Quantum Inf. Process.
• 2007
• 55
• PDF
Quantum lower bounds by polynomials
• Mathematics, Computer Science
• JACM
• 2001
• 428
• PDF
Quantum lower bounds for approximate counting via laurent polynomials
• S. Aaronson
• Physics, Computer Science
• Electron. Colloquium Comput. Complex.
• 2018
• 9
• PDF
A strong direct product theorem for quantum query complexity
• Mathematics, Computer Science
• 2012 IEEE 27th Conference on Computational Complexity
• 2012
• 27
• PDF