Quantum benefit of the quantum equation of motion for the strongly coupled many-body problem

• URL: http://arxiv.org/abs/2309.10179v1
• Date: Mon, 18 Sep 2023 22:10:26 GMT
• Title: Quantum benefit of the quantum equation of motion for the strongly coupled many-body problem
• Authors: Manqoba Q. Hlatshwayo, John Novak, and Elena Litvinova
• Abstract summary: The quantum equation of motion (qEOM) is a hybrid quantum-classical algorithm for computing excitation properties of a fermionic many-body system. We demonstrate explicitly that the qEOM exhibits a quantum benefit due to the independence of the number of required quantum measurements.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We investigate the quantum equation of motion (qEOM), a hybrid quantum-classical algorithm for computing excitation properties of a fermionic many-body system, with a particular emphasis on the strong-coupling regime. The method is designed as a stepping stone towards building more accurate solutions for strongly coupled fermionic systems, such as medium-heavy nuclei, using quantum algorithms to surpass the current barrier in classical computation. Approximations of increasing accuracy to the exact solution of the Lipkin-Meshkov-Glick Hamiltonian with $N=8$ particles are studied on digital simulators and IBM quantum devices. Improved accuracy is achieved by applying operators of growing complexity to generate excitations above the correlated ground state, which is determined by the variational quantum eigensolver (VQE). We demonstrate explicitly that the qEOM exhibits a quantum benefit due to the independence of the number of required quantum measurements from the configuration complexity. Post-processing examination shows that quantum device errors are amplified by increasing configuration complexity and coupling strength. A detailed error analysis is presented, and error mitigation based on zero noise extrapolation is implemented.

Related papers

• Quantum algorithms: A survey of applications and end-to-end complexities [90.05272647148196]
  The anticipated applications of quantum computers span across science and industry. We present a survey of several potential application areas of quantum algorithms. We outline the challenges and opportunities in each area in an "end-to-end" fashion.
  arXiv  Detail & Related papers  (2023-10-04T17:53:55Z)
• Dynamical mean-field theory for the Hubbard-Holstein model on a quantum device [0.0]
  We report a demonstration of solving the dynamical mean-field theory (DMFT) impurity problem for the Hubbard-Holstein model on the IBM 27-qubit Quantum Falcon Processor Kawasaki. This opens up the possibility to investigate strongly correlated electron systems coupled to bosonic degrees of freedom and impurity problems with frequency-dependent interactions.
  arXiv  Detail & Related papers  (2023-01-05T00:36:21Z)
• Squeezing and quantum approximate optimization [0.6562256987706128]
  Variational quantum algorithms offer fascinating prospects for the solution of optimization problems using digital quantum computers. However, the achievable performance in such algorithms and the role of quantum correlations therein remain unclear. We show numerically as well as on an IBM quantum chip how highly squeezed states are generated in a systematic procedure.
  arXiv  Detail & Related papers  (2022-05-20T18:00:06Z)
• Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry [51.827942608832025]
  Near-term quantum computers can calculate the ground-state properties of small molecules. We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
  arXiv  Detail & Related papers  (2021-12-31T16:33:10Z)
• Simulating the Mott transition on a noisy digital quantum computer via Cartan-based fast-forwarding circuits [62.73367618671969]
  Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model. Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models. This work presents the first computation of the Mott phase transition using noisy digital quantum hardware.
  arXiv  Detail & Related papers  (2021-12-10T17:32:15Z)
• Solving hadron structures using the basis light-front quantization approach on quantum computers [0.8726465590483234]
  We show that quantum computing can be used to solve for the structure of hadrons governed by strongly-interacting quantum field theory. We present the numerical calculations on simulated quantum devices using the basis light-front quantization approach.
  arXiv  Detail & Related papers  (2021-12-03T14:28:18Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation [55.41644538483948]
  Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in chip size and error rates. We derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions. The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond $mathcalO(103)$ spins.
  arXiv  Detail & Related papers  (2021-08-06T19:38:03Z)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)
• Quantum simulation of open quantum systems in heavy-ion collisions [0.0]
  We present a framework to simulate the dynamics of hard probes such as heavy quarks or jets in a hot, strongly-coupled quark-gluon plasma (QGP) on a quantum computer. Our work demonstrates the feasibility of simulating open quantum systems on current and near-term quantum devices.
  arXiv  Detail & Related papers  (2020-10-07T18:00:02Z)
• Simulating quantum chemistry in the seniority-zero space on qubit-based quantum computers [0.0]
  We combine the so-called seniority-zero, or paired-electron, approximation of computational quantum chemistry with techniques for simulating molecular chemistry on gate-based quantum computers. We show that using the freed-up quantum resources for increasing the basis set can lead to more accurate results and reductions in the necessary number of quantum computing runs.
  arXiv  Detail & Related papers  (2020-01-31T19:44:37Z)

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.