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

基于AlphaTensor的量子线路优化

Quantum Circuit Optimization with AlphaTensor

Google DeepMind(谷歌DeepMind);Quantinuum(昆腾纽姆);University of Amsterdam(阿姆斯特丹大学)
Francisco J. R. Ruiz, Tuomas Laakkonen, Johannes Bausch, Matej Balog, Mohammadamin Barekatain, Francisco J. H. Heras, Alexander Novikov, Nathan Fitzpatrick, Ber… 展开作者

Francisco J. R. Ruiz, Tuomas Laakkonen, Johannes Bausch, Matej Balog, Mohammadamin Barekatain, Francisco J. H. Heras, Alexander Novikov, Nathan Fitzpatrick, Bernardino Romera-Paredes, John van de Wetering, Alhussein Fawzi, Konstantinos Meichanetzidis, Pushmeet Kohli

AI总结:

针对容错量子计算的T门计数优化问题,提出基于深度强化学习的AlphaTensor-Quantum方法,结合张量分解与领域知识,在算术基准测试中优于现有方法,还能发现高效算法并复现最优人工方案,可大幅节省量子线路优化的研究时间。

摘要:

实现容错量子计算机的核心挑战之一是量子线路优化。本文聚焦容错量子计算中成本最高的门(即T门),研究T计数优化问题,也就是最小化实现给定线路所需的T门数量。为此,我们提出了AlphaTensor-Quantum方法,该方法基于深度强化学习,利用了T计数优化与张量分解之间的关联。与现有的T计数优化方法不同,AlphaTensor-Quantum可以融入量子计算的领域特定知识,并借助gadget(小装置)技术,大幅降低了优化后线路的T计数。在一组算术基准测试上,AlphaTensor-Quantum的表现优于现有T计数优化方法(即使在不使用gadget的对比情况下依然如此)。值得注意的是,它发现了一种类似于有限域乘法Karatsuba方法的高效算法。AlphaTensor-Quantum还找到了Shor算法中相关算术计算以及量子化学模拟的最优人工设计方案,证明它能够通过全自动优化相关量子线路,节省数百小时的研究时间。

英文摘要:

A key challenge in realizing fault-tolerant quantum computers is circuit optimization. Focusing on the most expensive gates in fault-tolerant quantum computation (namely, the T gates), we address the problem of T-count optimization, i.e., minimizing the number of T gates that are needed to implement a given circuit. To achieve this, we develop AlphaTensor-Quantum, a method based on deep reinforcement learning that exploits the relationship between optimizing T-count and tensor decomposition. Unlike existing methods for T-count optimization, AlphaTensor-Quantum can incorporate domain-specific knowledge about quantum computation and leverage gadgets, which significantly reduces the T-count of the optimized circuits. AlphaTensor-Quantum outperforms the existing methods for T-count optimization on a set of arithmetic benchmarks (even when compared without making use of gadgets). Remarkably, it discovers an efficient algorithm akin to Karatsuba's method for multiplication in finite fields. AlphaTensor-Quantum also finds the best human-designed solutions for relevant arithmetic computations used in Shor's algorithm and for quantum chemistry simulation, thus demonstrating it can save hundreds of hours of research by optimizing relevant quantum circuits in a fully automated way.

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

↑