Reducing the cost of energy estimation in the variational quantum eigensolver algorithm with robust amplitude estimation

• URL: http://arxiv.org/abs/2203.07275v1
• Date: Mon, 14 Mar 2022 16:51:36 GMT
• Title: Reducing the cost of energy estimation in the variational quantum eigensolver algorithm with robust amplitude estimation
• Authors: Peter D. Johnson, Alexander A. Kunitsa, J\'er\^ome F. Gonthier, Maxwell D. Radin, Corneliu Buda, Eric J. Doskocil, Clena M. Abuan, Jhonathan Romero
• Abstract summary: Quantum chemistry and materials is one of the most promising applications of quantum computing. Much work is still to be done in matching industry-relevant problems in these areas with quantum algorithms that can solve them.
• Score: 50.591267188664666
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum chemistry and materials is one of the most promising applications of quantum computing. Yet much work is still to be done in matching industry-relevant problems in these areas with quantum algorithms that can solve them. Most previous efforts have carried out resource estimations for quantum algorithms run on large-scale fault-tolerant architectures, which include the quantum phase estimation algorithm. In contrast, few have assessed the performance of near-term quantum algorithms, which include the variational quantum eigensolver (VQE) algorithm. Recently, a large-scale benchmark study [Gonthier et al. 2020] found evidence that the performance of the variational quantum eigensolver for a set of industry-relevant molecules may be too inefficient to be of practical use. This motivates the need for developing and assessing methods that improve the efficiency of VQE. In this work, we predict the runtime of the energy estimation subroutine of VQE when using robust amplitude estimation (RAE) to estimate Pauli expectation values. Under conservative assumptions, our resource estimation predicts that RAE can reduce the runtime over the standard estimation method in VQE by one to two orders of magnitude. Despite this improvement, we find that the runtimes are still too large to be practical. These findings motivate two complementary efforts towards quantum advantage: 1) the investigation of more efficient near-term methods for ground state energy estimation and 2) the development of problem instances that are of industrial value and classically challenging, but better suited to quantum computation.

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)
• Quantum Annealing for Single Image Super-Resolution [86.69338893753886]
  We propose a quantum computing-based algorithm to solve the single image super-resolution (SISR) problem. The proposed AQC-based algorithm is demonstrated to achieve improved speed-up over a classical analog while maintaining comparable SISR accuracy.
  arXiv  Detail & Related papers  (2023-04-18T11:57:15Z)
• Noise-robust ground state energy estimates from deep quantum circuits [0.0]
  We show how the underlying energy estimate explicitly filters out incoherent noise in quantum algorithms. We implement QCM for a model of quantum magnetism on IBM Quantum hardware. We find that QCM maintains a remarkably high degree of error robustness where VQE completely fails.
  arXiv  Detail & Related papers  (2022-11-16T09:12:55Z)
• Potential and limitations of quantum extreme learning machines [55.41644538483948]
  We present a framework to model QRCs and QELMs, showing that they can be concisely described via single effective measurements. Our analysis paves the way to a more thorough understanding of the capabilities and limitations of both QELMs and QRCs.
  arXiv  Detail & Related papers  (2022-10-03T09:32:28Z)
• Quantum algorithm for ground state energy estimation using circuit depth with exponentially improved dependence on precision [1.5831247735039677]
  A milestone in the field of quantum computing will be solving problems in quantum chemistry and materials faster than state-of-the-art classical methods. We develop a ground state energy estimation algorithm for which this cost grows linearly in the number of bits of precision. These features make our algorithm a promising candidate for realizing quantum advantage in the era of early fault-tolerant quantum computing.
  arXiv  Detail & Related papers  (2022-09-14T17:58:12Z)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• The Variational Quantum Eigensolver: a review of methods and best practices [3.628860803653535]
  The variational quantum eigensolver (or VQE) uses the variational principle to compute the ground state energy of a Hamiltonian. This review aims to provide an overview of the progress that has been made on the different parts of the algorithm.
  arXiv  Detail & Related papers  (2021-11-09T14:40:18Z)
• Reducing runtime and error in VQE using deeper and noisier quantum circuits [0.0]
  A core of many quantum algorithms including VQE, can be improved in terms of precision and accuracy by using a technique we call Robust Amplitude Estimation. By using deeper, and therefore more error-prone, quantum circuits, we realize more accurate quantum computations in less time. This technique may be used to speed up quantum computations into the regime of early fault-tolerant quantum computation.
  arXiv  Detail & Related papers  (2021-10-20T17:11:29Z)
• Mitigating algorithmic errors in quantum optimization through energy extrapolation [4.426846282723645]
  We present a scalable extrapolation approach to mitigating a non-negligible error in estimates of the ground state energy. We have verified the validity of these approaches through both numerical simulation and experiments on an IBM quantum computer.
  arXiv  Detail & Related papers  (2021-09-16T17:39:11Z)
• Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06:27Z)

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.