A variational quantum eigensolver for dynamic correlation functions

• URL: http://arxiv.org/abs/2105.01703v2
• Date: Mon, 10 May 2021 13:29:38 GMT
• Title: A variational quantum eigensolver for dynamic correlation functions
• Authors: Hongxiang Chen, Max Nusspickel, Jules Tilly, George H. Booth
• Abstract summary: We show how the calculation of zero-temperature dynamic correlation functions can be recast into a modified VQE algorithm. This allows for important physical expectation values describing the dynamics of the system to be directly converged on the frequency axis. We believe the approach shows potential for the extraction of frequency dynamics of correlated systems on near-term quantum processors.
• Score: 0.9176056742068814
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Recent practical approaches for the use of current generation noisy quantum devices in the simulation of quantum many-body problems have been dominated by the use of a variational quantum eigensolver (VQE). These coupled quantum-classical algorithms leverage the ability to perform many repeated measurements to avoid the currently prohibitive gate depths often required for exact quantum algorithms, with the restriction of a parameterized circuit to describe the states of interest. In this work, we show how the calculation of zero-temperature dynamic correlation functions defining the linear response characteristics of quantum systems can also be recast into a modified VQE algorithm, which can be incorporated into the current variational quantum infrastructure. This allows for these important physical expectation values describing the dynamics of the system to be directly converged on the frequency axis, and they approach exactness over all frequencies as the flexibility of the parameterization increases. The frequency resolution hence does not explicitly scale with gate depth, which is approximately twice as deep as a ground state VQE. We apply the method to compute the single-particle Green's function of ab initio dihydrogen and lithium hydride molecules, and demonstrate the use of a practical active space embedding approach to extend to larger systems. While currently limited by the fidelity of two-qubit gates, whose number is increased compared to the ground state algorithm on current devices, we believe the approach shows potential for the extraction of frequency dynamics of correlated systems on near-term quantum processors.

Related papers

• Benchmarking Variational Quantum Eigensolvers for Entanglement Detection in Many-Body Hamiltonian Ground States [37.69303106863453]
  Variational quantum algorithms (VQAs) have emerged in recent years as a promise to obtain quantum advantage. We use a specific class of VQA named variational quantum eigensolvers (VQEs) to benchmark them at entanglement witnessing and entangled ground state detection. Quantum circuits whose structure is inspired by the Hamiltonian interactions presented better results on cost function estimation than problem-agnostic circuits.
  arXiv  Detail & Related papers  (2024-07-05T12:06:40Z)
• Characterizing randomness in parameterized quantum circuits through expressibility and average entanglement [39.58317527488534]
  Quantum Circuits (PQCs) are still not fully understood outside the scope of their principal application. We analyse the generation of random states in PQCs under restrictions on the qubits connectivities. We place a connection between how steep is the increase on the uniformity of the distribution of the generated states and the generation of entanglement.
  arXiv  Detail & Related papers  (2024-05-03T17:32:55Z)
• A circuit-generated quantum subspace algorithm for the variational quantum eigensolver [0.0]
  We propose combining quantum subspace techniques with the variational quantum eigensolver (VQE) In our approach, the parameterized quantum circuit is divided into a series of smaller subcircuits. The sequential application of these subcircuits to an initial state generates a set of wavefunctions that we use as a quantum subspace to obtain high-accuracy groundstate energies.
  arXiv  Detail & Related papers  (2024-04-09T18:00:01Z)
• Reaction dynamics with qubit-efficient momentum-space mapping [42.408991654684876]
  We study quantum algorithms for response functions, relevant for describing different reactions governed by linear response. We consider a qubit-efficient mapping on a lattice, which can be efficiently performed using momentum-space basis states.
  arXiv  Detail & Related papers  (2024-03-30T00:21:46Z)
• Maximising Quantum-Computing Expressive Power through Randomised Circuits [4.604271571912073]
  variational quantum algorithms (VQAs) have emerged as a promising avenue to obtain quantum advantage. We numerically demonstrate a novel approach for VQAs, utilizing randomised quantum circuits to generate the variational wavefunction. This random-circuit approach presents a trade-off between the expressive power of the variational wavefunction and time cost.
  arXiv  Detail & Related papers  (2023-12-04T15:04:42Z)
• 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)
• 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)
• Improving the accuracy and efficiency of quantum connected moments expansions [4.9834612867114965]
  In quantum chemistry, the variational quantum eigensolver (VQE) algorithm has become ubiquitous. Here we use the ADAPT-VQE algorithm to test shallow circuit construction strategies.
  arXiv  Detail & Related papers  (2021-03-16T15:13:40Z)
• Gate-free state preparation for fast variational quantum eigensolver simulations: ctrl-VQE [0.0]
  VQE is currently the flagship algorithm for solving electronic structure problems on near-term quantum computers. We propose an alternative algorithm where the quantum circuit used for state preparation is removed entirely and replaced by a quantum control routine. As with VQE, the objective function optimized is the expectation value of the qubit-mapped molecular Hamiltonian.
  arXiv  Detail & Related papers  (2020-08-10T17:53:09Z)

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.