The Journal of Physical Chemistry Letters

Quantum Algorithm for the Direct Calculations of Vertical Ionization Energies

Kenji Sugisaki, Kazuo Toyota, Kazunobu Sato, Daisuke Shiomi, Takeji Takui

Published Mar 16, 2021• 20 citations

Abstract

High Resolution Image Download MS PowerPoint Slide 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 2, NO, CN, F 2, H 2 O, and NH 3 ) revealed that the proposed quantum algorithm affords the vertical ionization energies within 0.1 eV of precision.

DOI: 10.1021/acs.jpclett.1c00283

Related papers

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

Kenji Sugisaki, Chikako Sakai, Kazuo Toyota +3 more

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.

Physical Chemistry Chemical PhysicsJan 1, 202129 citations

Quantum Algorithm for Numerical Energy Gradient Calculations at the Full Configuration Interaction Level of Theory

Kenji Sugisaki, Hiroyuki WAKIMOTO, Kazuo Toyota +3 more

High Resolution Image Download MS PowerPoint Slide A Bayesian phase difference estimation (BPDE) algorithm allows us to compute the energy gap of two electronic states of a given Hamiltonian directly by utilizing the quantum superposition of their wave functions. Here we report an extension of the BPDE algorithm to the direct calculation of the energy difference of two molecular geometries. We apply the BPDE algorithm for the calculation of numerical energy gradients based on the two-point finite-difference method, enabling us to execute geometry optimization of one-dimensional molecules at the full-CI level on a quantum computer. Results of numerical quantum circuit simulations of the geometry optimization of the H 2 molecule with the STO-3G and 6-31G basis sets, the LiH and BeH 2 molecules at the full-CI/STO-3G level, and the N 2 molecule at the CASCI(6e,6o)/6-311G* level are given.

The Journal of Physical Chemistry LettersNov 29, 20229 citations

Open shell electronic state calculations on quantum computers: A quantum circuit for the preparation of configuration state functions based on Serber construction

Kenji Sugisaki, Satoru Yamamoto, Shigeaki Nakazawa +4 more

• An improved quantum circuit for the preparation of spin symmetry-adapted configuration state function is given. • The quantum circuit contains one-qubit rotations and controlled-NOT operations acting to adjacent two qubits. • The quantum circuit is fully parallelizable. • The depth of the quantum circuit is constant and independent to the number of unpaired electrons. Full configuration interaction (full-CI) calculations can be executed efficiently on quantum computers (QCs) by utilizing a quantum phase estimation algorithm (QPEA). In the QPEA-based full-CI on QCs, the preparation of the initial guess wave functions having large overlap with the full-CI root is crucial. Recently, we proposed a quantum circuit to prepare spin symmetry-adapted configuration state functions (CSFs) toward open shell electronic structure calculations of molecules on QCs. Here, we propose an improved quantum circuit, based on Serber construction of spin eigenfunctions, enabling us to prepare CSFs with much less and easier-to-implement quantum gates than the previously proposed one.

Chemical Physics LettersDec 13, 201830 citations

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

Kenji Sugisaki, Shigeaki Nakazawa, Kazuo Toyota +3 more

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.

ACS Central ScienceDec 31, 201890 citations

Quantum algorithm for ground state energy estimation using circuit depth with exponentially improved dependence on precision

Guoming Wang, Daniel Stilck França, Ruizhe Zhang +2 more

A milestone in the field of quantum computing will be solving problems in quantum chemistry and materials faster than state-of-the-art classical methods. The current understanding is that achieving quantum advantage in this area will require some degree of fault tolerance. While hardware is improving towards this milestone, optimizing quantum algorithms also brings it closer to the present. Existing methods for ground state energy estimation are costly in that they require a number of gates per circuit that grows exponentially with the desired number of bits in precision. We reduce this cost exponentially, by developing a ground state energy estimation algorithm for which this cost grows linearly in the number of bits of precision. Relative to recent resource estimates of ground state energy estimation for the industrially-relevant molecules of ethylene-carbonate and PF 6 − , the estimated gate count and circuit depth is reduced by a factor of 43 and 78, respectively. Furthermore, the algorithm can use additional circuit depth to reduce the total runtime. These features make our algorithm a promising candidate for realizing quantum advantage in the era of early fault-tolerant quantum computing.

arXiv:2209.06811QuantumNov 6, 202360 citations

Better accuracy with fewer qubits: Single-particle basis set optimization for quantum chemistry on quantum computers

Subimal Deb, V. S. Prasannaa

In spite of recent advances, quantum computers are expected to be sufficiently noisy in the coming few years to the extent of limiting quantum chemical calculations to relatively small number of orbitals. However, even with reasonable quality single particle basis sets, small active spaces with limited orbitals can result in a significant fraction of correlation energy being lost, motivating the design of moderate quality qubit-efficient basis sets for quantum algorithms. We begin by reoptimizing the existing minimal basis sets using a genetic algorithm-inspired approach in conjunction with aggressive refinement strategies, and generate modified minimal basis sets (MSTO-kG basis; k = 2-11) for atoms from H through F. The ground state energies of H through F using our MSTO bases at FCI level of theory yield ground state energies that are comparable or sometimes even lower than those obtained using 6-31G basis sets. In the case of Li, the MSTO bases surpass the performance of cc-pVQZ bases. Thus, we obtain better atomic energies with same number of qubits relative to STO bases, and better/comparable energies with fewer qubits relative to higher quality bases. In the case of molecules, H2 performs poorly; a finding that is consistent with an earlier work in literature. For other molecules, Li2, C2, LiH, BeH and BeH2, the FCI results (except C2 for which we employ CISD) from our bases are comparable to/outperform those from 6-31G basis. Finally, we compare the resources required between different bases and find that MSTO bases yield better energies than the competing basis sets while incurring fewer qubits and two-qubit gates with VQE, QPE, and HHL. The logical T-gate counts are also found to be considerably lower for QPE and HHL respectively. Overall, our work paves way for more accurate yet less qubit-hungry quantum chemical calculations using near-term quantum computers.

quant-pharXiv:2608.02119Aug 4, 20260 citations