Near-term quantum algorithm for computing molecular and materials properties based on recursive variational series methods
arXiv:2206.09881 · doi:10.1103/PhysRevA.108.022422
Abstract
Determining the properties of molecules and materials is one of the premier applications of quantum computing. A major question in the field is: how might we use imperfect near-term quantum computers to solve problems of practical value? We propose a quantum algorithm to estimate the properties of molecules using near-term quantum devices. The method is a recursive variational series estimation method, where we expand an operator of interest in terms of Chebyshev polynomials and evaluate each term in the expansion using a variational quantum algorithm. We test our method by computing the one-particle Green's function in the energy domain and the autocorrelation function in the time domain.
16+10 pages, 3 figures; comments welcome
References in corpus (20)
- The Kernel Polynomial Method
- Even more efficient quantum computations of chemistry through tensor hypercontraction
- A Quantum Computing View on Unitary Coupled Cluster Theory
- Ground state preparation and energy estimation on early fault-tolerant quantum computers via quantum eigenvalue transformation of unitary matrices
- Measurements as a roadblock to near-term practical quantum advantage in chemistry: resource analysis
- Fault-Tolerant Quantum Simulations of Chemistry in First Quantization
- An efficient quantum algorithm for the time evolution of parameterized circuits
- Quantum Computation of Finite-Temperature Static and Dynamical Properties of Spin Systems Using Quantum Imaginary Time Evolution
- Fast inversion, preconditioned quantum linear system solvers, and fast evaluation of matrix functions
- Quantum Algorithms for Estimating Physical Quantities using Block-Encodings
- Efficient quantum computation of molecular forces and other energy gradients
- Variational Quantum Computation of Molecular Linear Response Properties on a Superconducting Quantum Processor
- A variational quantum eigensolver for dynamic correlation functions
- Hybrid quantum-classical algorithm for computing imaginary-time correlation functions
- Lanczos recursion on a quantum computer for the Green's function and ground state
- Spectral density reconstruction with Chebyshev polynomials
- One-particle Green's functions from the quantum equation of motion algorithm
- Quantum Computation of Eigenvalues within Target Intervals
- Calculating the Green's function of two-site Fermionic Hubbard model in a photonic system
- Kernel-Function Based Quantum Algorithms for Finite Temperature Quantum Simulation