Proper and improper quantum PAC learning complexities are compared, with a focus on the Coupon Collector problem.
