Greedy Gradient-free Adaptive Variational Quantum Algorithms on a Noisy Intermediate Scale Quantum Computer

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Feniou, César, Hassan, Muhammad, Claudon, Baptiste, Courtat, Axel, Adjoua, Olivier, Maday, Yvon, Piquemal, Jean-Philip
Format: Preprint
Published: 2023
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866916765034872832
author Feniou, César
Hassan, Muhammad
Claudon, Baptiste
Courtat, Axel
Adjoua, Olivier
Maday, Yvon
Piquemal, Jean-Philip
author_facet Feniou, César
Hassan, Muhammad
Claudon, Baptiste
Courtat, Axel
Adjoua, Olivier
Maday, Yvon
Piquemal, Jean-Philip
contents Hybrid quantum-classical adaptive Variational Quantum Eigensolvers (VQE) hold the potential to outperform classical computing for simulating many-body quantum systems. However, practical implementations on current quantum processing units (QPUs) are challenging due to the noisy evaluation of a polynomially scaling number of observables, undertaken for operator selection and high-dimensional cost function optimization. We introduce an adaptive algorithm using analytic, gradient-free optimization, called Greedy Gradient-free Adaptive VQE (GGA-VQE). In addition to demonstrating the algorithm's improved resilience to statistical sampling noise in the computation of simple molecular ground states, we execute GGA-VQE on a 25-qubit error-mitigated QPU by computing the ground state of a 25-body Ising model. Although hardware noise on the QPU produces inaccurate energies, our implementation outputs a parameterized quantum circuit yielding a favorable ground-state approximation. We demonstrate this by retrieving the parameterized operators calculated on the QPU and evaluating the resulting ansatz wave-function via noiseless emulation (i.e., hybrid observable measurement).
format Preprint
id arxiv_https___arxiv_org_abs_2306_17159
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Greedy Gradient-free Adaptive Variational Quantum Algorithms on a Noisy Intermediate Scale Quantum Computer
Feniou, César
Hassan, Muhammad
Claudon, Baptiste
Courtat, Axel
Adjoua, Olivier
Maday, Yvon
Piquemal, Jean-Philip
Quantum Physics
Chemical Physics
Hybrid quantum-classical adaptive Variational Quantum Eigensolvers (VQE) hold the potential to outperform classical computing for simulating many-body quantum systems. However, practical implementations on current quantum processing units (QPUs) are challenging due to the noisy evaluation of a polynomially scaling number of observables, undertaken for operator selection and high-dimensional cost function optimization. We introduce an adaptive algorithm using analytic, gradient-free optimization, called Greedy Gradient-free Adaptive VQE (GGA-VQE). In addition to demonstrating the algorithm's improved resilience to statistical sampling noise in the computation of simple molecular ground states, we execute GGA-VQE on a 25-qubit error-mitigated QPU by computing the ground state of a 25-body Ising model. Although hardware noise on the QPU produces inaccurate energies, our implementation outputs a parameterized quantum circuit yielding a favorable ground-state approximation. We demonstrate this by retrieving the parameterized operators calculated on the QPU and evaluating the resulting ansatz wave-function via noiseless emulation (i.e., hybrid observable measurement).
title Greedy Gradient-free Adaptive Variational Quantum Algorithms on a Noisy Intermediate Scale Quantum Computer
topic Quantum Physics
Chemical Physics
url https://arxiv.org/abs/2306.17159