Evaluation on Genetic Algorithms as an optimizer of Variational Quantum Eigensolver(VQE) method

• URL: http://arxiv.org/abs/2110.07441v1
• Date: Thu, 14 Oct 2021 15:10:16 GMT
• Title: Evaluation on Genetic Algorithms as an optimizer of Variational Quantum Eigensolver(VQE) method
• Authors: Hikaru Wakaura, Takao Tomono, Shoya Yasuda
• Abstract summary: Variational-Quantum-Eigensolver(VQE) method on a quantum computer is a well-known hybrid algorithm to solve the eigenstates and eigenvalues that uses both quantum and classical computers. This method has the potential to solve quantum chemical simulation including polymer and complex optimization problems that are never able to be solved in a realistic time.
• Score: 1.0742675209112622
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Variational-Quantum-Eigensolver(VQE) method on a quantum computer is a well-known hybrid algorithm to solve the eigenstates and eigenvalues that uses both quantum and classical computers. This method has the potential to solve quantum chemical simulation including polymer and complex optimization problems that are never able to be solved in a realistic time. Though they are many papers on VQE, there are many hurdles before practical application. Therefore, we tried to evaluate VQE methods with Genetic Algorithms(GA). In this paper, we propose the VQE method with GA. We selected ground and excited-state energy on hydrogen molecules as the target because there are many local minimum values on excited states though the molecular structure is extremely simple. Therefore it is not easy to find the energy of states. We compared the GA method with other methods from the viewpoint of log error of the ground, triplet, singlet, and doubly excited state energy value. As a result, we denoted that the BFGS method has the highest accuracy. We thought that rcGA used as an optimization for the VQE method was proved disappointing. The rcGA does not show an advantage compared to other methods. we suggest that the cause is due to initial convergence. In the future, we want to try to introduce Genetic Algorithms then local search.

Related papers

• Optimizing random local Hamiltonians by dissipation [44.99833362998488]
  We prove that a simplified quantum Gibbs sampling algorithm achieves a $Omega(frac1k)$-fraction approximation of the optimum. Our results suggest that finding low-energy states for sparsified (quasi)local spin and fermionic models is quantumly easy but classically nontrivial.
  arXiv  Detail & Related papers  (2024-11-04T20:21:16Z)
• Nonlinear dynamics as a ground-state solution on quantum computers [39.58317527488534]
  We present variational quantum algorithms (VQAs) that encode both space and time in qubit registers. The spacetime encoding enables us to obtain the entire time evolution from a single ground-state computation.
  arXiv  Detail & Related papers  (2024-03-25T14:06:18Z)
• GRAPE optimization for open quantum systems with time-dependent decoherence rates driven by coherent and incoherent controls [77.34726150561087]
  The GRadient Ascent Pulse Engineering (GRAPE) method is widely used for optimization in quantum control. We adopt GRAPE method for optimizing objective functionals for open quantum systems driven by both coherent and incoherent controls. The efficiency of the algorithm is demonstrated through numerical simulations for the state-to-state transition problem.
  arXiv  Detail & Related papers  (2023-07-17T13:37:18Z)
• Twisted hybrid algorithms for combinatorial optimization [68.8204255655161]
  Proposed hybrid algorithms encode a cost function into a problem Hamiltonian and optimize its energy by varying over a set of states with low circuit complexity. We show that for levels $p=2,ldots, 6$, the level $p$ can be reduced by one while roughly maintaining the expected approximation ratio.
  arXiv  Detail & Related papers  (2022-03-01T19:47:16Z)
• Constructing Local Bases for a Deep Variational Quantum Eigensolver for Molecular Systems [0.6181093777643575]
  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%.
  arXiv  Detail & Related papers  (2022-02-17T06:52:37Z)
• A prescreening method for variational quantum state eigensolver [0.0]
  We propose a method to derive all of the states with high accuracy by using the Variational Quantum State Eigensolver (VQSE) and Subspace-Search VQE (SSVQE) methods. We show that by using the VQSE and the SSVQE prescreening methods, we can derive all of the hydrogen molecules states correctly.
  arXiv  Detail & Related papers  (2021-11-03T18:13:33Z)
• Genetic-Multi-initial Generalized VQE: Advanced VQE method using Genetic Algorithms then Local Search [1.2691047660244335]
  Variational-Quantum-Eigensolver (VQE) method has been known as the method of chemical calculation using quantum computers and classical computers. We performed the calculation of ground and excited states and their energies on hydrogen molecule by modified GA then LS. We obtained a result that Newton method can derive ground and excited states and their energies in higher accuracy than others.
  arXiv  Detail & Related papers  (2021-09-05T06:52:57Z)
• Improving the variational quantum eigensolver using variational adiabatic quantum computing [0.0]
  variational quantumsampling (VAQC) is a hybrid quantum-classical algorithm for finding a Hamiltonian minimum eigenvalue of a quantum circuit. We show that VAQC can provide more accurate solutions than "plain" VQE, for the evaluation.
  arXiv  Detail & Related papers  (2021-02-04T20:25:50Z)
• Benchmarking adaptive variational quantum eigensolvers [63.277656713454284]
  We benchmark the accuracy of VQE and ADAPT-VQE to calculate the electronic ground states and potential energy curves. We find both methods provide good estimates of the energy and ground state. gradient-based optimization is more economical and delivers superior performance than analogous simulations carried out with gradient-frees.
  arXiv  Detail & Related papers  (2020-11-02T19:52:04Z)
• 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)
• MoG-VQE: Multiobjective genetic variational quantum eigensolver [0.0]
  Variational quantum eigensolver (VQE) emerged as a first practical algorithm for near-term quantum computers. Here, we propose the approach which can combine both low depth and improved precision. We observe nearly ten-fold reduction in the two-qubit gate counts as compared to the standard hardware-efficient ansatz.
  arXiv  Detail & Related papers  (2020-07-08T20:44:50Z)

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.