Optimizing unitary coupled cluster wave functions on quantum hardware: Error bound and resource-efficient optimizer

In this study, we study the projective quantum eigensolver (PQE) approach, a hybrid quantum-classical algorithm that, by optimizing a unitary coupled cluster wave function, aims at computing the ground state of many-body systems. Instead of trying to minimize the energy of the system like the variational quantum eigensolver (VQE), PQE uses projections of the Schrödinger equation to efficiently bring the trial state closer to an eigenstate of the Hamiltonian. In this study, we provide a mathematical study of the algorithm. We derive a bound relating off-diagonal coefficients (residues) of the Hamiltonian to the energy error of the algorithm and the overlap achieved by the obtained wavefunction. These bounds not only give formal guarantees to PQE, but they also allow us to formulate a well-informed convergence criterion for residue-based optimizers. We then study the classical optimization itself and derive convergence guarantees under certain conditions. We propose a new residue-based optimizer, with numerical evidence of the superiority of this new approach for H4, H6, BeH2, and LiH dissociation curves over both the optimization introduced in Stair and Evangelista [PRX Quantum 2, 030301 (2021)] and VQE optimized using the Broyden-Fletcher-Goldfarb-Shanno method.

Authors

Institutions

Publication Details

Journal
The Journal of Chemical Physics
Published
2025-12-02
DOI
https://doi.org/10.1063/5.0299885
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Optimizing unitary coupled cluster wave functions on quantum hardware: Error bound and resource-efficient optimizer

Thomas Ayral, Martin Plazanet
The Journal of Chemical Physics
Quantum Computing Algorithms and Architecture
article

Optimizing unitary coupled cluster wave functions on quantum hardware: Error bound and resource-efficient optimizer

Thomas Ayral, Martin Plazanet
article en

Abstract

In this study, we study the projective quantum eigensolver (PQE) approach, a hybrid quantum-classical algorithm that, by optimizing a unitary coupled cluster wave function, aims at computing the ground state of many-body systems. Instead of trying to minimize the energy of the system like the variational quantum eigensolver (VQE), PQE uses projections of the Schrödinger equation to efficiently bring the trial state closer to an eigenstate of the Hamiltonian. In this study, we provide a mathematical study of the algorithm. We derive a bound relating off-diagonal coefficients (residues) of the Hamiltonian to the energy error of the algorithm and the overlap achieved by the obtained wavefunction. These bounds not only give formal guarantees to PQE, but they also allow us to formulate a well-informed convergence criterion for residue-based optimizers. We then study the classical optimization itself and derive convergence guarantees under certain conditions. We propose a new residue-based optimizer, with numerical evidence of the superiority of this new approach for H4, H6, BeH2, and LiH dissociation curves over both the optimization introduced in Stair and Evangelista [PRX Quantum 2, 030301 (2021)] and VQE optimized using the Broyden-Fletcher-Goldfarb-Shanno method.

The Journal of Chemical PhysicsVol. 163(21)
Centre for Quantum Technologies (SG), École Polytechnique (FR), National University of Singapore (SG), UMI MajuLab (SG), Hôpital Jean Jaurès (FR)
Openalex Percentile: Top 80%
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.