Pith. sign in

REVIEW 1 cited by

Qracle: A Graph-Neural-Network-based Parameter Initializer for Variational Quantum Eigensolvers

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2505.01236 v2 pith:CAC4VM75 submitted 2025-05-02 quant-ph physics.comp-ph

Qracle: A Graph-Neural-Network-based Parameter Initializer for Variational Quantum Eigensolvers

classification quant-ph physics.comp-ph
keywords quantumqracleansatzparametertextitassociatedeigensolversgraph
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Variational Quantum Eigensolvers (VQEs) are a leading class of noisy intermediate-scale quantum (NISQ) algorithms with broad applications in quantum physics and quantum chemistry. However, as system size increases, VQE optimization is increasingly hindered by the barren plateau phenomenon, where gradients vanish and the loss function becomes trapped in local minima. While machine learning-based parameter initialization methods have been proposed to address this challenge, they often show limited effectiveness in complex VQE problems. This is primarily due to their inadequate ability to model the intricate correlations embedded in the Hamiltonian structure and the associated ansatz circuits. In this paper, we propose \textit{Qracle}, a graph neural network (GNN)-based parameter initializer for VQEs. \textit{Qracle} systematically encodes both the Hamiltonian and the associated ansatz circuit into a unified graph representation and leverages a GNN to learn a mapping from VQE problem graphs to optimized ansatz parameters. Compared to state-of-the-art initialization techniques, \textit{Qracle} achieves a reduction in initial loss of up to $10.86$, accelerates convergence by decreasing optimization steps by up to $64.42\%$, and improves final performance with up to a $26.43\%$ reduction in Symmetric Mean Absolute Percentage Error (SMAPE).

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Learning to Prepare Molecular Ground States with Transformer Models

    quant-ph 2026-07 conditional novelty 6.0

    Transformers trained on ADAPT-VQE data generate imipramine ground-state circuits in seconds at roughly reference accuracy — and beat the training data after reinforcement learning — though real-hardware energies still...