Multiscale quantum algorithms for quantum chemistry

Prepare Linear Distributions with Quantum Arithmetic Units

Quantum arithmetic logic units (QALUs) perform essential arithmetic operations within a quantum framework, serving as the building blocks for more complex computations and algorithms in quantum computing. In this paper, we present an approach to prepare linear probability distributions with quantum full adders. There are three main steps. Firstly, Hadamard gates are applied to the two input terms, preparing them at quantum states corresponding to uniform distribution. Next, the two input terms are summed up by applying quantum full adder, and the output sum is treated as a signed integer under two's complement representation. By the end, additional phase -1 is introduced to the negative components. Additionally, we can discard either the positive or negative components with the assistance of the Repeat-Until-Success process. Our work demonstrates a viable approach to prepare linear probability distributions with quantum adders. The resulting state can serve as an intermediate step for subsequent quantum operations.

Quantum-centric high performance computing for quantum chemistry

High performance computing (HPC) is renowned for its capacity to tackle complex problems. Meanwhile, quantum computing (QC) provides a potential way to accurately and efficiently solve quantum chemistry problems. The emerging field of quantum-centric high performance computing (QCHPC), which merges these two powerful technologies, is anticipated to enhance computational capabilities for solving challenging problems in quantum chemistry. The implementation of QCHPC for quantum chemistry requires interdisciplinary research and collaboration across multiple fields, including quantum chemistry, quantum physics, computer science and so on. This perspective provides an introduction to the quantum algorithms that are suitable for deployment in QCHPC, focusing on conceptual insights rather than technical details. Parallel strategies to implement these algorithms on quantum-centric supercomputers are discussed. We also summarize high performance quantum emulating simulators, which are considered a viable tool to explore QCHPC. We conclude with challenges and outlooks in this field.

A Vision for the Future of Multiscale Modeling

The rise of modern computer science enabled physical chemistry to make enormous progresses in understanding and harnessing natural and artificial phenomena. Nevertheless, despite the advances achieved over past decades, computational resources are still insufficient to thoroughly simulate extended systems from first principles. Indeed, countless biological, catalytic and photophysical processes require ab initio treatments to be properly described, but the breadth of length and time scales involved makes it practically unfeasible. A way to address these issues is to couple theories and algorithms working at different scales by dividing the system into domains treated at different levels of approximation, ranging from quantum mechanics to classical molecular dynamics, even including continuum electrodynamics. This approach is known as multiscale modeling and its use over the past 60 years has led to remarkable results. Considering the rapid advances in theory, algorithm design, and computing power, we believe multiscale modeling will massively grow into a dominant research methodology in the forthcoming years. Hereby we describe the main approaches developed within its realm, highlighting their achievements and current drawbacks, eventually proposing a plausible direction for future developments considering also the emergence of new computational techniques such as machine learning and quantum computing. We then discuss how advanced multiscale modeling methods could be exploited to address critical scientific challenges, focusing on the simulation of complex light-harvesting processes, such as natural photosynthesis. While doing so, we suggest a cutting-edge computational paradigm consisting in performing simultaneous multiscale calculations on a system allowing the various domains, treated with appropriate accuracy, to move and extend while they properly interact with each other. Although this vision is very ambitious, we believe the quick development of computer science will lead to both massive improvements and widespread use of these techniques, resulting in enormous progresses in physical chemistry and, eventually, in our society.

Efficient and Robust Parameter Optimization of the Unitary Coupled-Cluster Ansatz

The variational quantum eigensolver (VQE) framework has been instrumental in advancing near-term quantum algorithms. However, parameter optimization remains a significant bottleneck for VQE, requiring a large number of measurements for successful algorithm execution. In this paper, we propose sequential optimization with approximate parabola (SOAP) as an efficient and robust optimizer specifically designed for parameter optimization of the unitary coupled-cluster ansatz on quantum computers. SOAP leverages sequential optimization and approximates the energy landscape as quadratic functions, minimizing the number of energy evaluations required to optimize each parameter. To capture parameter correlations, SOAP incorporates the average direction from previous iterations into the optimization direction set. Numerical benchmark studies on molecular systems demonstrate that SOAP achieves significantly faster convergence and greater robustness to noise compared with traditional optimization methods. Furthermore, numerical simulations of up to 20 qubits reveal that SOAP scales well with the number of parameters in the ansatz. The exceptional performance of SOAP is further validated through experiments on a superconducting quantum computer using a 2-qubit model system.

Toward Chemical Accuracy with Shallow Quantum Circuits: A Clifford-Based Hamiltonian Engineering Approach

Achieving chemical accuracy with shallow quantum circuits is a significant challenge in quantum computational chemistry, particularly for near-term quantum devices. In this work, we present a Clifford-based Hamiltonian engineering algorithm, namely CHEM, that addresses the trade-off between circuit depth and accuracy. Based on a variational quantum eigensolver and hardware-efficient ansatz, our method designs the Clifford-based Hamiltonian transformation that (1) ensures a set of initial circuit parameters corresponding to the Hartree-Fock energy can be generated, (2) effectively maximizes the initial energy gradient with respect to circuit parameters, (3) imposes negligible overhead for classical processing and does not require additional quantum resources, and (4) is compatible with any circuit topology. We demonstrate the efficacy of our approach using a quantum hardware emulator, achieving chemical accuracy for systems as large as 12 qubits with fewer than 30 two-qubit gates. Our Clifford-based Hamiltonian engineering approach offers a promising avenue for practical quantum computational chemistry on near-term quantum devices.

Quantum Computer Simulation of Protein Protonation

In attempts to simulate the protonation of proteins, a major challenge is that the number of protonation states grows rapidly as a function (2N) of the number of protonation sites (N). Expression on the free energy of the protonation state as an N-site Ising model ─ using an empirical Generalized-Born model ─ allows a quantum computer to efficiently determine the important states at a given pH value and subsequently reconstruct the pH titration process at all sites. Compared with the exact results painstakingly obtained with classical computers, the results obtained using quantum computers show good agreement for staphylococcal nuclease and excellent agreement for α-lactalbumin. This work illustrates the effectiveness of quantum computers in sampling important physical states, which may be useful in attacking challenging biomolecular problems.