Exploring complexity and scalability of Near-term Quantum Computing algorithms for Quantum Chemistry

探索量子化学近期量子计算算法的复杂性和可扩展性

• 批准号: 2468302
• 金额: --
• 依托单位: University College London
• 依托单位国家: 英国
• 项目类别: Studentship
• 财政年份: 2020
• 资助国家: 英国
• 起止时间: 2020 至 无数据
• 项目状态: 未结题
• 来源: https://gtr.ukri.org/projects?ref=studentship-2468302
• 关键词: Exploring; complexity; scalability; Near; term

The study of molecular systems is heavily limited by current computing capabilities. As molecular systems grow in complexity exponentially, accurate computation of chemical properties becomes challenging even for small systems. Quantum computing offers many promises in terms of much larger modelling molecular systems than what we can currently do classically. The Variational Quantum Eigensolver (VQE) is one of the main examples of near-term quantum algorithms that are expected to find application in quantum chemistry. However, its scalability is still largely under question. Recently Zhenyu Cai (Oxford) has implemented resource estimates for VQE simulations of the 50-qubit Fermi-Hubbard Model, and discussed the requirement of multi-core NISQ processing to and better error mitigation in the context of near-term quantum hardware. The VQE, relies on classical pre-processing. In particular, we must first compute the second quantised Hamiltonian of the system, which already has a computational cost of O(N^4) for N orbitals. As such it will never replace the most widely used computational quantum chemistry method, Density Functional Theory (DFT) as its cost of solving is O(N^3) not assuming any sparsity (this would bring the cost in either case down). To be computationally relevant, the VQE must first and foremost be able to produce significantly more accurate results than DFT. At the same time, a suitable benchmarking analysis must compare the result and computational cost of VQE to a more accurate Quantum Chemistry method such as Full Configuration Interaction (FCI)/Rahko is currently leading a project aiming at studying the scalability of the VQE. The start-up is looking for a CASE PhD student to collaborate on furthering this research and conduct a formal study of the feasibility of using near-term quantum computing for quantum chemistry.In particular, the student will be researching the latest literature on Quantum algorithms for quantum chemistry (beyond VQE) and build a methodology for assessing their scalability in comparison to the best practices for the likes of DFT and FCI. As part of this project, the student will define the state-of-the-art methods to implement quantum algorithms and will identify bottlenecks and possible improvements for their scalability throughout the programme stack. The student will be given access to Rahko's quantum development platform, Hyrax , and will gain access to real quantum computers (e.g. AWS Braket, Azure Quantum, IMBQ) and supercomputers through Rahko's and UCL's partnerships.

分子系统的研究受到当前计算能力的严重限制。随着分子系统的复杂性呈指数级增长，即使对于小系统，精确计算化学性质也变得具有挑战性。量子计算提供了许多承诺，在更大的建模分子系统比我们目前可以做的经典。变分量子本征解算器（VQE）是近期量子算法的主要例子之一，有望在量子化学中找到应用。然而，它的可扩展性在很大程度上仍然受到质疑。最近，Zhenyu Cai（牛津大学）为50量子位费米-哈伯德模型的VQE模拟实现了资源估计，并讨论了多核NISQ处理的要求以及在近期量子硬件的背景下更好的错误缓解。VQE依赖于经典的预处理。特别地，我们必须首先计算系统的第二量子化哈密顿量，对于N个轨道，它的计算成本已经是O（N^4）。因此，它永远不会取代最广泛使用的计算量子化学方法，密度泛函理论（DFT），因为它的求解成本是O（N^3），不假设任何稀疏性（这将降低任何情况下的成本）。为了与计算相关，VQE必须首先能够产生比DFT更精确的结果。与此同时，一个合适的基准分析必须将VQE的结果和计算成本与更准确的量子化学方法进行比较，例如全组态相互作用（FCI）/Rahko目前正在领导一个旨在研究VQE可扩展性的项目。该初创公司正在寻找一名CASE博士生合作推进这项研究，并对将近期量子计算用于量子化学的可行性进行正式研究。特别是，该学生将研究量子化学量子算法的最新文献（超越VQE），并建立一种方法来评估其可扩展性，并与DFT和FCI等最佳实践进行比较。作为该项目的一部分，学生将定义最先进的方法来实现量子算法，并将确定其在整个程序堆栈中可扩展性的瓶颈和可能的改进。学生将获得Rahko的量子开发平台Hyrax，并将通过Rahko和UCL的合作伙伴关系获得真实的量子计算机（例如AWS Braket，Azure Quantum，IMBQ）和超级计算机。