arXiv:2403.08519 · The Journal of Chemical Physics
Projective quantum eigensolver via adiabatically decoupled subsystem evolution: A resource efficient approach to molecular energetics in noisy quantum computers
Quantum computers hold immense potential in the field of chemistry, ushering new frontiers to solve complex many-body problems that are beyond the reach of classical computers. However, noise in the current quantum hardware limits their applicability to large chemical systems. This work encompasses the development of a projective formalism that aims to compute ground-state energies of molecular systems accurately using noisy intermediate scale quantum (NISQ) hardware in a resource-efficient manner. Our approach is reliant upon the formulation of a bipartitely decoupled parameterized ansatz within the disentangled unitary coupled cluster framework based on the principles of nonlinear dynamics and synergetics. Such decoupling emulates total parameter optimization in a lower dimensional manifold, while a mutual synergistic relationship among the parameters is exploited to ensure characteristic accuracy via a non-iterative energy correction. Without any pre-circuit measurements, our method leads to a highly compact fixed-depth ansatz with shallower circuits and fewer expectation value evaluations. Through analytical and numerical demonstrations, we establish the method's superior performance under noise while concurrently ensuring requisite accuracy in future fault-tolerant systems. This approach enables rapid exploration of emerging chemical spaces by the efficient utilization of near-term quantum hardware resources.
Quantum computers hold immense potential in the field of chemistry, ushering new frontiers to solve complex many-body problems that are beyond the reach of classical computers. However, noise in the current quantum hardware limits their applicability to large chemical systems. This work encompasses the development of a projective formalism that aims to compute ground-state energies of molecular systems accurately using noisy intermediate scale quantum (NISQ) hardware in a resource-efficient manner. Our approach is reliant upon the formulation of a bipartitely decoupled parameterized ansatz within the disentangled unitary coupled cluster framework based on the principles of nonlinear dynamics and synergetics. Such decoupling emulates total parameter optimization in a lower dimensional manifold, while a mutual synergistic relationship among the parameters is exploited to ensure characteristic accuracy via a non-iterative energy correction. Without any pre-circuit measurements, our method leads to a highly compact fixed-depth ansatz with shallower circuits and fewer expectation value evaluations. Through analytical and numerical demonstrations, we establish the method's superior performance under noise while concurrently ensuring requisite accuracy in future fault-tolerant systems. This approach enables rapid exploration of emerging chemical spaces by the efficient utilization of near-term quantum hardware resources.
In recent times, a variety of hybrid quantum-classical algorithms have been developed that aim to calculate the ground state energies of molecular systems on Noisy Intermediate-Scale Quantum (NISQ) devices. Albeit the utilization of shallow depth circuits in these algorithms, the optimization of ansatz parameters necessitates a substantial number of quantum measurements, leading to prolonged runtimes on the scantly available quantum hardware. Through our work, we lay the general foundation for an interdisciplinary approach that can be used to drastically reduce the dependency of these algorithms on quantum infrastructure. We showcase these pertinent concepts within the framework of the recently developed Projective Quantum Eigensolver (PQE) that involves iterative optimization of the nonlinearly coupled parameters through repeated residue measurements on quantum hardware. We demonstrate that one may perceive such a nonlinear optimization problem as a collective dynamic interplay of fast and slow relaxing modes. As such, the synergy among the parameters is exploited using an on-the-fly supervised machine learning protocol that dynamically casts the PQE optimization into a smaller subspace by reducing the effective degrees of freedom. We demonstrate analytically and numerically that our proposed methodology ensures a drastic reduction in the number of quantum measurements necessary for the parameter updates without compromising the characteristic accuracy. Furthermore, the machine learning model may be tuned to capture the noisy data of NISQ devices, and thus the predicted energy is shown to be resilient under a given noise model.
Determination of molecular energetics and properties is one of the core challenges in the near-term quantum computing. To this end, hybrid quantum-classical algorithms are preferred for Noisy Intermediate Scale Quantum (NISQ) architectures. The Projective Quantum Eigensolver (PQE) is one such algorithms that optimizes the parameters of the chemistry-inspired unitary coupled cluster (UCC) ansatz using a conventional coupled cluster-like residual minimization. Such a strategy involves the projection of the Schrodinger equation on to linearly independent basis towards the parameter optimization, restricting the ansatz is solely defined in terms of the excitation operators. This warrants the inclusion of high-rank operators for strongly correlated systems, leading to increased utilization of quantum resources. In this manuscript, we develop a methodology for determining the generalized operators in terms of a closed form residual equations in the PQE framework that can be efficiently implemented in a quantum computer with manageable quantum resources. Such a strategy requires the removal of the underlying redundancy in high-rank excited determinants, generated due to the presence of the generalized operators in the ansatz, by projecting them on to an internally contracted lower dimensional manifold. With the application on several molecular systems, we have demonstrated our ansatz achieves similar accuracy to the (disentangled) UCC with singles, doubles and triples (SDT) ansatz, while utilizing an order of magnitude fewer quantum gates. Furthermore, when simulated under stochastic Gaussian noise or depolarizing hardware noise, our method shows significantly improved noise resilience compared to the other members of PQE family and the state-of-the-art variational quantum eigensolver.
Quantum computing has emerged as a transformative approach for tackling complex problems in quantum chemistry, particularly in simulating multielectron systems and electron-phonon interactions. However, the current noisy intermediate-scale quantum (NISQ) devices face significant challenges in implementing practical quantum algorithms due to error accumulation caused by increased circuit depth, qubit counts, and gate operations. To address these challenges, we present TenCirChem, an open-source Python package specifically designed for implementing variational quantum algorithms in quantum computational chemistry. TenCirChem demonstrates exceptional performance in simulating unitary coupled-cluster circuits through its innovative use of compact representations for quantum states and excitation operators. This package supports noisy circuit simulation and provides advanced algorithms for variational quantum dynamics, enabling researchers to explore complex chemical phenomena. Its capabilities are exemplified in various applications, including the calculation of potential energy curves and the investigation of quantum gate error impacts on molecular systems. Moreover, TenCirChem’s seamless integration with real quantum hardware makes it a versatile tool for both simulation and experimentation. A key innovation developed within the TenCirChem framework is the Clifford-based Hamiltonian engineering approach for molecules (CHEM). This algorithm addresses the critical challenge of achieving chemical accuracy with shallow quantum circuits, a fundamental requirement for practical applications on NISQ devices. CHEM employs a sophisticated Clifford-based Hamiltonian transformation that operates within the variational quantum eigensolver (VQE) framework using hardware-efficient ansatz. The method ensures four crucial advantages: (1) generation of initial circuit parameters corresponding to Hartree-Fock energy, (2) maximization of initial energy gradients with respect to circuit parameters, (3) minimal classical processing overhead without additional quantum resource requirements, and (4) compatibility with any circuit topology. Through quantum hardware emulator demonstrations, CHEM has achieved chemical accuracy for systems up to 12 qubits with fewer than 30 two-qubit gates, representing a significant advancement in practical quantum computational chemistry. To enhance the efficiency of variational quantum algorithms, we developed the sequential optimization with approximate parabola (SOAP) method, specifically designed for parameter optimization in unitary coupled-cluster ansatz. SOAP addresses the critical bottleneck of measurement requirements in VQE by implementing an innovative optimization strategy that approximates the energy landscape as quadratic functions. This approach minimizes the number of energy evaluations while incorporating parameter correlations through the integration of average directions from previous iterations. Benchmark studies demonstrate SOAP’s superior performance, showing faster convergence and enhanced noise robustness compared to traditional optimization methods. The method’s scalability has been validated through numerical simulations of up to 20 qubits, and its practical efficacy has been confirmed through experiments on superconducting quantum computers. For simulating electron-phonon systems, we introduce a variational basis state encoding algorithm that significantly reduces resource requirements compared to conventional unary and binary encoding schemes. Our approach achieves smaller scaling than traditional methods for qubits and gates for systems obeying the area law of entanglement entropy, this remarkable reduction in resource requirements comes at the cost of a constant amount of additional measurements. The algorithm’s effectiveness has been validated through both numerical simulations and quantum hardware experiments, demonstrating that using just one or two qubits per phonon mode can produce quantitatively accurate results across various coupling regimes. The integration of these innovations within the TenCirChem library represents a significant advancement in quantum computational chemistry. The software package provides researchers with a comprehensive toolkit for developing, testing, and implementing quantum algorithms, while the novel methods address fundamental challenges in circuit depth, parameter optimization, and resource efficiency. These developments collectively enhance the practicality of quantum computing for addressing real-world chemical problems in the NISQ era, offering improved accuracy, efficiency, and noise robustness.
Recent advances in quantum information and quantum science have inspired the development of various compact, dynamically structured ansätze that are expected to be realizable in Noisy Intermediate-Scale Quantum (NISQ) devices. However, such ansätze construction strategies hitherto developed involve considerable measurements, and thus, they deviate significantly in the NISQ platform from their ideal structures. Therefore, it is imperative that the usage of quantum resources be minimized while retaining the expressivity and dynamical structure of the ansatz that can adapt itself depending on the degree of correlation. We propose a novel ansatz construction strategy based on the ab initio many-body perturbation theory that requires no pre-circuit measurement and, thus, remains structurally unaffected by any hardware noise. The accuracy and quantum complexity associated with the ansatz are solely dictated by a pre-defined perturbative order, as desired, and, hence, are tunable. Furthermore, the underlying perturbative structure of the ansatz construction pipeline enables us to decompose any high-rank excitation that appears in higher perturbative orders into the product of various low-rank operators, and it thus keeps the execution gate-depth to its minimum. With a number of challenging applications on strongly correlated systems, we demonstrate that our ansatz performs significantly better, both in terms of accuracy, parameter count, and circuit depth, in comparison to the allied unitary coupled cluster based ansätze.
New approaches into computational quantum chemistry can be developed through the use of quantum computing. While universal, fault-tolerant quantum computers are still not available, and we want to utilize today's noisy quantum processors. One of their flagship applications is the variational quantum eigensolver (VQE)-an algorithm for calculating the minimum energy of a physical Hamiltonian. In this study, we investigate how various types of errors affect the VQE and how to efficiently use the available resources to produce precise computational results. We utilize a simulator of a noisy quantum device, an exact statevector simulator, and physical quantum hardware to study the VQE algorithm for molecular hydrogen. We find that the optimal method of running the hybrid classical-quantum optimization is to: (i) allow some noise in intermediate energy evaluations, using fewer shots per step and fewer optimization iterations, but ensure a high final readout precision; (ii) emphasize efficient problem encoding and ansatz parametrization; and (iii) run all experiments within a short time-frame, avoiding parameter drift with time. Nevertheless, current publicly available quantum resources are still very noisy and scarce/expensive, and even when using them efficiently, it is quite difficult to perform trustworthy calculations of molecular energies.
Quantum chemistry models atoms and molecules using quantum mechanics, with the electronic structure problem at its core. This problem, which determines the energy and properties of electrons in a molecule, is exponentially hard to solve exactly on classical computers. To approximate solutions, effective models introduce layers of simplifications. However, these approximations can fail for strongly correlated systems, necessitating alternative approaches. Quantum computers, capable of processing quantum information natively, offer a promising path to simulate molecular systems beyond classical reach, with potential applications in catalysis, materials science, and photochemistry. Despite rapid advancements in quantum hardware, practical quantum computations remain challenging due to limited resources. This thesis optimizes quantum resource usage in computational chemistry, introducing novel embedding techniques and exploring applications beyond ground-state energies. Chapter 1 establishes the foundation by reviewing quantum chemistry methods, from Hartree-Fock and Density Functional Theory (DFT) to active space approaches. It also provides an introduction to quantum computing for chemistry, focusing on near-term algorithms. The following chapters present novel methods aimed at reducing quantum resource requirements and tackling problems classical methods struggle with. Chapter 2 introduces a technique to reduce the λ-norm of the electronic structure Hamiltonian, a key measure of quantum resource demand. By transforming molecular orbitals, this method enhances sampling efficiency in Noisy Intermediate-Scale Quantum (NISQ) algorithms and reduces runtime in Fault-Tolerant Quantum Computing (FTQC). Localized orbitals outperform canonical ones, and an orbital-optimization scheme is proposed to minimize the λ-norm. Benchmarks on hydrogen chains, FeMoco, and Ruthenium complexes demonstrate its effectiveness. Chapter 3 presents the FragPT2 framework for simulating large systems with multiple interacting fragments. This method embeds each fragment in the mean field of others and applies multi-reference perturbation theory to capture inter-fragment correlations such as dispersion and charge transfer efficiently. The approach reduces computational overhead and enables scalable simulations, as shown in applications to \ce{N2} dimers, aromatic dimers, and butadiene. Chapter 4 focuses on photochemical systems, where multiple electronic states must be treated equally. The state-averaged orbital-optimized variational quantum eigensolver (SAOOVQE) is extended with analytical energy gradients and non-adiabatic couplings, enabling geometry optimizations and simulations of non-adiabatic dynamics on quantum hardware. This is demonstrated by locating the conical intersection in formaldimine, highlighting SAOOVQE’s potential for studying photoisomerization in biomolecules. Building on this, Chapter 5 develops a quantum algorithm to detect conical intersections, where the Born-Oppenheimer approximation breaks down. These intersections are characterized by a discrete Berry phase (0 or π), representing their topological nature. The algorithm extracts this phase as a single bit of information, ensuring resilience to noise. Analytical proof and numerical validation using a toy molecular model illustrate its effectiveness for studying light-perception biochemistry and related photochemical processes. Finally, Chapter 6 explores machine learning density functionals trained on noisy quantum data. While DFT is computationally efficient, its accuracy depends on approximated exchange-correlation functionals. This work proposes a neural network-based approach to learn the exact functional from quantum data, showing that training on noisy outputs from NISQ devices can mitigate sampling errors. Applications to the Fermi-Hubbard model and other systems demonstrate its potential to generalize and provide accurate results under noise. This thesis advances quantum computational chemistry by optimizing quantum resource usage, developing new embedding strategies, and expanding the scope of quantum simulations beyond ground-state properties. These contributions pave the way for practical quantum algorithms that could revolutionize molecular simulations in the near future.