arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1807.03253quant-ph
收藏

用于量子计算的基准神经网络

Benchmarking neural networks for quantum computation

N. H. Nguyen, E. C. Behrman, M. A. Moustafa, J. E. Steck

摘要:

量子计算机的能力仍然是一种推测。虽然它们在某些任务上肯定比经典算法更快,但它们可以有效解决的问题类别尚未明确映射到已知的经典复杂性理论中。这意味着,一旦找到了算法,我们不知道哪些计算会有“量子优势”,回答这个问题的一种方法是找到那些算法,但找到真正的量子算法是非常困难的。在过去三十年的工作中,我们一直在追求使用机器学习技术来开发量子计算算法的想法。在这里,我们比较了标准的实值和复值经典神经网络的性能与我们的量子神经网络模型之一,在经典问题和一个原型量子问题:计算一个纠缠见证。量子网络需要更少的时间和更小的网络来实现可比或更好的结果。

英文摘要:

The power of quantum computers is still somewhat speculative. While they are certainly faster than classical ones at some tasks, the class of problems they can efficiently solve has not been mapped definitively onto known classical complexity theory. This means that we do not know for which calculations there will be a "quantum advantage," once an algorithm is found. One way to answer the question is to find those algorithms, but finding truly quantum algorithms turns out to be very difficult. In previous work over the past three decades we have pursued the idea of using techniques of machine learning to develop algorithms for quantum computing. Here we compare the performance of standard real- and complex-valued classical neural networks with that of one of our models for a quantum neural network, on both classical problems and on an archetypal quantum problem: the computation of an entanglement witness. The quantum network is shown to need far fewer epochs and a much smaller network to achieve comparable or better results.

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

↑