Quantum approximation algorithms for many-body and electronic structure
problems
- URL: http://arxiv.org/abs/2111.08090v2
- Date: Wed, 11 Jan 2023 17:34:49 GMT
- Title: Quantum approximation algorithms for many-body and electronic structure
problems
- Authors: Karen J. Morenz Korol, Kenny Choo, Antonio Mezzacapo
- Abstract summary: Three algorithms produce approximate ground states for many-body and electronic structure problems.
They can be used stand-alone or in conjunction with existing quantum algorithms for ground states.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Computing many-body ground state energies and resolving electronic structure
calculations are fundamental problems for fields such as quantum chemistry or
condensed matter. Several quantum computing algorithms that address these
problems exist, although it is often challenging to establish rigorous bounds
on their performances. Here we detail three algorithms that produce approximate
ground states for many-body and electronic structure problems, generalizing
some previously known results for 2-local Hamiltonians. Each method comes with
asymptotic bounds on the energies produced. The first one produces a separable
state which improves on random product states. We test it on a spinless Hubbard
model, validating numerically the theoretical result. The other two algorithms
produce entangled states via shallow or deep circuits, improving on the
energies of given initial states. We demonstrate their performance via
numerical experiments on a 2-dimensional Hubbard model, starting from a
checkerboard product state, as well as on some chemistry Hamiltonians, using
the Hartree-Fock state as reference. In both cases, we show that the
approximate energies produced are close to the exact ones. These algorithms
provide a way to systematically improve the estimation of ground state energies
and can be used stand-alone or in conjunction with existing quantum algorithms
for ground states.
Related papers
- Generating Approximate Ground States of Strongly Correlated Quantum Many-Body Systems Through Quantum Imaginary Time Evolution [0.0]
We numerically study the capabilities of the QITE algorithm in approximating the ITE of lattice and molecular electronic structure Hamiltonians.
We show how imaginary time evolved fermionic Gaussian states can serve as initial states which can be efficiently computed on classical computers.
arXiv Detail & Related papers (2024-09-02T15:20:41Z) - Calculating the many-body density of states on a digital quantum
computer [58.720142291102135]
We implement a quantum algorithm to perform an estimation of the density of states on a digital quantum computer.
We use our algorithm to estimate the density of states of a non-integrable Hamiltonian on the Quantinuum H1-1 trapped ion chip for a controlled register of 18bits.
arXiv Detail & Related papers (2023-03-23T17:46:28Z) - Sparse random Hamiltonians are quantumly easy [105.6788971265845]
A candidate application for quantum computers is to simulate the low-temperature properties of quantum systems.
This paper shows that, for most random Hamiltonians, the maximally mixed state is a sufficiently good trial state.
Phase estimation efficiently prepares states with energy arbitrarily close to the ground energy.
arXiv Detail & Related papers (2023-02-07T10:57:36Z) - 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) - Benchmarking Small-Scale Quantum Devices on Computing Graph Edit
Distance [52.77024349608834]
Graph Edit Distance (GED) measures the degree of (dis)similarity between two graphs in terms of the operations needed to make them identical.
In this paper we present a comparative study of two quantum approaches to computing GED.
arXiv Detail & Related papers (2021-11-19T12:35:26Z) - Computing molecular excited states on a D-Wave quantum annealer [52.5289706853773]
We demonstrate the use of a D-Wave quantum annealer for the calculation of excited electronic states of molecular systems.
These simulations play an important role in a number of areas, such as photovoltaics, semiconductor technology and nanoscience.
arXiv Detail & Related papers (2021-07-01T01:02:17Z) - Iterative Quantum Assisted Eigensolver [0.0]
We provide a hybrid quantum-classical algorithm for approximating the ground state of a Hamiltonian.
Our algorithm builds on the powerful Krylov subspace method in a way that is suitable for current quantum computers.
arXiv Detail & Related papers (2020-10-12T12:25:16Z) - Electronic structure with direct diagonalization on a D-Wave quantum
annealer [62.997667081978825]
This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer.
We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
arXiv Detail & Related papers (2020-09-02T22:46:47Z) - Preparing symmetry broken ground states with variational quantum
algorithms [0.559239450391449]
In solid state physics, finding the correct symmetry broken ground state of an interacting electron system is one of the central challenges.
In this work, we discuss three variations of the Variational Hamiltonian Ansatz (VHA) designed to find the correct broken symmetry states.
For the calculation we simulate a gate-based quantum computer and also consider the effects of dephasing noise on the algorithms.
arXiv Detail & Related papers (2020-07-03T09:51:02Z) - Algorithms for quantum simulation at finite energies [0.7734726150561088]
We introduce two kinds of quantum algorithms to explore microcanonical and canonical properties of many-body systems.
One is a hybrid quantum algorithm that computes expectation values in a finite energy interval around its mean energy.
The other is a quantum-assisted Monte Carlo sampling method to compute other quantities.
arXiv Detail & Related papers (2020-06-04T17:40:29Z) - Near-optimal ground state preparation [3.7747526957907303]
We propose a quantum-classical algorithm to estimate the ground energy of a Hamiltonian.
The dependence of the number of queries to the initial state on the desired precision is exponentially improved compared to the current state-of-the-art algorithm.
We also prove that our algorithms reach the complexity lower bounds by applying it to the unstructured search problem and the quantum approximate counting problem.
arXiv Detail & Related papers (2020-02-28T01:46:25Z)
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.