Equation-of-Motion Theory to Calculate Accurate Band Structures with a Quantum Computer

Divergences in classical and quantum linear response and equation of motion formulations

Calculating molecular properties using quantum devices can be performed through the quantum linear response (qLR) or, equivalently, the quantum equation of motion (qEOM) formulations. Different parameterizations of qLR and qEOM are available, namely naïve, projected, self-consistent, and state-transfer. In the naïve and projected parameterizations, the metric is not the identity, and we show that it depends on redundant orbital rotations. This dependency may lead to divergences in the excitation energies for certain choices of the redundant orbital rotation parameters in an idealized noiseless setting. Furthermore, this leads to a significant variance when calculations include statistical noise from finite quantum sampling.

Transformer-Based Neural-Network Quantum State Method for Electronic Band Structures of Real Solids

Recent advancements in neural networks have led to significant progress in addressing many-body electron correlations in small molecules and various physical models. In this work, we propose QiankunNet-Solid, which incorporates periodic boundary conditions into the neural network quantum state (NNQS) framework based on generative Transformer architecture along with a batched autoregressive sampling (BAS) method, enabling the effective ab initio calculation of real solid materials. The accuracy of this method is demonstrated in one-, two-, and three-dimensional periodic systems, with results comparable to those of full configuration interaction and coupled-cluster method, even in the strongly correlated regime. Furthermore, we compute the band structures and density of states for silicon crystal. The successful incorporation of periodic boundary conditions into the NNQS framework through QiankunNet-Solid opens up new possibilities for the accurate and efficient study of electronic structure properties in solid-state physics.

Quantum Simulation of Molecular Response Properties in the NISQ Era

Accurate modeling of the response of molecular systems to an external electromagnetic field is challenging on classical computers, especially in the regime of strong electronic correlation. In this article, we develop a quantum linear response (qLR) theory to calculate molecular response properties on near-term quantum computers. Inspired by the recently developed variants of the quantum counterpart of equation of motion (qEOM) theory, the qLR formalism employs "killer condition" satisfying excitation operator manifolds that offer a number of theoretical advantages along with reduced quantum resource requirements. We also used the qEOM framework in this work to calculate the state-specific response properties. Further, through noiseless quantum simulations, we show that response properties calculated using the qLR approach are more accurate than the ones obtained from the classical coupled-cluster-based linear response models due to the improved quality of the ground-state wave function obtained using the ADAPT-VQE algorithm.

Circuit-Depth Reduction of Unitary-Coupled-Cluster Ansatz by Energy Sorting

Quantum computation represents a revolutionary approach to solving problems in quantum chemistry. However, due to the limited quantum resources in the current noisy intermediate-scale quantum (NISQ) devices, quantum algorithms for large chemical systems remain a major task. In this work, we demonstrate that the circuit depth of the unitary coupled cluster (UCC) and UCC-based ansatzes in the algorithm of the variational quantum eigensolver can be significantly reduced by an energy-sorting strategy. Specifically, subsets of excitation operators are first prescreened from the operator pool according to its contribution to the total energy. The quantum circuit ansatz is then iteratively constructed until convergence of the final energy to a typical accuracy. For demonstration, this method has been successfully applied to molecular and periodic systems. Particularly, a reduction of 50%-98% in the number of operators is observed while retaining the accuracy of the original UCCSD operator pools. This method can be straightforwardly extended to general parametric variational ansatzes.

Quantum Circuit Matrix Product State Ansatz for Large-Scale Simulations of Molecules

As demonstrated in the density matrix renormalization group (DMRG) method, approximating many-body wave function of electrons using a matrix product state (MPS) is a promising way to solve electronic structure problems. The expressibility of an MPS is determined by the size of the matrices or, in other words, the bond dimension, which unfortunately may be required to be very large in quantum chemistry simulations. In this study, we propose to calculate the ground state energies of molecular systems by variationally optimizing quantum circuit MPS (QCMPS) with a relatively small number of qubits. It is demonstrated that with carefully chosen circuit structure and orbital localization scheme, QCMPS can reach a similar accuracy as that achieved in DMRG with an exponentially large bond dimension. QCMPS simulation of a linear hydrogen molecular chain with 50 orbitals can reach the chemical accuracy using only 6 qubits at a moderate circuit depth. These results suggest that QCMPS is a promising wave function ansatz in the variational quantum eigensolver algorithm for molecular systems.

Two Algorithms for Excited-State Quantum Solvers: Theory and Application to EOM-UCCSD

Near-term quantum devices promise to revolutionize quantum chemistry, but simulations using the current noisy intermediate-scale quantum (NISQ) devices are not practical due to their high susceptibility to errors. This motivated the design of NISQ algorithms leveraging classical and quantum resources. While several developments have shown promising results for ground-state simulations, extending the algorithms to excited states remains challenging. This paper presents two cost-efficient excited-state algorithms inspired by the classical Davidson algorithm. We implemented the Davidson method into the quantum self-consistent equation-of-motion unitary coupled-cluster (q-sc-EOM-UCC) excited-state method adapted for quantum hardware. The circuit strategies for generating desired excited states are discussed, implemented, and tested. We demonstrate the performance and accuracy of the proposed algorithms (q-sc-EOM-UCC/Davidson and its variational variant) by simulations of H2, H4, LiH, and H2O molecules. Similar to the classical Davidson scheme, q-sc-EOM-UCC/Davidson algorithms are capable of targeting a small number of excited states of the desired character.

Towards practical and massively parallel quantum computing emulation for quantum chemistry

Quantum computing is moving beyond its early stage and seeking for commercial applications in chemical and biomedical sciences. In the current noisy intermediate-scale quantum computing era, the quantum resource is too scarce to support these explorations. Therefore, it is valuable to emulate quantum computing on classical computers for developing quantum algorithms and validating quantum hardware. However, existing simulators mostly suffer from the memory bottleneck so developing the approaches for large-scale quantum chemistry calculations remains challenging. Here we demonstrate a high-performance and massively parallel variational quantum eigensolver (VQE) simulator based on matrix product states, combined with embedding theory for solving large-scale quantum computing emulation for quantum chemistry on HPC platforms. We apply this method to study the torsional barrier of ethane and the quantification of the protein-ligand interactions. Our largest simulation reaches 1000 qubits, and a performance of 216.9 PFLOP/s is achieved on a new Sunway supercomputer, which sets the state-of-the-art for quantum computing emulation for quantum chemistry.

Multiscale quantum algorithms for quantum chemistry

Exploring the potential applications of quantum computers in material design and drug discovery is attracting more and more attention after quantum advantage has been demonstrated using Gaussian boson sampling. However, quantum resource requirements in material and (bio)molecular simulations are far beyond the capacity of near-term quantum devices. In this work, multiscale quantum computing is proposed for quantum simulations of complex systems by integrating multiple computational methods at different scales of resolution. In this framework, most computational methods can be implemented in an efficient way on classical computers, leaving the critical portion of the computation to quantum computers. The simulation scale of quantum computing strongly depends on available quantum resources. As a near-term scheme, we integrate adaptive variational quantum eigensolver algorithms, second-order Møller-Plesset perturbation theory and Hartree-Fock theory within the framework of the many-body expansion fragmentation approach. This new algorithm is applied to model systems consisting of hundreds of orbitals with decent accuracy on the classical simulator. This work should encourage further studies on quantum computing for solving practical material and biochemistry problems.

Quantum self-consistent equation-of-motion method for computing molecular excitation energies, ionization potentials, and electron affinities on a quantum computer

Near-term quantum computers are expected to facilitate material and chemical research through accurate molecular simulations. Several developments have already shown that accurate ground-state energies for small molecules can be evaluated on present-day quantum devices. Although electronically excited states play a vital role in chemical processes and applications, the search for a reliable and practical approach for routine excited-state calculations on near-term quantum devices is ongoing. Inspired by excited-state methods developed for the unitary coupled-cluster theory in quantum chemistry, we present an equation-of-motion-based method to compute excitation energies following the variational quantum eigensolver algorithm for ground-state calculations on a quantum computer. We perform numerical simulations on H2, H4, H2O, and LiH molecules to test our quantum self-consistent equation-of-motion (q-sc-EOM) method and compare it to other current state-of-the-art methods. q-sc-EOM makes use of self-consistent operators to satisfy the vacuum annihilation condition, a critical property for accurate calculations. It provides real and size-intensive energy differences corresponding to vertical excitation energies, ionization potentials and electron affinities. We also find that q-sc-EOM is more suitable for implementation on NISQ devices as it is expected to be more resilient to noise compared with the currently available methods.

Improved Algorithms of Quantum Imaginary Time Evolution for Ground and Excited States of Molecular Systems

Quantum imaginary time evolution (QITE) is a recently proposed quantum-classical hybrid algorithm that is guaranteed to reach the lowest state of systems. In this study, we present several improvements on QITE, mainly focusing on molecular applications. We analyze the derivation of the underlying QITE equation order-by-order and suggest a modification that is theoretically well founded. Our results clearly indicate the soundness of the here-derived equation, enabling a better approximation of the imaginary time propagation by a unitary. We also discuss how to accurately estimate the norm of an imaginary-time-evolved state and applied it to excited-state calculations using the quantum Lanczos algorithm. Finally, we propose the folded-spectrum QITE scheme as a straightforward extension of QITE for general excited-state simulations. The effectiveness of all these developments is illustrated by simulations with or without noise effect, offering further insights into quantum algorithms for imaginary time evolution.

Quantum algorithms for electronic structures: basis sets and boundary conditions

The advantages of quantum computers are believed to significantly change the research paradigm of chemical and materials sciences, where computational characterization and theoretical design play an increasingly important role. It is especially desirable to solve the electronic structure problem, a central problem in chemistry and materials science, efficiently and accurately with well-designed quantum algorithms. Various quantum electronic-structure algorithms have been proposed in the literature. In this article, we briefly review recent progress in this direction with a special emphasis on the basis sets and boundary conditions. Compared to classical electronic structure calculations, there are new considerations in choosing a basis set in quantum algorithms. For example, the effect of the basis set on the circuit complexity is very important in quantum algorithm design. Electronic structure calculations should be performed with an appropriate boundary condition. Simply using a wave function ansatz designed for molecular systems in a material system with a periodic boundary condition may lead to significant errors. Artificial boundary conditions can be used to partition a large system into smaller fragments to save quantum resources. The basis sets and boundary conditions are expected to play a crucial role in electronic structure calculations on future quantum computers, especially for realistic systems.