Building on the quantum ensemble based classifier algorithm of Schuld and Petruccione [arXiv:1704.02146v1], we devise equivalent classical algorithms which show that this quantum ensemble method does not have advantage over classical algorithms. Essentially, we simplify their algorithm until it is intuitive to come up with an equivalent classical version. One of the classical algorithms is extremely simple and runs in constant time for each input to be classified. We further develop the idea and, as the main contribution of the paper, we propose methods inspired by combining the quantum ensemble method with adaptive boosting. The algorithms were tested and found to be comparable to the AdaBoost algorithm on publicly available data sets.
翻译:基于Schuld和Petruccione[arXiv:1704.02146v1]的量子组合分类算法,我们设计了等同的古典算法,表明这种量子组合法对古典算法没有优势。从根本上说,我们简化了它们的算法,直到可以直观地得出一个等同的古典版本。一种古典算法非常简单,并且可以持续地对每项输入进行分类。我们进一步发展了这个想法,作为文件的主要贡献,我们提出了将量子组合法与适应性增强法相结合的启发方法。这些算法经过测试,并被发现在公开数据集上与AdaBoost算法相似。