Numerical investigation of the quantum inverse algorithm on small molecules

Abstract

We evaluate the accuracy of the quantum inverse (Q-Inv) algorithm in which the multiplication of ${\hat{H}}^{-k}$ to the reference wavefunction is replaced by the Fourier Transformed multiplication of $e^{-i\lambda \hat{H}}$, as a function of the integration parameters ($\lambda$) and the power $k$ for various systems, including H${}_2$, LiH, BeH${}_2$ and the notorious H${}_4$ molecule at single point. We further consider the possibility of employing the Gaussian-quadrature rule as an alternate integration method and compared it to the results employing trapezoidal integration. The Q-Inv algorithm is compared to the inverse iteration method using the ${\hat{H}}^{-1}$ inverse (I-Iter) and the exact inverse by lower-upper decomposition (LU). Energy values are evaluated as the expectation values of the Hamiltonian. Results suggest that the Q-Inv method provides lower energy results than the I-Iter method up to a certain $k$, after which the energy increases due to errors in the numerical integration that are dependent of the integration interval. A combined Gaussian-quadrature and trapezoidal integration method proved to be more effective at reaching convergence while decreasing the number of operations. For systems like H${}_4$, in which the Q-Inv can not reach the expected error threshold, we propose a combination of Q-Inv and I-Iter methods to further decrease the error with $k$ at lower computational cost. Finally, we summarize the recommended procedure when treating unknown systems.

25 pages, 4 figures

References in corpus (42)

• Quantum Computing in the NISQ era and beyond
• A variational eigenvalue solver on a quantum processor
• Quantum algorithm for solving linear systems of equations
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Quantum computational chemistry
• Quantum Chemistry in the Age of Quantum Computing
• Simulated Quantum Computation of Molecular Energies
• Recent developments in the PySCF program package
• A quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors
• Scalable Quantum Simulation of Molecular Energies
• Quantum algorithms for quantum chemistry and quantum materials science
• Simulating Hamiltonian dynamics with a truncated Taylor series
• Towards Practical Quantum Variational Algorithms
• Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution
• Quantum algorithm for systems of linear equations with exponentially improved dependence on precision
• Hybrid Quantum-Classical Hierarchy for Mitigation of Decoherence and Determination of Excited States
• Optimal Quantum Phase Estimation
• Simulation of Electronic Structure Hamiltonians Using Quantum Computers
• Generalized Unitary Coupled Cluster Wavefunctions for Quantum Computation
• Gate count estimates for performing quantum chemistry on small quantum computers
• Even more efficient quantum computations of chemistry through tensor hypercontraction
• Low Depth Quantum Simulation of Electronic Structure
• Exponential improvement in precision for simulating sparse Hamiltonians
• Heisenberg-limited ground state energy estimation for early fault-tolerant quantum computers
• Near-optimal ground state preparation
• Increasing the representation accuracy of quantum simulations of chemistry without extra quantum resources
• Digital quantum simulation of open quantum systems using quantum imaginary time evolution
• Ground state preparation and energy estimation on early fault-tolerant quantum computers via quantum eigenvalue transformation of unitary matrices
• A Non-Orthogonal Variational Quantum Eigensolver
• Quantum Krylov subspace algorithms for ground and excited state energy estimation
• A Jastrow-type decomposition in quantum chemistry for low-depth quantum circuits
• Quantum Power Method by a Superposition of Time-Evolved States
• Real time evolution for ultracompact Hamiltonian eigenstates on quantum hardware
• Even shorter quantum circuit for phase estimation on early fault-tolerant quantum computers with applications to ground-state energy estimation
• Generalized quantum subspace expansion
• Exact and efficient Lanczos method on a quantum computer
• Quantum Filter Diagonalization with Double-Factorized Hamiltonians
• Hamiltonian variational ansatz without barren plateaus
• Quantum inverse iteration algorithm for programmable quantum simulators
• On low-depth algorithms for quantum phase estimation
• Universal Programmable Quantum Circuit Schemes to Emulate an Operator
• An Ancilla Based Quantum Simulation Framework for Non-Unitary Matrices