Calculating the ground state energy of benzene under spatial deformations with noisy quantum computing

• URL: http://arxiv.org/abs/2203.05275v2
• Date: Thu, 10 Nov 2022 15:35:29 GMT
• Title: Calculating the ground state energy of benzene under spatial deformations with noisy quantum computing
• Authors: Wassil Sennane, Jean-Philip Piquemal and Marko J. Ran\v{c}i\'c
• Abstract summary: We calculate the ground state energy of benzene under spatial deformations by using the variational quantum eigensolver (VQE) By combining our advanced simulation platform with real quantum computers, we provided an analysis of how the noise, inherent to quantum computers, affects the results.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this manuscript, we calculate the ground state energy of benzene under spatial deformations by using the variational quantum eigensolver (VQE). The primary goal of the study is estimating the feasibility of using quantum computing ansatze on near-term devices for solving problems with large number of orbitals in regions where classical methods are known to fail. Furthermore, by combining our advanced simulation platform with real quantum computers, we provided an analysis of how the noise, inherent to quantum computers, affects the results. The centers of our study are the hardware efficient and quantum unitary coupled cluster ansatze (qUCC). First, we find that the hardware efficient ansatz has the potential to outperform mean-field methods for extreme deformations of benzene. However, key problems remain at equilibrium, preventing real chemical application. Moreover, the hardware efficient ansatz yields results that strongly depend on the initial guess of parameters - both in the noisy and noiseless cases - and optimization issues have a higher impact on their convergence than noise. This is confirmed by comparison with real quantum computing experiments. On the other hand, the qUCC ansatz alternative exhibits deeper circuits. Therefore, noise effects increase and are so extreme that the method never outperform mean-field theories. Our dual simulator/8-16 qubits QPU computations of qUCC appears to be a lot more sensitive to hardware noise than shot noise, which give further indications about where the noise-reduction efforts should be directed towards. Finally, the study shows that qUCC method better captures the physics of the system as the qUCC method can be utilized together with the Huckel approximation. We discussed how going beyond this approximation sharply increases the optimization complexity of such a difficult problem.

Related papers

• Hardware-efficient variational quantum algorithm in trapped-ion quantum computer [0.0]
  We study a hardware-efficient variational quantum algorithm ansatz tailored for the trapped-ion quantum simulator, HEA-TI. We leverage programmable single-qubit rotations and global spin-spin interactions among all ions, reducing the dependence on resource-intensive two-qubit gates in conventional gate-based methods.
  arXiv  Detail & Related papers  (2024-07-03T14:02:20Z)
• Bias-field digitized counterdiabatic quantum optimization [39.58317527488534]
  We call this protocol bias-field digitizeddiabatic quantum optimization (BF-DCQO) Our purely quantum approach eliminates the dependency on classical variational quantum algorithms. It achieves scaling improvements in ground state success probabilities, increasing by up to two orders of magnitude.
  arXiv  Detail & Related papers  (2024-05-22T18:11:42Z)
• Bayesian Parameterized Quantum Circuit Optimization (BPQCO): A task and hardware-dependent approach [49.89480853499917]
  Variational quantum algorithms (VQA) have emerged as a promising quantum alternative for solving optimization and machine learning problems. In this paper, we experimentally demonstrate the influence of the circuit design on the performance obtained for two classification problems. We also study the degradation of the obtained circuits in the presence of noise when simulating real quantum computers.
  arXiv  Detail & Related papers  (2024-04-17T11:00:12Z)
• Projective Quantum Eigensolver via Adiabatically Decoupled Subsystem Evolution: a Resource Efficient Approach to Molecular Energetics in Noisy Quantum Computers [0.0]
  We develop a projective formalism that aims to compute ground-state energies of molecular systems accurately using Noisy Intermediate Scale Quantum (NISQ) hardware. We demonstrate the method's superior performance under noise while concurrently ensuring requisite accuracy in future fault-tolerant systems.
  arXiv  Detail & Related papers  (2024-03-13T13:27:40Z)
• 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)
• Evaluating the impact of noise on the performance of the Variational Quantum Eigensolver [0.0]
  We study the impact of noise on the example of a hydrogen molecule. We quantify the effect of different noise sources by systematically increasing their strength. The noise intensity is varied around values common to superconducting devices of IBM Q, and curve fitting is used to model the relationship between the obtained energy values and the noise magnitude.
  arXiv  Detail & Related papers  (2022-09-26T15:58:27Z)
• Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage [43.3054117987806]
  We introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for quantum circuits. We show this method significantly improves the trainability and performance of PQCs on a variety of problems. By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing.
  arXiv  Detail & Related papers  (2022-08-29T15:24:03Z)
• Quantum circuit architecture search on a superconducting processor [56.04169357427682]
  Variational quantum algorithms (VQAs) have shown strong evidences to gain provable computational advantages for diverse fields such as finance, machine learning, and chemistry. However, the ansatz exploited in modern VQAs is incapable of balancing the tradeoff between expressivity and trainability. We demonstrate the first proof-of-principle experiment of applying an efficient automatic ansatz design technique to enhance VQAs on an 8-qubit superconducting quantum processor.
  arXiv  Detail & Related papers  (2022-01-04T01:53:42Z)
• 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)
• 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)
• Limitations of optimization algorithms on noisy quantum devices [0.0]
  We present a transparent way of comparing classical algorithms to quantum ones running on near-term quantum devices. Our approach is based on the combination of entropic inequalities that determine how fast the quantum state converges to the fixed point of the noise model.
  arXiv  Detail & Related papers  (2020-09-11T17:07:26Z)

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.