Constructing Local Bases for a Deep Variational Quantum Eigensolver for Molecular Systems

• URL: http://arxiv.org/abs/2202.08473v2
• Date: Mon, 23 Jan 2023 11:19:16 GMT
• Title: Constructing Local Bases for a Deep Variational Quantum Eigensolver for Molecular Systems
• Authors: Luca Erhart, Kosuke Mitarai, Wataru Mizukami and Keisuke Fujii
• Abstract summary: 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. We find that the deep VQE can simulate the electron-correlation energy of the ground state to an error of below 1%.
• Score: 0.6181093777643575
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
  Quantum computing sets the foundation for new ways of designing algorithms. New challenges arise concerning which field quantum speedup can be achieved. Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-26T09:32:07Z)
• Use VQE to calculate the ground energy of hydrogen molecules on IBM Quantum [2.3889084213601346]
  We implement the Variational Quantum Eigensolver (VQE) algorithm using Qiskit on the IBM Quantum platform to calculate the ground state energy of a hydrogen molecule. Our fi ndings demonstrate that VQE can effi ciently calculate molecular properties with high accuracy.
  arXiv  Detail & Related papers  (2023-05-11T02:53:26Z)
• Folded Spectrum VQE : A quantum computing method for the calculation of molecular excited states [0.0]
  Folded Spectrum (FS) method as extension to Variational Quantum Eigensolver (VQE) algorithm for computation of molecular excited states. Inspired by the variance-based methods from the Quantum Monte Carlo literature, the FS method minimizes the energy variance, thus requiring a computationally expensive squared Hamiltonian. We apply the FS-VQE method to small molecules for a significant reduction of the computational cost.
  arXiv  Detail & Related papers  (2023-05-08T15:34:56Z)
• QNEAT: Natural Evolution of Variational Quantum Circuit Architecture [95.29334926638462]
  We focus on variational quantum circuits (VQC), which emerged as the most promising candidates for the quantum counterpart of neural networks. Although showing promising results, VQCs can be hard to train because of different issues, e.g., barren plateau, periodicity of the weights, or choice of architecture. We propose a gradient-free algorithm inspired by natural evolution to optimize both the weights and the architecture of the VQC.
  arXiv  Detail & Related papers  (2023-04-14T08:03:20Z)
• A Qubit-Efficient Variational Selected Configuration-Interaction Method [0.0]
  We present an alternative variational quantum scheme that requires significantly less qubits. The proposed algorithm, termed variational quantum selected--interaction (VQ-SCI), is based on: (a) representing the target groundstate as a superposition of Slater configurations. We show that the VQ-SCI reaches the full-CI (FCI) energy within chemical accuracy using the lowest number of qubits reported to date.
  arXiv  Detail & Related papers  (2023-02-13T21:15:08Z)
• Towards Neural Variational Monte Carlo That Scales Linearly with System Size [67.09349921751341]
  Quantum many-body problems are central to demystifying some exotic quantum phenomena, e.g., high-temperature superconductors. The combination of neural networks (NN) for representing quantum states, and the Variational Monte Carlo (VMC) algorithm, has been shown to be a promising method for solving such problems. We propose a NN architecture called Vector-Quantized Neural Quantum States (VQ-NQS) that utilizes vector-quantization techniques to leverage redundancies in the local-energy calculations of the VMC algorithm.
  arXiv  Detail & Related papers  (2022-12-21T19:00:04Z)
• Exploring the scaling limitations of the variational quantum eigensolver with the bond dissociation of hydride diatomic molecules [0.0]
  Materials simulations involving strongly correlated electrons pose fundamental challenges to state-of-the-art electronic structure methods. No quantum computer has simulated a molecule of a size and complexity relevant to real-world applications, despite the fact that the variational quantum eigensolver algorithm can predict chemically accurate total energies. We show that the inclusion of d-orbitals and the use of the UCCSD ansatz, which are both necessary to capture the correct TiH physics, dramatically increase the cost of this problem.
  arXiv  Detail & Related papers  (2022-08-15T19:21:17Z)
• Quantum Davidson Algorithm for Excited States [42.666709382892265]
  We introduce the quantum Krylov subspace (QKS) method to address both ground and excited states. By using the residues of eigenstates to expand the Krylov subspace, we formulate a compact subspace that aligns closely with the exact solutions. Using quantum simulators, we employ the novel QDavidson algorithm to delve into the excited state properties of various systems.
  arXiv  Detail & Related papers  (2022-04-22T15:03:03Z)
• Computing molecular excited states on a D-Wave quantum annealer [52.5289706853773]
  We demonstrate the use of a D-Wave quantum annealer for the calculation of excited electronic states of molecular systems. These simulations play an important role in a number of areas, such as photovoltaics, semiconductor technology and nanoscience.
  arXiv  Detail & Related papers  (2021-07-01T01:02:17Z)
• Deep variational quantum eigensolver for excited states and its application to quantum chemistry calculation of periodic materials [0.0]
  Variational Quantum Eigensolver (VQE) is one of the most promising ways to utilize the computational power of quantum devices. We extend the original proposal of Deep VQE to obtain the excited states and apply it to quantum chemistry calculation of a periodic material.
  arXiv  Detail & Related papers  (2021-04-02T02:19:30Z)
• Quantum-optimal-control-inspired ansatz for variational quantum algorithms [105.54048699217668]
  A central component of variational quantum algorithms (VQA) is the state-preparation circuit, also known as ansatz or variational form. Here, we show that this approach is not always advantageous by introducing ans"atze that incorporate symmetry-breaking unitaries. This work constitutes a first step towards the development of a more general class of symmetry-breaking ans"atze with applications to physics and chemistry problems.
  arXiv  Detail & Related papers  (2020-08-03T18:00:05Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.