arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2205.05056quant-phcond-mat.dis-nncs.LG
收藏

变分量子算法优化的基本限制

Fundamental limitations on optimization in variational quantum algorithms

Baidu Research(百度研究院);Tsinghua University(清华大学)

Hao-Kai Zhang, Chengkai Zhu, Geng Liu, Xin Wang

摘要:

探索近期量子器件的量子应用是量子信息科学的一个快速发展的领域,具有理论和实际意义。建立这种近期量子应用的一个主要范例是变分量子算法(VQA)。这些算法使用经典优化器来训练参数化的量子线路以完成某些任务,其中电路通常被随机初始化。在这项工作中,我们证明了,对于一个广泛的类这样的随机电路,通过调整电路内的任何本地量子门的成本函数的变化范围指数地消失的量子比特的数量具有很高的概率。这个结果可以以自然的方式统一对基于梯度和无梯度优化的限制,并揭示对VQA训练环境的额外严格限制。因此,VQA的可训练性的一个根本限制被解开,表明在指数维希尔伯特空间中的优化难度的本质机制。我们进一步展示了我们的结果的有效性与代表性VQA的数值模拟。我们相信,这些结果将加深我们对VQA可扩展性的理解,并为寻找具有优势的近期量子应用提供帮助。

英文摘要:

Exploring quantum applications of near-term quantum devices is a rapidly growing field of quantum information science with both theoretical and practical interests. A leading paradigm to establish such near-term quantum applications is variational quantum algorithms (VQAs). These algorithms use a classical optimizer to train a parameterized quantum circuit to accomplish certain tasks, where the circuits are usually randomly initialized. In this work, we prove that for a broad class of such random circuits, the variation range of the cost function via adjusting any local quantum gate within the circuit vanishes exponentially in the number of qubits with a high probability. This result can unify the restrictions on gradient-based and gradient-free optimizations in a natural manner and reveal extra harsh constraints on the training landscapes of VQAs. Hence a fundamental limitation on the trainability of VQAs is unraveled, indicating the essential mechanism of the optimization hardness in the Hilbert space with exponential dimension. We further showcase the validity of our results with numerical simulations of representative VQAs. We believe that these results would deepen our understanding of the scalability of VQAs and shed light on the search for near-term quantum applications with advantages.

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

↑