Constructing Local Bases for a Deep Variational Quantum Eigensolver for Molecular Systems
arXiv:2202.08473 · doi:10.1103/PhysRevApplied.18.064051
Abstract
Current quantum computers are limited in the number of qubits and coherence time, constraining the algorithms executable with sufficient fidelity. The variational quantum eigensolver (VQE) is an algorithm to find an approximate ground state of a quantum system and is expected to work on even such a device. The deep VQE [K. Fujii, et al., arXiv:2007.10917] is an extension of the original VQE algorithm, which takes a divide-and-conquer approach to relax the hardware requirement. While the deep VQE is successfully applied for spin models and periodic material, its validity on a molecule, where the Hamiltonian is highly nonlocal in the qubit basis, is still unexplored. Here, we discuss the performance of the deep VQE algorithm applied to quantum chemistry problems. Specifically, we examine different subspaceforming methods and compare their accuracy and complexity on a 10 H-atom treelike molecule as well as a 13 H-atom version. Additionally, we examine the performance on the natural occurring molecule retinal. This work also proposes multiple methods to lower the number of qubits required to calculate the ground state of a molecule. We find that the deep VQE can simulate the electron-correlation energy of the ground state to an error of below 1%, thus helping us to reach chemical accuracy in some cases. The accuracy differences and qubits' reduction highlights the basis creation method's impact on the deep VQE.
References in corpus (13)
- SciPy 1.0--Fundamental Algorithms for Scientific Computing in Python
- Quantum Computing in the NISQ era and beyond
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- A variational eigenvalue solver on a quantum processor
- Quantum algorithm for solving linear systems of equations
- Quantum Chemistry in the Age of Quantum Computing
- Quantum algorithm for systems of linear equations with exponentially improved dependence on precision
- A rigorous and robust quantum speed-up in supervised machine learning
- Qulacs: a fast and versatile quantum circuit simulator for research purpose
- Subspace-search variational quantum eigensolver for excited states
- Doubling the size of quantum simulators by entanglement forging
- Efficient Tree Tensor Network States (TTNS) for Quantum Chemistry: Generalizations of the Density Matrix Renormalization Group Algorithm