A Note on Enumeration by Fair Sampling
Quantum Physics
2021-04-06 v1
Abstract
This note describes an algorithm for enumerating all the elements in a finite set based on uniformly random sampling from the set. This algorithm can be used for enumeration by fair sampling with quantum annealing. Our algorithm is based on a lemma of the coupon collector's problem and is an improved version of the algorithm described in arXiv:2007.08487 (2020). We provide a mathematical analysis and a numerical demonstration of our algorithm.
Cite
@article{arxiv.2104.01941,
title = {A Note on Enumeration by Fair Sampling},
author = {Yuta Mizuno and Tamiki Komatsuzaki},
journal= {arXiv preprint arXiv:2104.01941},
year = {2021}
}