Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2505.01236 · IEEE International Conference on Quantum Computing and Engineering (QCE)

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

Chi Zhang, Lei Jiang, Fan Chen

Published Aug 30, 2025• 8 citations
arXivHTMLPDF

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 Qracle, a graph neural network (GNN)-based parameter initializer for VQEs. 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, 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), with all results averaged over the validation set of each respective application. The source code is publicly available at https://github.com/chizhang24/Qracle.

DOI
10.1109/qce65121.2025.00031

Related papers

VQEzy: An Open-Source Dataset for Parameter Initialization in Variational Quantum Eigensolvers

Chi Zhang, Mengxin Zheng, Qian Lou +2 more

Variational Quantum Eigensolvers (VQEs) are a leading class of noisy intermediate-scale quantum (NISQ) algorithms, whose performance is highly sensitive to parameter initialization. Although recent machine learning–based initialization methods have achieved state-of-the-art performance, their progress has been limited by the lack of comprehensive datasets. Existing resources are typically restricted to a single domain, contain only a few hundred instances, and lack complete coverage of Hamiltonians, ansatz circuits, and optimization trajectories. To overcome these limitations, we introduce VQEzy, the first large-scale dataset for VQE parameter initialization. VQEzy spans three major domains and seven representative tasks, comprising 12,110 instances with full VQE specifications and complete optimization trajectories. The dataset is available at https://github.com/chizhang24/VQEzy, and will be continuously refined and expanded to support future research in VQE optimization.

arXiv:2509.17322•IEEE International Conference on Acoustics Speech and Signal Processing•Apr 21, 2026•0 citations

Improving Generalization and Trainability of Quantum Eigensolvers via Graph Neural Encoding

Jungyun Lee, Daniel K. Park

Determining the ground state of a many-body Hamiltonian is a central problem across physics, chemistry, and combinatorial optimization, yet it is often classically intractable due to the exponential growth of Hilbert space with system size. Even on fault-tolerant quantum computers, quantum algorithms with convergence guarantees -- such as quantum phase estimation and quantum subspace methods -- require an initial state with sufficiently large overlap with the true ground state to be effective. Variational quantum eigensolvers (VQEs) are natural candidates for preparing such states; however, standard VQEs typically exhibit poor generalization, requiring retraining for each Hamiltonian instance, and often suffer from barren plateaus, where gradients can vanish exponentially with circuit depth and system size. To address these limitations, we propose an end-to-end representation learning framework that combines a graph autoencoder with a classical neural network to generate VQE parameters that generalize across Hamiltonian instances. By encoding interaction topology and coupling structure, the proposed model produces high-overlap initial states without instance-specific optimization. Through extensive numerical experiments on families of one- and two-local Hamiltonians, we demonstrate improved generalization and trainability, manifested as reduced test error and a significantly milder decay of gradient variance. We further show that our method substantially accelerates convergence in quantum subspace-based eigensolvers, highlighting its practical impact for downstream quantum algorithms.

quant-pharXiv:2602.19752•Machine Learning Science and Technology•Feb 24, 2026•1 citation

PVLS: A Learning-based Parameter Prediction Technique for Variational Quantum Linear Solvers

Youla Yang

Variational Quantum Linear Solvers (VQLS) are a promising method for solving linear systems on near-term quantum devices. However, their performance is often limited by barren plateaus and inefficient parameter initialization, which significantly hinder trainability as the system size increases. In this work, we introduce PVLS, a learning-based parameter prediction framework that uses Graph Neural Networks (GNNs) to generate high-quality initial parameters for VQLS circuits. By leveraging structural information from the coefficient matrix, PVLS predicts expressive and scalable initializations that improve convergence and reduce optimization difficulty. Extensive experiments on matrix sizes ranging from 16 to 1024 show that PVLS provides up to a 2.6x speedup in optimization and requires fewer iterations while maintaining comparable solution accuracy. These results demonstrate the potential of machine-learning-guided initialization strategies for improving the practicality of hybrid quantum-classical algorithms in the NISQ era.

quant-pharXiv:2512.04909•Dec 5, 2025•0 citations

QSeer: A Quantum-Inspired Graph Neural Network for Parameter Initialization in Quantum Approximate Optimization Algorithm Circuits

Lei Jiang, Chi Zhang, Fan Chen

To mitigate the barren plateau problem, effective parameter initialization is crucial for optimizing the Quantum Approximate Optimization Algorithm (QAOA) in the near-term Noisy Intermediate-Scale Quantum (NISQ) era. Prior physicsdriven approaches leveraged the optimal parameter concentration phenomenon, utilizing medium values of previously optimized QAOA parameters stored in databases as initialization for new graphs. However, this medium-value-based strategy lacks generalization capability. Conversely, prior computer-sciencebased approaches employed graph neural networks (GNNs) trained on previously optimized QAOA parameters to predict initialization values for new graphs. However, these approaches neglect key physics-informed QAOA principles, such as parameter concentration, symmetry, and adiabatic evolution, resulting in suboptimal parameter predictions and limited performance improvements. Furthermore, no existing GNN-based methods support parameter initialization for QAOA circuits with variable depths or for solving weighted Max-Cut problems. This paper introduces QSeer, a quantum-inspired GNN designed for accurate QAOA parameter prediction. First, we propose a quantum-inspired input data normalization technique to ensure a consistent input scale and mitigate the influence of varying feature magnitudes. By integrating key physics-informed QAOA principles, such as parameter concentration, symmetry, and adiabatic evolution, this approach enhances QSeer's training stability and convergence. Second, we encode Max-Cut edge weights as edge attributes in QSeer's GNN framework, enabling parameter prediction for QAOA circuits solving both unweighted and weighted Max-Cut problems. Third, we incorporate the circuit depth$p$as an input, allowing QSeer to generalize parameter predictions across different QAOA depths. Compared to prior physics- and computer-science-driven methods, QSeer improves the initial approximation ratio and convergence speed of QAOA circuits across diverse graphs by$6 \% \sim 68 \%$and$5 \times \sim 10 \times$, respectively. The source code is publicly available at https://github.com/UnchartedRLab/QSeer.

arXiv:2505.06810•IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•7 citations

Hybrid VQE–Graph Neural Network Framework for Scalable Binding-Affinity Prediction

Neeraja P, J Umamageswaran

The Variational Quantum Eigensolver (VQE) has emerged as a viable method for calculating molecular energies through its combination of quantum and classical computing power on NISQ systems. The existing methods for predicting binding affinities in intricate systems face difficulties because of two major problems which are noise issues and the inability to handle large systems. The Hybrid VQE-Graph Neural Network (VQE-GNN) solution which we present enables us to achieve accurate binding affinity predictions by using quantum molecular feature learning together with graph neural network technology. Our method combines Hamiltonian Fragmentation with a noise-resilient VQE approach and an attention-steered Graph Neural Network. The research project aims to create a solution which combines precise quantum chemistry results with practical machine learning models. The experiments which researchers conducted on both the PDBbind and BindingDB datasets demonstrated that our approach accomplished better prediction results together with improved correlation and ligand ranking performance when compared to standard GNNs which proves that quantum-classical hybrid systems hold considerable promise for drug discovery research.

International Conference on Computational Robotics, Testing and Engineering Evaluation (ICCRTEE)•May 14, 2026•0 citations

SpinGQE: A Generative Quantum Eigensolver for Spin Hamiltonians

Alexander Holden, Moinul Hossain Rahat, Nii Osae Osae Dade

The ground state search problem is central to quantum computing, with applications spanning quantum chemistry, condensed matter physics, and optimization. The Variational Quantum Eigensolver (VQE) has shown promise for small systems but faces significant limitations. These include barren plateaus, restricted ansatz expressivity, and reliance on domain-specific structure. We present SpinGQE, an extension of the Generative Quantum Eigensolver (GQE) framework to spin Hamiltonians. Our approach reframes circuit design as a generative modeling task. We employ a transformer-based decoder to learn distributions over quantum circuits that produce low-energy states. Training is guided by a weighted mean-squared error loss between model logits and circuit energies evaluated at each gate subsequence. We validate our method on the four-qubit Heisenberg model, demonstrating successfulconvergencetonear-groundstates. Throughsystematichyperparameterexploration, we identify optimal configurations: smaller model architectures (12 layers, 8 attention heads), longer sequence lengths (12 gates), and carefully chosen operator pools yield the most reliable convergence. Our results show that generative approaches can effectively navigate complex energy landscapes without relying on problem-specific symmetries or structure. This provides a scalable alternative to traditional variational methods for general quantum systems. An open-source implementation is available at https://github.com/Mindbeam-AI/SpinGQE.

quant-pharXiv:2603.24298•Mar 26, 2026•1 citation
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 Qracle, a graph neural network (GNN)-based parameter initializer for VQEs. 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, 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), with all results averaged over the validation set of each respective application. The source code is publicly available at https://github.com/chizhang24/Qracle.
Variational Quantum Eigensolvers (VQEs) are a leading class of noisy intermediate-scale quantum (NISQ) algorithms, whose performance is highly sensitive to parameter initialization. Although recent machine learning–based initialization methods have achieved state-of-the-art performance, their progress has been limited by the lack of comprehensive datasets. Existing resources are typically restricted to a single domain, contain only a few hundred instances, and lack complete coverage of Hamiltonians, ansatz circuits, and optimization trajectories. To overcome these limitations, we introduce VQEzy, the first large-scale dataset for VQE parameter initialization. VQEzy spans three major domains and seven representative tasks, comprising 12,110 instances with full VQE specifications and complete optimization trajectories. The dataset is available at https://github.com/chizhang24/VQEzy, and will be continuously refined and expanded to support future research in VQE optimization.
Determining the ground state of a many-body Hamiltonian is a central problem across physics, chemistry, and combinatorial optimization, yet it is often classically intractable due to the exponential growth of Hilbert space with system size. Even on fault-tolerant quantum computers, quantum algorithms with convergence guarantees -- such as quantum phase estimation and quantum subspace methods -- require an initial state with sufficiently large overlap with the true ground state to be effective. Variational quantum eigensolvers (VQEs) are natural candidates for preparing such states; however, standard VQEs typically exhibit poor generalization, requiring retraining for each Hamiltonian instance, and often suffer from barren plateaus, where gradients can vanish exponentially with circuit depth and system size. To address these limitations, we propose an end-to-end representation learning framework that combines a graph autoencoder with a classical neural network to generate VQE parameters that generalize across Hamiltonian instances. By encoding interaction topology and coupling structure, the proposed model produces high-overlap initial states without instance-specific optimization. Through extensive numerical experiments on families of one- and two-local Hamiltonians, we demonstrate improved generalization and trainability, manifested as reduced test error and a significantly milder decay of gradient variance. We further show that our method substantially accelerates convergence in quantum subspace-based eigensolvers, highlighting its practical impact for downstream quantum algorithms.
Variational Quantum Linear Solvers (VQLS) are a promising method for solving linear systems on near-term quantum devices. However, their performance is often limited by barren plateaus and inefficient parameter initialization, which significantly hinder trainability as the system size increases. In this work, we introduce PVLS, a learning-based parameter prediction framework that uses Graph Neural Networks (GNNs) to generate high-quality initial parameters for VQLS circuits. By leveraging structural information from the coefficient matrix, PVLS predicts expressive and scalable initializations that improve convergence and reduce optimization difficulty. Extensive experiments on matrix sizes ranging from 16 to 1024 show that PVLS provides up to a 2.6x speedup in optimization and requires fewer iterations while maintaining comparable solution accuracy. These results demonstrate the potential of machine-learning-guided initialization strategies for improving the practicality of hybrid quantum-classical algorithms in the NISQ era.
To mitigate the barren plateau problem, effective parameter initialization is crucial for optimizing the Quantum Approximate Optimization Algorithm (QAOA) in the near-term Noisy Intermediate-Scale Quantum (NISQ) era. Prior physicsdriven approaches leveraged the optimal parameter concentration phenomenon, utilizing medium values of previously optimized QAOA parameters stored in databases as initialization for new graphs. However, this medium-value-based strategy lacks generalization capability. Conversely, prior computer-sciencebased approaches employed graph neural networks (GNNs) trained on previously optimized QAOA parameters to predict initialization values for new graphs. However, these approaches neglect key physics-informed QAOA principles, such as parameter concentration, symmetry, and adiabatic evolution, resulting in suboptimal parameter predictions and limited performance improvements. Furthermore, no existing GNN-based methods support parameter initialization for QAOA circuits with variable depths or for solving weighted Max-Cut problems. This paper introduces QSeer, a quantum-inspired GNN designed for accurate QAOA parameter prediction. First, we propose a quantum-inspired input data normalization technique to ensure a consistent input scale and mitigate the influence of varying feature magnitudes. By integrating key physics-informed QAOA principles, such as parameter concentration, symmetry, and adiabatic evolution, this approach enhances QSeer's training stability and convergence. Second, we encode Max-Cut edge weights as edge attributes in QSeer's GNN framework, enabling parameter prediction for QAOA circuits solving both unweighted and weighted Max-Cut problems. Third, we incorporate the circuit depthpppas an input, allowing QSeer to generalize parameter predictions across different QAOA depths. Compared to prior physics- and computer-science-driven methods, QSeer improves the initial approximation ratio and convergence speed of QAOA circuits across diverse graphs by6%∼68%6 \% \sim 68 \%6%∼68%and5×∼10×5 \times \sim 10 \times5×∼10×, respectively. The source code is publicly available at https://github.com/UnchartedRLab/QSeer.
The Variational Quantum Eigensolver (VQE) has emerged as a viable method for calculating molecular energies through its combination of quantum and classical computing power on NISQ systems. The existing methods for predicting binding affinities in intricate systems face difficulties because of two major problems which are noise issues and the inability to handle large systems. The Hybrid VQE-Graph Neural Network (VQE-GNN) solution which we present enables us to achieve accurate binding affinity predictions by using quantum molecular feature learning together with graph neural network technology. Our method combines Hamiltonian Fragmentation with a noise-resilient VQE approach and an attention-steered Graph Neural Network. The research project aims to create a solution which combines precise quantum chemistry results with practical machine learning models. The experiments which researchers conducted on both the PDBbind and BindingDB datasets demonstrated that our approach accomplished better prediction results together with improved correlation and ligand ranking performance when compared to standard GNNs which proves that quantum-classical hybrid systems hold considerable promise for drug discovery research.
The ground state search problem is central to quantum computing, with applications spanning quantum chemistry, condensed matter physics, and optimization. The Variational Quantum Eigensolver (VQE) has shown promise for small systems but faces significant limitations. These include barren plateaus, restricted ansatz expressivity, and reliance on domain-specific structure. We present SpinGQE, an extension of the Generative Quantum Eigensolver (GQE) framework to spin Hamiltonians. Our approach reframes circuit design as a generative modeling task. We employ a transformer-based decoder to learn distributions over quantum circuits that produce low-energy states. Training is guided by a weighted mean-squared error loss between model logits and circuit energies evaluated at each gate subsequence. We validate our method on the four-qubit Heisenberg model, demonstrating successfulconvergencetonear-groundstates. Throughsystematichyperparameterexploration, we identify optimal configurations: smaller model architectures (12 layers, 8 attention heads), longer sequence lengths (12 gates), and carefully chosen operator pools yield the most reliable convergence. Our results show that generative approaches can effectively navigate complex energy landscapes without relying on problem-specific symmetries or structure. This provides a scalable alternative to traditional variational methods for general quantum systems. An open-source implementation is available at https://github.com/Mindbeam-AI/SpinGQE.