arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1804.00281quant-phstat.ML
收藏

量子和量子启发机器学习的平滑输入准备

Smooth input preparation for quantum and quantum-inspired machine learning

Zhikuan Zhao, Jack K. Fitzsimons, Patrick Rebentrost, Vedran Dunjko, Joseph F. Fitzsimons

摘要:

机器学习最近已经成为寻找潜在量子计算优势的富有成效的领域。许多量子增强机器学习算法关键在于有效地产生与存储在量子可访问存储器中的高维数据点成比例的状态的能力。即使给定对存储在数据库中的呈指数级的许多条目的查询访问,其构造被认为是一次性开销,也有人认为,准备这种振幅编码状态的成本可能抵消任何指数级的量子优势。在这里,我们证明使用平滑分析,如果数据分析算法是强大的小条目输入扰动,状态准备总是可以实现与不断的查询。在实际的机器学习应用中通常满足该标准,其中输入数据对中等噪声是主观的。我们的研究结果同样适用于最近的量子启发算法的开创性进展,特别构造的数据库足以在低秩的情况下的多对数经典算法。我们发现的结果是,对于实际的机器学习的目的,多对数处理时间是可能的,在一般和灵活的输入模型与量子算法或量子启发的经典算法在低秩的情况下。

英文摘要:

Machine learning has recently emerged as a fruitful area for finding potential quantum computational advantage. Many of the quantum enhanced machine learning algorithms critically hinge upon the ability to efficiently produce states proportional to high-dimensional data points stored in a quantum accessible memory. Even given query access to exponentially many entries stored in a database, the construction of which is considered a one-off overhead, it has been argued that the cost of preparing such amplitude-encoded states may offset any exponential quantum advantage. Here we prove using smoothed analysis, that if the data-analysis algorithm is robust against small entry-wise input perturbation, state preparation can always be achieved with constant queries. This criterion is typically satisfied in realistic machine learning applications, where input data is subjective to moderate noise. Our results are equally applicable to the recent seminal progress in quantum-inspired algorithms, where specially constructed databases suffice for polylogarithmic classical algorithm in low-rank cases. The consequence of our finding is that for the purpose of practical machine learning, polylogarithmic processing time is possible under a general and flexible input model with quantum algorithms or quantum-inspired classical algorithms in the low-rank cases.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑