High Resolution Image Download MS PowerPoint Slide Chemical simulation is a key application area that can leverage the power of quantum computers. A chemical simulator that implements a grid-based first quantization method has promising characteristics, but an implementation fully in quantum circuits seems to have not been published. Here, we present “crsQ” (chemical reaction simulator Q), which is a quantum circuit generator that generates such a chemical simulator. The generated simulator is capable of antisymmetrization of the initial wave function and time-evolution of the wave function based on the Suzuki–Trotter decomposition. The potential energy term of the Hamiltonian is implemented using arithmetic gates, such as adders, subtractors, multipliers, dividers, and square roots. Circuit diagrams and output samples are shown. The number of qubits in the circuits scales on the order of O (η log η), where η is the number of electrons. Each component of the generated circuit was verified in unit tests. Along with this development, we designed frameworks to ease the development of large-scale circuits, namely, a temporary qubit allocation framework and an abstract syntax tree framework for arithmetic formulas. These frameworks are expected to be useful in large-scale quantum circuit generators.
High Resolution Image Download MS PowerPoint Slide Chemical simulation is a key application area that can leverage the power of quantum computers. A chemical simulator that implements a grid-based first quantization method has promising characteristics, but an implementation fully in quantum circuits seems to have not been published. Here, we present “crsQ” (chemical reaction simulator Q), which is a quantum circuit generator that generates such a chemical simulator. The generated simulator is capable of antisymmetrization of the initial wave function and time-evolution of the wave function based on the Suzuki–Trotter decomposition. The potential energy term of the Hamiltonian is implemented using arithmetic gates, such as adders, subtractors, multipliers, dividers, and square roots. Circuit diagrams and output samples are shown. The number of qubits in the circuits scales on the order of O (η log η), where η is the number of electrons. Each component of the generated circuit was verified in unit tests. Along with this development, we designed frameworks to ease the development of large-scale circuits, namely, a temporary qubit allocation framework and an abstract syntax tree framework for arithmetic formulas. These frameworks are expected to be useful in large-scale quantum circuit generators.
Quantum computers can potentially simulate quantum-mechanical phenomena, so chemical reactions are a potential application of them. In particular, the time evolution of the wavefunctions should be simulated because chemical reactions are accompanied by structural changes. In this study, to pave the way to achieving such wavefunction simulations, we decompose chemical reactions into their main parts and comprehensively show the minimum essential circuits for simulating each part. An antisymmetrized initial state is constructed using ancillae. Chemical reactions should be simulated in two different ways, where the difference is whether the ancillae are released or not. When they are released, the whole electronic system is simulated. When they are not released, orbital information is obtained. These ways are hence complementary.
Abstract We present a comprehensive end-to-end framework for simulating the real-time dynamics of chemical systems on a fault-tolerant quantum computer, incorporating both electronic and nuclear quantum degrees of freedom. An all-particle simulation is nominally efficient on a quantum computer, but practically infeasible. Hence, central to our approach is the construction of a first-quantized plane-wave algorithm making use of pseudoions. The latter consolidate chemically inactive electrons and the nucleus into a single effective dynamical ionic entity, extending the well-established concept of pseudopotentials in quantum chemistry to a two-body interaction. We explicitly describe efficient quantum circuits for initial state preparation across all degrees of freedom, as well as for block-encoding the Hamiltonian describing interacting pseudoions and chemically active electrons, by leveraging recent advances in quantum rejection sampling to optimize the implementations. To extract useful chemical information, we first design molecular fingerprints by combining density-functional calculations with machine learning techniques, and subsequently validate them through surrogate classical molecular dynamics simulations. These fingerprints are then coherently encoded on a quantum computer for efficient molecular identification via amplitude estimation. We provide an extensive analysis of the cost of running the algorithm on a fault-tolerant quantum computer for several chemically interesting systems. As an illustration, simulating the interaction between NH3 and BF3 (a 40-particle system) requires 808 logical qubits to encode the problem, and approximately 10^11 Toffoli gates per femtosecond of time evolution. Our results establish a foundation for further quantum algorithm development targeting chemical and material dynamics.
Simulations of chemical dynamics are a powerful means for understanding chemistry. However, classical computers struggle to simulate many chemical processes, especially non-adiabatic ones, where the Born-Oppenheimer approximation breaks down. Quantum computers could simulate quantum-chemical dynamics more efficiently than classical computers, but there is currently no complete quantum algorithm for calculating dynamical observables to within a known error. Here, we develop an efficient, end-to-end quantum algorithm for simulating chemical dynamics that avoids all uncontrolled approximations (including the Born-Oppenheimer approximation) and whose error is bounded subject to mild assumptions. To do so, we treat the nuclei and the electrons on an equal footing and simulate the full molecular wavefunction on a momentum-space grid in first quantization, including all algorithmic steps: initial-state preparation, time evolution using qubitization, and measurement of chemical observables such as reaction yields and rates. Our work gives the first algorithm for quantum simulation of chemistry whose end-to-end complexity achieves sublinear scaling in the size of the grid. We achieve this by developing an exponentially faster method for initial-state-preparation. Photochemistry is a likely early application of our algorithm and we estimate resources required for end-to-end simulations of non-adiabatic dynamics of atmospherically important molecules. Classically intractable photochemical computations could be performed using resources comparable to those required for other chemical applications of quantum computing.
In this work, we present a quantum algorithm for direct first-principles simulation of electron-nuclear dynamics on a first-quantized real-space grid. Our algorithm achieves best-in-class efficiency for block-encoding the pre-Born-Oppenheimer molecular Hamiltonian by harnessing the linear scaling of swap networks for implementing the quadratic number of particle interactions, while using a novel alternating sign implementation of the Coulomb interaction that exploits highly optimized arithmetic routines. We benchmark our approach for a series of scientifically and industrially relevant chemical reactions. We demonstrate over an order-of-magnitude reduction in costs compared to previous state-of-the-art for the NH3+BF3 reaction, achieving a Toffoli cost of 8.7×109 per femtosecond using 1362 logical qubits (system + ancillas). Our results significantly lower the resources required for fault-tolerant simulations of photochemical reactions, while providing a suite of algorithmic primitives that are expected to serve as foundational building blocks for a broader class of quantum algorithms.
The electronic energies of molecules have been successfully evaluated on quantum computers. However, more attention is paid to the dynamics simulation of molecules in practical applications. Based on the variational quantum eigensolver (VQE) algorithm, Fedorov et al. proposed a correlated sampling (CS) method and demonstrated the vibrational dynamics of H2 molecules [J. Chem. Phys. 154, 164103 (2021)]. In this study, we have developed a quantum approach by extending the CS method based on the VQE algorithm (labeled eCS-VQE) for simulating chemical reaction dynamics. First, the CS method is extended to the three-dimensional cases for calculation of first-order energy gradients, and then, it is further generalized to calculate the second-order gradients of energies. By calculating atomic forces and vibrational frequencies for H2, LiH, H+ + H2, and Cl- + CH3Cl systems, we have seen that the approach has achieved the CCSD level of accuracy. Thus, we have simulated dynamics processes for two typical chemical reactions, hydrogen exchange and chlorine substitution, and obtained high-precision reaction dynamics trajectories consistent with the classical methods. Our eCS-VQE approach, as measurement expectations and ground-state wave functions can be reused, is less demanding in quantum computing resources and is, therefore, a feasible means for the dynamics simulation of chemical reactions on the current noisy intermediate-scale quantum-era quantum devices.
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.