Collaborative Research: EAGER: QIA: Large Scale QAOA Quantum Simulator

合作研究：EAGER：QIA：大规模 QAOA 量子模拟器

• 批准号: 2035577
• 负责人: Yuri Alexeev
• 金额: $ 10万
• 依托单位: University of Chicago
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2020
• 资助国家: 美国
• 起止时间: 2020-10-01 至 2023-09-30
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=2035577&HistoricalAwards=false
• 关键词: Collaborative; Research; EAGER; QIA; Large

The goal of this project is to develop a specialized Quantum Approximate Optimization Algorithm (QAOA) quantum circuit simulator. QAOA is the most studied quantum optimization algorithm and is considered to be the prime candidate for demonstrating quantum advantage. There is a worldwide race underway amongst top quantum information science researchers to find combinatorial optimization problems and their instances that run efficiently and faster on quantum devices rather than on classical computers. One of the critical bottlenecks is to find circuit parameters faster on a classical computer to accelerate variational quantum-classical frameworks. The expected improvements to the developed simulator will dramatically increase the speed of QAOA simulations by at least one order of magnitude and significantly speed up research done on finding optimal QAOA circuit parameters. As a result, it will help the realization of quantum advantage by US scientists in this highly competitive field of science.The technical goal of this project is to carry out computational and algorithmic investigations in various node elimination methods for tensor contraction in the development of a scalable quantum simulator. The plan is to build upon the success of the combinatorial scientific computing community in developing elimination algorithms for such tasks as minimizing the error and complexity in matrix computations and optimizing the time and space complexity in automatic differentiation, and recent developments in treewidth optimization algorithms. Additionally, in this project, emphasis will be placed on scaling up relevant graph algorithms to achieve acceptable time/quality trade-off for large-scale quantum simulators. Algorithmic and software products of this project will include a specialized QAOA quantum circuit open-source simulator equipped with fast optimization algorithms to accelerate tensor contraction methods. A high-quality simulator that scales to sufficiently large circuits is one of the major bottlenecks in discovering applications for demonstrating quantum advantage.This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.

本项目的目标是开发一个专门的量子近似优化算法（QAOA）量子电路模拟器。QAOA是研究最多的量子优化算法，被认为是证明量子优势的主要候选者。世界范围内的顶级量子信息科学研究人员正在进行一场竞赛，以寻找组合优化问题及其在量子设备上而不是在经典计算机上高效和更快地运行的实例。关键的瓶颈之一是在经典计算机上更快地找到电路参数，以加速变分量子经典框架。开发的模拟器的预期改进将大大提高QAOA模拟的速度至少一个数量级，并显着加快研究找到最佳QAOA电路参数。因此，它将有助于美国科学家在这一竞争激烈的科学领域实现量子优势。该项目的技术目标是在开发可扩展的量子模拟器时，对张量收缩的各种节点消除方法进行计算和算法研究。该计划是建立在成功的组合科学计算社区在开发消除算法等任务，如最大限度地减少矩阵计算中的错误和复杂性，优化自动微分的时间和空间复杂性，以及最近的发展在树宽优化算法。此外，在这个项目中，重点将放在扩大相关的图形算法，以实现可接受的时间/质量权衡大规模量子模拟器。该项目的计算机和软件产品将包括一个专门的QAOA量子电路开源模拟器，该模拟器配备了快速优化算法，以加速张量收缩方法。一个高质量的模拟器，可扩展到足够大的电路是发现应用程序，以证明量子优势的主要瓶颈之一。这个奖项反映了NSF的法定使命，并已被认为是值得通过使用基金会的智力价值和更广泛的影响审查标准进行评估的支持。

项目成果

Constructing Optimal Contraction Trees for Tensor Network Quantum Circuit Simulation

• DOI: 10.1109/hpec55821.2022.9926353
• 发表时间: 2022-09
• 期刊: 2022 IEEE High Performance Extreme Computing Conference (HPEC)
• 作者: Cameron Ibrahim;Danylo Lykov;Zichang He;Y. Alexeev;Ilya Safro