Hybrid quantum-classical algorithm for computing imaginary-time correlation functions

• URL: http://arxiv.org/abs/2112.02764v3
• Date: Tue, 14 Jun 2022 01:58:27 GMT
• Title: Hybrid quantum-classical algorithm for computing imaginary-time correlation functions
• Authors: Rihito Sakurai, Wataru Mizukami, Hiroshi Shinaoka
• Abstract summary: We propose a hybrid algorithm for computing imaginary-time Green's functions on quantum devices with limited hardware resources. Using a quantum circuit simulator, we verified this algorithm by computing Green's functions for a dimer model and a four-site impurity model.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantitative descriptions of strongly correlated materials pose a considerable challenge in condensed matter physics and chemistry. A promising approach to address this problem is quantum embedding methods. In particular, the dynamical mean-field theory (DMFT) maps the original system to an effective quantum impurity model comprising correlated orbitals embedded in an electron bath. The biggest bottleneck in DMFT calculations is numerically solving the quantum impurity model, i.e., computing Green's function. Past studies have proposed theoretical methods to compute Green's function of a quantum impurity model in polynomial time using a quantum computer. So far, however, efficient methods for computing the imaginary-time Green's functions have not been established despite the advantages of the imaginary-time formulation. We propose a quantum-classical hybrid algorithm for computing imaginary-time Green's functions on quantum devices with limited hardware resources by applying the variational quantum simulation. Using a quantum circuit simulator, we verified this algorithm by computing Green's functions for a dimer model as well as a four-site impurity model obtained by DMFT calculations of the single-band Hubbard model, although our method can be applied to general imaginary-time correlation functions.

Related papers

• Utilizing Quantum Processor for the Analysis of Strongly Correlated Materials [34.63047229430798]
  This study introduces a systematic approach for analyzing strongly correlated systems by adapting the conventional quantum cluster method to a quantum circuit model. We have developed a more concise formula for calculating the cluster's Green's function, requiring only real-number computations on the quantum circuit instead of complex ones.
  arXiv  Detail & Related papers  (2024-04-03T06:53:48Z)
• Quantum algorithm for imaginary-time Green's functions [0.0]
  We present a hybrid quantum-classical algorithm to calculate the imaginary-time one-particle Green's function. The proposed algorithm combines variational quantum eigensolver and quantum subspace expansion to calculate Green's function.
  arXiv  Detail & Related papers  (2023-09-18T16:28:11Z)
• 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)
• One-particle Green's functions from the quantum equation of motion algorithm [0.0]
  We introduce a novel near-term quantum algorithm for computing one-particle Green's functions via their Lehmann representation. We demonstrate the validity of the present proposal by computing the Green's function of a two-site Fermi-Hubbard model on a IBM quantum processor.
  arXiv  Detail & Related papers  (2022-01-05T21:13:19Z)
• 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)
• Variational Adiabatic Gauge Transformation on real quantum hardware for effective low-energy Hamiltonians and accurate diagonalization [68.8204255655161]
  We introduce the Variational Adiabatic Gauge Transformation (VAGT) VAGT is a non-perturbative hybrid quantum algorithm that can use nowadays quantum computers to learn the variational parameters of the unitary circuit. The accuracy of VAGT is tested trough numerical simulations, as well as simulations on Rigetti and IonQ quantum computers.
  arXiv  Detail & Related papers  (2021-11-16T20:50:08Z)
• 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)
• Quantum-Classical Hybrid Algorithm for the Simulation of All-Electron Correlation [58.720142291102135]
  We present a novel hybrid-classical algorithm that computes a molecule's all-electron energy and properties on the classical computer. We demonstrate the ability of the quantum-classical hybrid algorithms to achieve chemically relevant results and accuracy on currently available quantum computers.
  arXiv  Detail & Related papers  (2021-06-22T18:00:00Z)
• Krylov variational quantum algorithm for first principles materials simulations [2.432166214112399]
  We propose an algorithm to obtain Green's functions as a continued fraction on quantum computers. This allows the integration of quantum algorithms with first principles material science simulations.
  arXiv  Detail & Related papers  (2021-05-27T16:47:43Z)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)
• Variational Monte Carlo calculations of $\mathbf{A\leq 4}$ nuclei with an artificial neural-network correlator ansatz [62.997667081978825]
  We introduce a neural-network quantum state ansatz to model the ground-state wave function of light nuclei. We compute the binding energies and point-nucleon densities of $Aleq 4$ nuclei as emerging from a leading-order pionless effective field theory Hamiltonian.
  arXiv  Detail & Related papers  (2020-07-28T14:52:28Z)

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.