arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1208.0663quant-ph
收藏

无需量子记忆的鲁棒最优量子学习

Robust optimal quantum learning without quantum memory

G. Sentís, J. Calsamiglia, R. Munoz-Tapia, E. Bagan

摘要:

一个量子学习机的量子比特状态的二进制分类,不需要量子存储器的介绍和执行的最小错误率允许的量子力学的任何大小的训练集。这个结果被证明是鲁棒的(任意量的)噪声和(统计)下的训练集的组成的变化,只要它是足够大的。该机器可以使用任意次数,无需重新训练。它所需的经典存储器仅随训练量子比特的数量而几何地增长,而其超额风险则随该数量的倒数而下降,并且是估计和判别机器的超额风险的两倍,估计和判别机器估计训练量子比特的状态,并使用针对所获得的估计量身定制的判别协议对数据量子比特进行分类。

英文摘要:

A quantum learning machine for binary classification of qubit states that does not require quantum memory is introduced and shown to perform with the minimum error rate allowed by quantum mechanics for any size of the training set. This result is shown to be robust under (an arbitrary amount of) noise and under (statistical) variations in the composition of the training set, provided it is large enough. This machine can be used an arbitrary number of times without retraining. Its required classical memory grows only logarithmically with the number of training qubits, while its excess risk decreases as the inverse of this number, and twice as fast as the excess risk of an estimate-and-discriminate machine, which estimates the states of the training qubits and classifies the data qubit with a discrimination protocol tailored to the obtained estimates.

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

↑