arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1812.07589quant-phcs.PF
收藏

Max-Cut的QAOA需要数百个量子位来实现量子加速

QAOA for Max-Cut requires hundreds of qubits for quantum speed-up

G. G. Guerreschi, A. Y. Matsuura

摘要:

计算量子技术正在进入一个新的阶段,在这个阶段,有噪声的中等规模量子计算机是可用的,但仍然太小,无法从主动纠错中受益。即使有有限的相干预算来投资于量子信息处理,大约50个量子比特的嘈杂设备预计将在未来几年内通过实验证明量子霸权。根据人工任务的定义,目前的量子霸权提案即使成功,也无助于为实际问题提供解决方案。相反,我们相信量子计算机的未来用户对实际应用感兴趣,并且噪声量子设备仍然可以通过混合经典量子算法近似解决困难的组合问题来提供价值。为了降低具有实际效用的量子计算机的大小,我们对量子近似优化算法进行了现实模拟,并得出结论,至少对于代表性的组合问题,量子加速将无法实现,直到数百个量子位可用。

英文摘要:

Computational quantum technologies are entering a new phase in which noisy intermediate-scale quantum computers are available, but are still too small to benefit from active error correction. Even with a finite coherence budget to invest in quantum information processing, noisy devices with about 50 qubits are expected to experimentally demonstrate quantum supremacy in the next few years. Defined in terms of artificial tasks, current proposals for quantum supremacy, even if successful, will not help to provide solutions to practical problems. Instead, we believe that future users of quantum computers are interested in actual applications and that noisy quantum devices may still provide value by approximately solving hard combinatorial problems via hybrid classical-quantum algorithms. To lower bound the size of quantum computers with practical utility, we perform realistic simulations of the Quantum Approximate Optimization Algorithm and conclude that quantum speedup will not be attainable, at least for a representative combinatorial problem, until several hundreds of qubits are available.

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

↑