Variational quantum algorithm for generalized eigenvalue problems and its application to the finite element method

• URL: http://arxiv.org/abs/2302.12602v2
• Date: Wed, 27 Sep 2023 09:29:28 GMT
• Title: Variational quantum algorithm for generalized eigenvalue problems and its application to the finite element method
• Authors: Yuki Sato, Hiroshi C. Watanabe, Rudy Raymond, Ruho Kondo, Kaito Wada, Katsuhiro Endo, Michihiko Sugawara, Naoki Yamamoto
• Abstract summary: Generalized eigenvalue problems (GEPs) play an important role in the variety of fields including engineering, machine learning and quantum chemistry. This paper aims at extending sequential quantum sequentials for GEPs.
• Score: 2.957189619293782
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Generalized eigenvalue problems (GEPs) play an important role in the variety of fields including engineering, machine learning and quantum chemistry. Especially, many problems in these fields can be reduced to finding the minimum or maximum eigenvalue of GEPs. One of the key problems to handle GEPs is that the memory usage and computational complexity explode as the size of the system of interest grows. This paper aims at extending sequential quantum optimizers for GEPs. Sequential quantum optimizers are a family of algorithms that iteratively solve the analytical optimization of single-qubit gates in a coordinate descent manner. The contribution of this paper is as follows. First, we formulate the GEP as the minimization/maximization problem of the fractional form of the expectations of two Hermitians. We then showed that the fractional objective function can be analytically minimized or maximized with respect to a single-qubit gate by solving a GEP of a 4 $\times$ 4 matrix. Second, we show that a system of linear equations (SLE) characterized by a positive-definite Hermitian can be formulated as a GEP and thus be attacked using the proposed method. Finally, we demonstrate two applications to important engineering problems formulated with the finite element method. Through the demonstration, we have the following bonus finding; a problem having a real-valued solution can be solved more effectively using quantum gates generating a complex-valued state vector, which demonstrates the effectiveness of the proposed method.

Related papers

• Grover Adaptive Search with Spin Variables [3.190355298836875]
  We introduce a novel quantum dictionary subroutine that is designed for this spin-based algorithm. A key benefit of this approach is the substantial reduction in the number of CNOT gates required to construct the quantum circuit.
  arXiv  Detail & Related papers  (2024-10-15T14:24:27Z)
• Quantum Multiple Eigenvalue Gaussian filtered Search: an efficient and versatile quantum phase estimation method [13.34671442890838]
  This work proposes a new approach for the problem of multiple eigenvalue estimation: Quantum Multiple Eigenvalue Gaussian filtered Search (QMEGS) QMEGS is the first algorithm to simultaneously satisfy the Heisenberg-limited scaling without relying on any spectral gap assumption. Numerical results validate the efficiency of our proposed algorithm in various regimes.
  arXiv  Detail & Related papers  (2024-02-01T20:55:11Z)
• Variational-quantum-eigensolver-inspired optimization for spin-chain work extraction [39.58317527488534]
  Energy extraction from quantum sources is a key task to develop new quantum devices such as quantum batteries. One of the main issues to fully extract energy from the quantum source is the assumption that any unitary operation can be done on the system. We propose an approach to optimize the extractable energy inspired by the variational quantum eigensolver (VQE) algorithm.
  arXiv  Detail & Related papers  (2023-10-11T15:59:54Z)
• 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)
• Quantum algorithms for generator coordinate methods [12.744157326232749]
  This paper discusses quantum algorithms for the generator coordinate method (GCM) that can be used to benchmark molecular systems. We illustrate the performance of the quantum algorithm for constructing a discretized form of the Hill-Wheeler equation for ground and excited state energies.
  arXiv  Detail & Related papers  (2022-12-19T01:22:19Z)
• Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
  We study the problem of designing worst-case to average-case reductions for quantum algorithms. We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
  arXiv  Detail & Related papers  (2022-12-06T22:01:49Z)
• End-to-end resource analysis for quantum interior point methods and portfolio optimization [63.4863637315163]
  We provide a complete quantum circuit-level description of the algorithm from problem input to problem output. We report the number of logical qubits and the quantity/depth of non-Clifford T-gates needed to run the algorithm.
  arXiv  Detail & Related papers  (2022-11-22T18:54:48Z)
• Analyzing Prospects for Quantum Advantage in Topological Data Analysis [35.423446067065576]
  We analyze and optimize an improved quantum algorithm for topological data analysis. We show that super-quadratic quantum speedups are only possible when targeting a multiplicative error approximation. We argue that quantum circuits with tens of billions of Toffoli can solve seemingly classically intractable instances.
  arXiv  Detail & Related papers  (2022-09-27T17:56:15Z)
• Quantum algorithms for the generalized eigenvalue problem [6.111964049119244]
  generalized eigenvalue (GE) problems are of particular importance in various areas of science engineering and machine learning. We present a variational quantum algorithm for finding the desired generalized eigenvalue of the GE problem, $mathcalA|psirangle=lambdamathcalB|psirangle$, by choosing suitable loss functions. We numerically implement our algorithms to conduct a 2-qubit simulation and successfully find the generalized eigenvalues of the matrix pencil $(mathcalA,,mathcalB)$
  arXiv  Detail & Related papers  (2021-12-05T12:12:49Z)
• 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)
• Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets [47.00474212574662]
  Variational quantum algorithms are believed to be promising for solving computationally hard problems. In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances. Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
  arXiv  Detail & Related papers  (2020-05-11T17:20:51Z)

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.