From transistor to trapped-ion computers for quantum chemistry

A comprehensive review of quantum machine learning: from NISQ to fault tolerance

Quantum machine learning, which involves running machine learning algorithms on quantum devices, has garnered significant attention in both academic and business circles. In this paper, we offer a comprehensive and unbiased review of the various concepts that have emerged in the field of quantum machine learning. This includes techniques used in Noisy Intermediate-Scale Quantum (NISQ) technologies and approaches for algorithms compatible with fault-tolerant quantum computing hardware. Our review covers fundamental concepts, algorithms, and the statistical learning theory pertinent to quantum machine learning.

Size-consistency and orbital-invariance issues revealed by VQE-UCCSD calculations with the FMO scheme

The fragment molecular orbital (FMO) scheme is one of the popular fragmentation-based methods and has the potential advantage of making the circuit shallow for quantum chemical calculations on quantum computers. In this study, we used a GPU-accelerated quantum simulator (cuQuantum) to perform the electron correlation part of the FMO calculation as unitary coupled-cluster singles and doubles (UCCSD) with the variational quantum eigensolver (VQE) for hydrogen-bonded (FH)  3 and (FH)  2 -H  2 O systems with the STO-3G basis set. VQE-UCCSD calculations were performed using both canonical and localized MO sets, and the results were examined from the point of view of size-consistency and orbital-invariance affected by the Trotter error. It was found that the use of localized MO leads to better results, especially for (FH)  2 -H  2 O. The GPU acceleration was substantial for the simulations with larger numbers of qubits, and was about a factor of 6.7-7.7 for 18 qubit systems.

Electric Field Gradient Calculations for Ice VIII and IX Using Polarizable Embedding: A Comparative Study on Classical Computers and Quantum Simulators

We test the performance of the polarizable embedding variational quantum eigensolver self-consistent field (PE-VQE-SCF) model for computing electric field gradients with comparisons to conventional complete active space self-consistent-field (CASSCF) calculations and experimental results. We compute quadrupole coupling constants for ice VIII and ice IX. We find close agreement of the quantum-computing PE-VQE-SCF results with the results from the classical PE-CASSCF calculations and with experiment. Furthermore, we observe that the inclusion of the environment is crucial for obtaining results that match the experimental data. The calculations for ice VIII are within the experimental uncertainty for both CASSCF and VQE-SCF for oxygen and lie close to the experimental value for ice IX as well. With the VQE-SCF, which is based on an adaptive derivative-assembled problem-tailored (ADAPT) ansatz, we find that the inclusion of the environment and the size of the different basis sets do not directly affect the gate counts. However, by including an explicit environment, the wavefunction and therefore the optimization problem become more complicated, which usually results in the need to include more operators from the operator pool, thereby increasing the depth of the circuit.

The variational quantum eigensolver self-consistent field method within a polarizable embedded framework

We formulate and implement the Variational Quantum Eigensolver Self Consistent Field (VQE-SCF) algorithm in combination with polarizable embedding (PE), thereby extending PE to the regime of quantum computing. We test the resulting algorithm, PE-VQE-SCF, on quantum simulators and demonstrate that the computational stress on the quantum device is only slightly increased in terms of gate counts compared to regular VQE-SCF. On the other hand, no increase in shot noise was observed. We illustrate how PE-VQE-SCF may lead to the modeling of real chemical systems using a simulation of the reaction barrier of the Diels-Alder reaction between furan and ethene as an example.

Chemically Accurate Potential Curves for H2 Molecules Using Explicitly Correlated Qubit-ADAPT

With the recent advances in the development of devices capable of performing quantum computations, a growing interest in finding near-term applications has emerged in many areas of science. In the era of nonfault tolerant quantum devices, algorithms that only require comparably short circuits accompanied by high repetition rates are considered to be a promising approach for assisting classical machines with finding a solution on computationally hard problems. The ADAPT approach previously introduced in Nat. Commun. 10, 3007 (2019) extends the class of variational quantum eigensolver algorithms with dynamically growing ansätze in order to find approximations to the ground and excited state energies of molecules. In this work, the ADAPT algorithm has been combined with a first-quantized formulation for the hydrogen molecule in the Born-Oppenheimer approximation, employing the explicitly correlated basis functions introduced in J. Chem. Phys. 43, 2429 (1965). By the virtue of their explicit electronic correlation properties, it is shown in classically performed simulations that chemical accuracy (<1.6 mHa) can be reached for ground and excited state potential curves using reasonably short circuits.

Fermionic Reduced Density Low-Rank Matrix Completion, Noise Filtering, and Measurement Reduction in Quantum Simulations

Fermionic reduced density matrices summarize the key observables in Fermionic systems. In electronic systems, the two-particle reduced density matrix (2-RDM) is sufficient to determine the energy and most physical observables of interest. Here, we consider the possibility of using matrix completion to reconstruct the two-particle reduced density matrix to chemical accuracy from partial information. We consider the case of noiseless matrix completion, where the partial information corresponds to a subset of the 2-RDM elements, as well as noisy completion, where the partial information corresponds to both a subset of elements and statistical noise in their values. Through experiments on a set of 24 molecular systems, we find that 2-RDM can be efficiently reconstructed from a reduced amount of information. In the case of noisy completion, this results in a multiple orders of magnitude reduction in the number of measurements needed to determine the 2-RDM with chemical accuracy. These techniques can be readily applied to both classical and quantum algorithms for quantum simulations.

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.

Accurate and efficient calculations of Hellmann-Feynman forces for quantum computation

First-order derivatives of energies with respect to atomic coordinates are widely computed and used in quantum chemistry simulations. The rapidly emerging technology of quantum computing offers a new paradigm for solving relevant quantum chemistry equations. In this work, we have achieved analytical calculations of atomic forces based on the Hellmann-Feynman theorem within the framework of the variational quantum eigensolver. The accuracy of the approach is demonstrated by calculating the atomic forces of H2, LiH, H2O, and NH3 molecules, which are in excellent agreement with values obtained from full configuration interaction calculations. In particular, for systems with degenerate molecular orbitals, the analytical approach has a significant accuracy advantage over finite-difference-based methods and will not involve additional computational effort on a quantum computer. The calculated forces are further used to optimize the geometries of NH3 and CH4 molecules and to perform ab initio molecular dynamics simulations for the umbrella inversion of NH3, demonstrating the feasibility of the approach in practical quantum chemistry simulations.

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.

Amplitude Reordering Accelerates the Adaptive Variational Quantum Eigensolver Algorithms

The variational quantum eigensolver (VQE) algorithm can simulate the chemical systems such as molecules in the noisy-intermediate-scale quantum devices and shows promising applications in quantum chemistry simulations. The accuracy and computational cost of the VQE simulations are determined by the underlying ansatz. Therefore, the most important issue is to generate a compact and accurate ansatz, which requires a shallower parametric quantum circuit and can achieve an acceptable accuracy. The newly developed adaptive algorithms (AAs) such as the adaptive derivative-assembled pseudo-Trotter VQE (ADAPT-VQE) can solve this issue via generating compact and accurate ansatzes. However, these AAs show very low computational efficiency because they require a large number of additional measurements. Here we propose an amplitude reordering (AR) strategy to accelerate the promising but expensive AAs by adding operators in a "batched" fashion in a way that their order is still quasi-optimal. We first introduce the AR method into ADAPT-VQE and build the AR-ADAPT-VQE algorithm. We then endow the energy-sorting VQE (ES-VQE) algorithm with the adaptive feature and introduce the AR into AES-VQE to form the AR-AES-VQE algorithm. To demonstrate the performance of these algorithms, we calculate the dissociation curves of three small molecules, LiH, linear BeH₂, and linear H₆, by using (AR-)ADAPT-VQE and (AR-)AES-VQE algorithms. It is found that all of the AR-equipped AAs (AR-AAs) can significantly reduce the number of iterations and subsequently accelerate the calculations with a speedup of up to more than ten times without the obvious loss of accuracy. The final ansatz generated by the AR-AAs not only avoids extra circuit depth but also maintains the computational accuracy; sometimes the AR-AAs even outperforms their original counterparts.

Quantum Algorithm of the Divide-and-Conquer Unitary Coupled Cluster Method with a Variational Quantum Eigensolver

The variational quantum eigensolver (VQE) with shallow or constant-depth quantum circuits is one of the most pursued approaches in the noisy intermediate-scale quantum (NISQ) devices with incoherent errors. In this study, the divide-and-conquer (DC) linear scaling technique, which divides the entire system into several fragments, is applied to the VQE algorithm based on the unitary coupled cluster (UCC) method, denoted as DC-qUCC/VQE, to reduce the number of required qubits. The unitarity of the UCC ansatz that enables the evaluation of the total energy as well as various molecular properties as expectation values can be easily implemented on quantum devices because the quantum gates are unitary operators themselves. Based on this feature, the present DC-qUCC/VQE algorithm is designed to conserve the total number of electrons in the entire system using the density matrix evaluated on a quantum computer. Numerical assessments clarified that the energy errors of the DC-qUCC/VQE calculations decrease by using the constraint of the total number of electrons. Furthermore, the DC-qUCC/VQE algorithm could reduce the number of quantum gates and shows the possibility of decreasing incoherent errors.

Multilevel 2-D Quantum Wavelet Transforms

Wavelet transform is being widely used in classical image processing. One-dimension quantum wavelet transforms (QWTs) have been proposed. Generalizations of the 1-D QWT into multilevel and multidimension have been investigated but restricted to the quantum wavelet packet transform (QWPTs), which is the direct product of 1-D QWPTs, and there is no transform between the packets in different dimensions. A 2-D QWT is vital for image processing. We construct the multilevel 2-D QWT's general theory. Explicitly, we built multilevel 2-D Haar QWT and the multilevel Daubechies D4 QWT, respectively. We have given the complete quantum circuits for these wavelet transforms, using both noniterative and iterative methods. Compared to the 1-D QWT and wavelet packet transform, the multilevel 2-D QWT involves the entanglement between components in different degrees. Complexity analysis reveals that the proposed transforms offer exponential speedup over their classical counterparts. Also, the proposed wavelet transforms are used to realize quantum image compression. Simulation results demonstrate that the proposed wavelet transforms are significant and obtain the same results as their classical counterparts with an exponential speedup.

QForte: An Efficient State-Vector Emulator and Quantum Algorithms Library for Molecular Electronic Structure

We introduce a novel open-source software package QForte, a comprehensive development tool for new quantum simulation algorithms. QForte incorporates functionality for handling molecular Hamiltonians, Fermionic encoding, ansatz construction, time evolution, and state-vector emulation, requiring only a classical electronic structure package as a dependency. QForte also contains black-box implementations of a wide variety of quantum algorithms, including variational and projective quantum eigensolvers, adaptive eigensolvers, quantum imaginary time evolution, and quantum Krylov methods. We highlight two features of QForte: (i) how the Python class structure of QForte enables the facile implementation of new algorithms, and (ii) how existing algorithms can be executed in just a few lines of code.

Variational quantum eigensolver simulations with the multireference unitary coupled cluster ansatz: a case study of the C2v quasi-reaction pathway of beryllium insertion to H2 molecule

Variational quantum eigensolver (VQE)-based quantum chemical calculations have been extensively studied as a computational model using noisy intermediate-scale quantum devices. VQE uses a parametrized quantum circuit defined through an “ansatz”...

Quantum Machine-Learning for Eigenstate Filtration in Two-Dimensional Materials

Quantum machine-learning algorithms have emerged to be a promising alternative to their classical counterparts as they leverage the power of quantum computers. Such algorithms have been developed to solve problems like electronic structure calculations of molecular systems and spin models in magnetic systems. However, the discussion in all these recipes focuses specifically on targeting the ground state. Herein we demonstrate a quantum algorithm that can filter any energy eigenstate of the system based on either symmetry properties or a predefined choice of the user. The workhorse of our technique is a shallow neural network encoding the desired state of the system with the amplitude computed by sampling the Gibbs-Boltzmann distribution using a quantum circuit and the phase information obtained classically from the nonlinear activation of a separate set of neurons. We show that the resource requirements of our algorithm are strictly quadratic. To demonstrate its efficacy, we use state filtration in monolayer transition metal dichalcogenides which are hitherto unexplored in any flavor of quantum simulations. We implement our algorithm not only on quantum simulators but also on actual IBM-Q quantum devices and show good agreement with the results procured from conventional electronic structure calculations. We thus expect our protocol to provide a new alternative in exploring the band structures of exquisite materials to usual electronic structure methods or machine-learning techniques that are implementable solely on a classical computer.

Bayesian phase difference estimation: a general quantum algorithm for the direct calculation of energy gaps

Quantum computers can perform full configuration interaction (full-CI) calculations by utilising the quantum phase estimation (QPE) algorithms including Bayesian phase estimation (BPE) and iterative quantum phase estimation (IQPE). In these quantum algorithms, the time evolution of wave functions for atoms and molecules is simulated conditionally with an ancillary qubit as the control, which make implementation to real quantum devices difficult. Also, most of the problems in chemistry discuss energy differences between two electronic states rather than total energies themselves, and thus direct calculations of energy gaps are promising for future applications of quantum computers to real chemistry problems. In the race of finding efficient quantum algorithms to solve quantum chemistry problems, we test a Bayesian phase difference estimation (BPDE) algorithm, which is a general algorithm to calculate the difference of two eigenphases of unitary operators in the several cases of the direct calculations of energy gaps between two electronic states on quantum computers, including vertical ionisation energies, singlet-triplet energy gaps, and vertical excitation energies. In the BPDE algorithm, state preparation is carried out conditionally on the ancillary qubit, and the time evolution of the wave functions in superposition of two electronic states are executed unconditionally. Based on our test, we conclude that BPDE is capable of computing the energy gap with an accuracy similar to BPE without controlled-time evolution simulations and with the smaller number of iterations in Bayesian optimisations.

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

Band structure is a cornerstone to understand the electronic properties of materials. Accurate band structure calculations using a high-level quantum chemistry theory can be computationally very expensive. It is promising to speed up such calculations with a quantum computer. In this study, we present a quantum algorithm for band structure calculations based on the equation-of-motion (EOM) theory. First, we introduce a new variational quantum eigensolver algorithm named ADAPT-C for ground-state quantum simulation of solids, where the wave function is built adaptively from a complete set of anti-Hermitian operators. Then, on top of the ADAPT-C ground state, quasiparticle energies and the band structure can be calculated using the EOM theory in a quantum-subspace-expansion style, where the projected excitation operators guarantee that the killer condition is satisfied. As a proof of principle, such an EOM-ADAPT-C protocol is used to calculate the band structures of silicon and diamond using a quantum computer simulator.

Analog quantum simulation of chemical dynamics

Ultrafast chemical reactions are difficult to simulate because they involve entangled, many-body wavefunctions whose computational complexity grows rapidly with molecular size. In photochemistry, the breakdown of the Born-Oppenheimer approximation further complicates the problem by entangling nuclear and electronic degrees of freedom. Here, we show that analog quantum simulators can efficiently simulate molecular dynamics using commonly available bosonic modes to represent molecular vibrations. Our approach can be implemented in any device with a qudit controllably coupled to bosonic oscillators and with quantum hardware resources that scale linearly with molecular size, and offers significant resource savings compared to digital quantum simulation algorithms. Advantages of our approach include a time resolution orders of magnitude better than ultrafast spectroscopy, the ability to simulate large molecules with limited hardware using a Suzuki-Trotter expansion, and the ability to implement realistic system-bath interactions with only one additional interaction per mode. Our approach can be implemented with current technology; e.g., the conical intersection in pyrazine can be simulated using a single trapped ion. Therefore, we expect our method will enable classically intractable chemical dynamics simulations in the near term.

Variational Quantum Chemistry Programs in JaqalPaq

We present example quantum chemistry programs written with JaqalPaq, a python meta-programming language used to code in Jaqal (Just Another Quantum Assembly Language). These JaqalPaq algorithms are intended to be run on the Quantum Scientific Computing Open User Testbed (QSCOUT) platform at Sandia National Laboratories. Our exemplars use the variational quantum eigensolver (VQE) quantum algorithm to compute the ground state energies of the H2, HeH+, and LiH molecules. Since the exemplars focus on how to program in JaqalPaq, the calculations of the second-quantized Hamiltonians are performed with the PySCF python package, and the mappings of the fermions to qubits are obtained from the OpenFermion python package. Using the emulator functionality of JaqalPaq, we emulate how these exemplars would be executed on an error-free QSCOUT platform and compare the emulated computation of the bond-dissociation curves for these molecules with their exact forms within the relevant basis.

Ab initio molecular dynamics on quantum computers

Ab initio molecular dynamics (AIMD) is a valuable technique for studying molecules and materials at finite temperatures where the nuclei evolve on potential energy surfaces obtained from accurate electronic structure calculations. In this work, we present an approach to running AIMD simulations on noisy intermediate-scale quantum (NISQ)-era quantum computers. The electronic energies are calculated on a quantum computer using the variational quantum eigensolver (VQE) method. Algorithms for computation of analytical gradients entirely on a quantum computer require quantum fault-tolerant hardware, which is beyond NISQ-era. Therefore, we compute the energy gradients numerically using finite differences, the Hellmann-Feynman theorem, and a correlated sampling technique. This method only requires additional classical calculations of electron integrals for each degree of freedom without any additional computations on a quantum computer beyond the initial VQE run. As a proof of concept, AIMD simulations are demonstrated for the H₂ molecule on IBM quantum devices. In addition, we demonstrate the validity of the method for larger molecules using full configuration interaction wave functions. As quantum hardware and noise mitigation techniques continue to improve, the method can be utilized for studying larger molecular systems.

Quantum Algorithm for the Direct Calculations of Vertical Ionization Energies

Recently, a quantum algorithm that is capable of directly calculating the energy gap between two electronic states having different spin quantum numbers without inspecting the total energy of the individual electronic states was proposed. This quantum algorithm guarantees an exponential speedup, like quantum phase estimation (QPE)-based full-CI, with much lower costs. In this work, we propose a modified quantum circuit for the direct calculations of spin state energy gaps to reduce the number of qubits and quantum gates, extending the quantum algorithm to the direct calculation of vertical ionization energies. Numerical quantum circuit simulations for the ionization of light atoms (He, Li, Be, B, C, and N) and small molecules (HF, BF, CF, CO, O₂, NO, CN, F₂, H₂O, and NH₃) revealed that the proposed quantum algorithm affords the vertical ionization energies within 0.1 eV of precision.

Nonadiabatic Molecular Quantum Dynamics with Quantum Computers

The theoretical investigation of nonadiabatic processes is hampered by the complexity of the coupled electron-nuclear dynamics beyond the Born-Oppenheimer approximation. Classically, the simulation of such reactions is limited by the unfavorable scaling of the computational resources as a function of the system size. While quantum computing exhibits proven quantum advantage for the simulation of real-time dynamics, the study of quantum algorithms for the description of nonadiabatic phenomena is still unexplored. In this Letter, we propose a quantum algorithm for the simulation of fast nonadiabatic chemical processes together with an initialization scheme for quantum hardware calculations. In particular, we introduce a first-quantization method for the time evolution of a wave packet on two coupled harmonic potential energy surfaces (Marcus model). In our approach, the computational resources scale polynomially in the system dimensions, opening up new avenues for the study of photophysical processes that are classically intractable.

A quantum algorithm for spin chemistry: a Bayesian exchange coupling parameter calculator with broken-symmetry wave functions

The Heisenberg exchange coupling parameter J (H = -2J S i · S j ) characterises the isotropic magnetic interaction between unpaired electrons, and it is one of the most important spin Hamiltonian parameters of multi-spin open shell systems. The J value is related to the energy difference between high-spin and low-spin states, and thus computing the energies of individual spin states are necessary to obtain the J values from quantum chemical calculations. Here, we propose a quantum algorithm, B̲ayesian ex̲change coupling parameter calculator with b̲roken-symmetry wave functions (BxB), which is capable of computing the J value directly, without calculating the energies of individual spin states. The BxB algorithm is composed of the quantum simulations of the time evolution of a broken-symmetry wave function under the Hamiltonian with an additional term j S 2, the wave function overlap estimation with the SWAP test, and Bayesian optimisation of the parameter j. Numerical quantum circuit simulations for H2 under a covalent bond dissociation, C, O, Si, NH, OH+, CH2, NF, O2, and triple bond dissociated N2 molecule revealed that the BxB can compute the J value within 1 kcal mol-1 of errors with less computational costs than conventional quantum phase estimation-based approaches.

Quantum Device Emulates the Dynamics of Two Coupled Oscillators

Our quantum device is a solid-state array of semiconducting quantum dots that is addressed and read by 2D electronic spectroscopy. The experimental ultrafast dynamics of the device is well simulated by solving the time-dependent Schrödinger equation for a Hamiltonian that describes the lower electronically excited states of the dots and three laser pulses. The time evolution induced in the electronic states of the quantum device is used to emulate the quite different nonequilibrium vibrational dynamics of a linear triatomic molecule. We simulate the energy transfer between the two local oscillators and, in a more elaborate application, the expectation values of the quantum mechanical creation and annihilation operators of each local oscillator. The simulation uses the electronic coherences engineered in the device upon interaction with a specific sequence of ultrafast pulses. The algorithm uses the algebraic description of the dynamics of the physical problem and of the hardware.

Hardware efficient quantum algorithms for vibrational structure calculations

We introduce a framework for the calculation of ground and excited state energies of bosonic systems suitable for near-term quantum devices and apply it to molecular vibrational anharmonic Hamiltonians. Our method supports generic reference modal bases and Hamiltonian representations, including the ones that are routinely used in classical vibrational structure calculations. We test different parametrizations of the vibrational wavefunction, which can be encoded in quantum hardware, based either on heuristic circuits or on the bosonic Unitary Coupled Cluster Ansatz. In particular, we define a novel compact heuristic circuit and demonstrate that it provides a good compromise in terms of circuit depth, optimization costs, and accuracy. We evaluate the requirements, number of qubits and circuit depth, for the calculation of vibrational energies on quantum hardware and compare them with state-of-the-art classical vibrational structure algorithms for molecules with up to seven atoms.

Quantum orbital-optimized unitary coupled cluster methods in the strongly correlated regime: Can quantum algorithms outperform their classical equivalents?

The Coupled Cluster (CC) method is used to compute the electronic correlation energy in atoms and molecules and often leads to highly accurate results. However, due to its single-reference nature, standard CC in its projected form fails to describe quantum states characterized by strong electronic correlations and multi-reference projective methods become necessary. On the other hand, quantum algorithms for the solution of many-electron problems have also emerged recently. The quantum unitary variant of CC (UCC) with singles and doubles (q-UCCSD) is a popular wavefunction Ansatz for the variational quantum eigensolver algorithm. The variational nature of this approach can lead to significant advantages compared to its classical equivalent in the projected form, in particular, for the description of strong electronic correlation. However, due to the large number of gate operations required in q-UCCSD, approximations need to be introduced in order to make this approach implementable in a state-of-the-art quantum computer. In this work, we evaluate several variants of the standard q-UCCSD Ansatz in which only a subset of excitations is included. In particular, we investigate the singlet and pair q-UCCD approaches combined with orbital optimization. We show that these approaches can capture the dissociation/distortion profiles of challenging systems, such as H₄, H₂O, and N₂ molecules, as well as the one-dimensional periodic Fermi-Hubbard chain. These results promote the future use of q-UCC methods for the solution of challenging electronic structure problems in quantum chemistry.

A Full Quantum Eigensolver for Quantum Chemistry Simulations

Quantum simulation of quantum chemistry is one of the most compelling applications of quantum computing. It is of particular importance in areas ranging from materials science, biochemistry, and condensed matter physics. Here, we propose a full quantum eigensolver (FQE) algorithm to calculate the molecular ground energies and electronic structures using quantum gradient descent. Compared to existing classical-quantum hybrid methods such as variational quantum eigensolver (VQE), our method removes the classical optimizer and performs all the calculations on a quantum computer with faster convergence. The gradient descent iteration depth has a favorable complexity that is logarithmically dependent on the system size and inverse of the precision. Moreover, the FQE can be further simplified by exploiting a perturbation theory for the calculations of intermediate matrix elements and obtaining results with a precision that satisfies the requirement of chemistry application. The full quantum eigensolver can be implemented on a near-term quantum computer. With the rapid development of quantum computing hardware, the FQE provides an efficient and powerful tool to solve quantum chemistry problems.

Reinforcement learning for semi-autonomous approximate quantum eigensolver

The characterization of an operator by its eigenvectors and eigenvalues allows us to know its action over any quantum state. Here, we propose a protocol to obtain an approximation of the eigenvectors of an arbitrary Hermitian quantum operator. This protocol is based on measurement and feedback processes, which characterize a reinforcement learning protocol. Our proposal is composed of two systems, a black box named environment and a quantum state named agent. The role of the environment is to change any quantum state by a unitary matrix U ˆ E = e − i τ  ˆ E where  ˆ E is a Hermitian operator, and τ is a real parameter. The agent is a quantum state which adapts to some eigenvector of  ˆ E by repeated interactions with the environment, feedback process, and semi-random rotations. With this proposal, we can obtain an approximation of the eigenvectors of a random qubit operator with average fidelity over 90% in less than 10 iterations, and surpass 98% in less than 300 iterations. Moreover, for the two-qubit cases, the four eigenvectors are obtained with fidelities above 89% in 8000 iterations for a random operator, and fidelities of 99% for an operator with the Bell states as eigenvectors. This protocol can be useful to implement semi-autonomous quantum devices which should be capable of extracting information and deciding with minimal resources and without human intervention.

A probabilistic spin annihilation method for quantum chemical calculations on quantum computers

A probabilistic spin annihilation method based on the quantum phase estimation algorithm is presented for quantum chemical calculations on quantum computers. This approach can eliminate more than one spin component from the spin contaminated wave functions by single operation. Comparison with the spin annihilation operation on classical computers is given.

Contextuality Test of the Nonclassicality of Variational Quantum Eigensolvers

Contextuality is an indicator of nonclassicality, and a resource for various quantum procedures. In this Letter, we use contextuality to evaluate the variational quantum eigensolver (VQE), one of the most promising tools for near-term quantum simulation. We present an efficiently computable test to determine whether or not the objective function for a VQE procedure is contextual. We apply this test to evaluate the contextuality of experimental implementations of VQE, and determine that several, but not all, fail this test of quantumness.

Quantum Chemistry in the Age of Quantum Computing

Practical challenges in simulating quantum systems on classical computers have been widely recognized in the quantum physics and quantum chemistry communities over the past century. Although many approximation methods have been introduced, the complexity of quantum mechanics remains hard to appease. The advent of quantum computation brings new pathways to navigate this challenging and complex landscape. By manipulating quantum states of matter and taking advantage of their unique features such as superposition and entanglement, quantum computers promise to efficiently deliver accurate results for many important problems in quantum chemistry, such as the electronic structure of molecules. In the past two decades, significant advances have been made in developing algorithms and physical hardware for quantum computing, heralding a revolution in simulation of quantum systems. This Review provides an overview of the algorithms and results that are relevant for quantum chemistry. The intended audience is both quantum chemists who seek to learn more about quantum computing and quantum computing researchers who would like to explore applications in quantum chemistry.

Improving the Efficiency of the Multireference Driven Similarity Renormalization Group via Sequential Transformation, Density Fitting, and the Noninteracting Virtual Orbital Approximation

This study examines several techniques to improve the efficiency of the linearized multireference driven similarity renormalization group truncated to one- and two-body operators [MR-LDSRG(2)]. We propose a sequential MR-LDSRG(2) [sq-MR-LDSRG(2)] scheme, in which one-body substitutions are folded exactly into the Hamiltonian. This new approach is combined with density fitting (DF) to reduce the storage cost of two-electron integrals. To further avoid storage of large four-index intermediates, we propose a noninteracting virtual orbital (NIVO) approximation of the Baker-Campbell-Hausdorff series that neglects commutators terms with three and four virtual indices. The NIVO approximation reduces the computational prefactor of the MR-LDSRG(2), bringing it closer to that of coupled cluster with singles and doubles (CCSD). We test the effect of the DF and NIVO approximations on the MR-LDSRG(2) and sq-MR-LDSRG(2) methods by computing properties of eight diatomic molecules. The diatomic constants obtained by DF-sq-MR-LDSRG(2)+NIVO are found to be as accurate as those from the original MR-LDSRG(2) and coupled cluster theory with singles, doubles, and perturbative triples. Finally, we demonstrate that the DF-sq-MR-LDSRG(2)+NIVO scheme can be applied to chemical systems with more than 550 basis functions by computing the automerization energy of cyclobutadiene with a quintuple-ζ basis set. The predicted automerization energy is found to be similar to the value computed with Mukherjee's state-specific multireference coupled cluster theory with singles and doubles.

Global entangling gates on arbitrary ion qubits

Quantum computers can efficiently solve classically intractable problems, such as the factorization of a large number¹ and the simulation of quantum many-body systems^2,3. Universal quantum computation can be simplified by decomposing circuits into single- and two-qubit entangling gates⁴, but such decomposition is not necessarily efficient. It has been suggested that polynomial or exponential speedups can be obtained with global N-qubit (N greater than two) entangling gates^5-9. Such global gates involve all-to-all connectivity, which emerges among trapped-ion qubits when using laser-driven collective motional modes^10-14, and have been implemented for a single motional mode^15,16. However, the single-mode approach is difficult to scale up because isolating single modes becomes challenging as the number of ions increases in a single crystal, and multi-mode schemes are scalable^17,18 but limited to pairwise gates^19-23. Here we propose and implement a scalable scheme for realizing global entangling gates on multiple ¹⁷¹Yb⁺ ion qubits by coupling to multiple motional modes through modulated laser fields. Because such global gates require decoupling multiple modes and balancing all pairwise coupling strengths during the gate, we develop a system with fully independent control capability on each ion¹⁴. To demonstrate the usefulness and flexibility of these global gates, we generate a Greenberger-Horne-Zeilinger state with up to four qubits using a single global operation. Our approach realizes global entangling gates as scalable building blocks for universal quantum computation, motivating future research in scalable global methods for quantum information processing.

Digital quantum simulation of molecular vibrations

Molecular vibrations underpin important phenomena such as spectral properties, energy transfer, and molecular bonding. However, obtaining a detailed understanding of the vibrational structure of even small molecules is computationally expensive. While several algorithms exist for efficiently solving the electronic structure problem on a quantum computer, there has been comparatively little attention devoted to solving the vibrational structure problem with quantum hardware. In this work, we discuss the use of quantum algorithms for investigating both the static and dynamic vibrational properties of molecules. We introduce a physically motivated unitary vibrational coupled cluster ansatz, which also makes our method accessible to noisy, near-term quantum hardware. We numerically test our proposals for the water and sulfur dioxide molecules.

Error-Mitigated Digital Quantum Simulation

Variational algorithms may enable classically intractable simulations on near-future quantum computers. However, their potential is limited by hardware errors. It is therefore crucial to develop efficient ways to mitigate these errors. Here, we propose a stabilizerlike method which enables the detection of up to 60%-80% of depolarizing errors. Our method is suitable for near-term quantum hardware. Simulations show that our method can significantly benefit calculations subject to both stochastic and correlated noise, especially when combined with existing error mitigation techniques.

Quantum Chemistry on Quantum Computers: A Method for Preparation of Multiconfigurational Wave Functions on Quantum Computers without Performing Post-Hartree-Fock Calculations

The full configuration interaction (full-CI) method is capable of providing the numerically best wave functions and energies of atoms and molecules within basis sets being used, although it is intractable for classical computers. Quantum computers can perform full-CI calculations in polynomial time against the system size by adopting a quantum phase estimation algorithm (QPEA). In the QPEA, the preparation of initial guess wave functions having sufficiently large overlap with the exact wave function is recommended. The Hartree-Fock (HF) wave function is a good initial guess only for closed shell singlet molecules and high-spin molecules carrying no spin-β unpaired electrons, around their equilibrium geometry, and thus, the construction of multiconfigurational wave functions without performing post-HF calculations on classical computers is highly desired for applying the method to a wide variety of chemistries and physics. In this work, we propose a method to construct multiconfigurational initial guess wave functions suitable for QPEA-based full-CI calculations on quantum computers, by utilizing diradical characters computed from spin-projected UHF wave functions. The proposed approach drastically improves the wave function overlap, particularly in molecules with intermediate diradical characters.

Quantum chemistry on quantum computers: quantum simulations of the time evolution of wave functions under the S2 operator and determination of the spin quantum number S

Quantum computers have an enormous impact on quantum chemical calculations. Approaches to calculate the energies of atoms and molecules on quantum computers by utilizing quantum phase estimation (QPE) and the variational quantum eigensolver (VQE) have been well documented, and dozens of methodological improvements to decrease computational costs and to mitigate errors have been reported until recently. However, the possible methodological implementation of observables on quantum computers such as calculating the spin quantum numbers of arbitrary wave functions, which is a crucial issue in quantum chemistry, has been discussed less. Here, we propose a quantum circuit to simulate the time evolution of wave functions under an S2 operator, exp(-iS2t)|Ψ, and integrate it into the QPE circuit enabling us to determine the spin quantum number of the arbitrary wave functions. We demonstrate that the spin quantum numbers of up to three spins can be determined by only one qubit measurement in QPE.

qTorch: The quantum tensor contraction handler

Classical simulation of quantum computation is necessary for studying the numerical behavior of quantum algorithms, as there does not yet exist a large viable quantum computer on which to perform numerical tests. Tensor network (TN) contraction is an algorithmic method that can efficiently simulate some quantum circuits, often greatly reducing the computational cost over methods that simulate the full Hilbert space. In this study we implement a tensor network contraction program for simulating quantum circuits using multi-core compute nodes. We show simulation results for the Max-Cut problem on 3- through 7-regular graphs using the quantum approximate optimization algorithm (QAOA), successfully simulating up to 100 qubits. We test two different methods for generating the ordering of tensor index contractions: one is based on the tree decomposition of the line graph, while the other generates ordering using a straight-forward stochastic scheme. Through studying instances of QAOA circuits, we show the expected result that as the treewidth of the quantum circuit's line graph decreases, TN contraction becomes significantly more efficient than simulating the whole Hilbert space. The results in this work suggest that tensor contraction methods are superior only when simulating Max-Cut/QAOA with graphs of regularities approximately five and below. Insight into this point of equal computational cost helps one determine which simulation method will be more efficient for a given quantum circuit. The stochastic contraction method outperforms the line graph based method only when the time to calculate a reasonable tree decomposition is prohibitively expensive. Finally, we release our software package, qTorch (Quantum TensOR Contraction Handler), intended for general quantum circuit simulation. For a nontrivial subset of these quantum circuits, 50 to 100 qubits can easily be simulated on a single compute node.

Barren plateaus in quantum neural network training landscapes

Many experimental proposals for noisy intermediate scale quantum devices involve training a parameterized quantum circuit with a classical optimization loop. Such hybrid quantum-classical algorithms are popular for applications in quantum simulation, optimization, and machine learning. Due to its simplicity and hardware efficiency, random circuits are often proposed as initial guesses for exploring the space of quantum states. We show that the exponential dimension of Hilbert space and the gradient estimation complexity make this choice unsuitable for hybrid quantum-classical algorithms run on more than a few qubits. Specifically, we show that for a wide class of reasonable parameterized quantum circuits, the probability that the gradient along any reasonable direction is non-zero to some fixed precision is exponentially small as a function of the number of qubits. We argue that this is related to the 2-design characteristic of random circuits, and that solutions to this problem must be studied.