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:2601.09951

Parallelizing the Variational Quantum Eigensolver: From JIT Compilation to Multi-GPU Scaling

Rylan Malarchick, Ashton Steed

quant-phSubmitted Jan 15, 2026• Announced Jan 16, 2026• 0 citations• Revised Oct 6, 2026 (v2)
v1 · Jan 15, 2026v2 · Oct 6, 2026
arXivHTMLPDF

Abstract

The Variational Quantum Eigensolver (VQE) is a hybrid quantum-classical algorithm for ground-state energies of molecular systems. We compute the potential energy surface of the hydrogen molecule (H2) at 100 bond lengths with PennyLane on the ERAU Vega cluster (AMD EPYC 9654 CPUs, 4 NVIDIA H100 GPUs) and compare a serial baseline, an Optax and Catalyst JIT version, a lightning.gpu version, and an MPI version. Early stopping, a larger learning rate, and warm starts reduce the iteration count from 30,000 to 7,033 and the runtime from 593.95 s to 143.80 s, while the time per iteration stays between 0.0198 s and 0.0204 s. At 4 qubits, lightning.gpu lowers the time per iteration to 0.0145 s. MPI runs with 2 to 32 ranks finish in 8.45 s to 5.04 s; the serial and MPI jobs ran under different core allocations, so we do not report their ratio as a parallel speedup. In a 4 to 26 qubit study with different CPU and GPU software stacks, the CPU/GPU time ratio ranges from 3.5 to 81.5. One H100 runs up to 29 qubits.

Comments
v2: corrects speedup attribution, MPI scaling, and multi-GPU efficiency claims of v1; 10 pages, 3 figures, 5 tables

Related papers

Simulator Demonstration of Large Scale Variational Quantum Algorithm on HPC Cluster

Mikio Morita, Yoshinori Tomita, Junpei Koyama +1 more

Advances in quantum simulator technology are increasingly required because research on quantum algorithms is becoming more sophisticated and complex. State vector simulation utilizes CPU and memory resources in computing nodes exponentially with respect to the number of qubits; furthermore, in a variational quantum algorithm, the large number of repeated runs by classical optimization is also a heavy load. This problem has been addressed by preparing numerous computing nodes or simulation frameworks that operate effectively. This study aimed to accelerate quantum simulation using two newly proposed methods: to efficiently utilize limited computational resources by adjusting the ratio of the MPI and distributed processing parallelism corresponding to the target problem settings and to slim down the Hamiltonian by considering the effect of accuracy on the calculation result. Ground-state energy calculations of a fermionic model were performed using a variational quantum eigensolver (VQE) on an HPC cluster with up to 1024 FUJITSU Processor A64FX connected to each other by InfiniBand; the processor is also used on supercomputer Fugaku. We achieved 200 times higher speed over VQE simulations and demonstrated 32 qubits ground-state energy calculations in acceptable time. This result indicates that > 30 qubit state vector simulations can be realistically utilized for further research on variational quantum algorithms.

arXiv:2402.11878•IEEE Access•Jan 1, 2024•8 citations

Benchmarking Variational Quantum Eigensolvers for Quantum Chemistry

Jiaqi Hu, Junning Li, Lin, Yanling +6 more

Quantum chemistry is one of the most promising applications of quantum computers in the near future. For noisy intermediate-scale quantum devices, the quantum-classical hybrid framework based on the variational quantum eigensolver (VQE) has become the method of choice. In the literature, there are many different variants of VQE, but it is not known which one is optimal for a given molecule. For this purpose, we perform a thorough benchmarking on more than ten different kinds of VQE ansatzes (in systems up to 30 qubits), based on their performance on the energy accuracy, runtime until convergence, and number of parameters. Our results show that the ADAPT ansatz can be used to obtain more accurate energy for small systems (below 14 qubits), but it costs much more computational resources. For larger molecules, UCCSD0 has better performance. However, all the tested ansatzes can hardly reach chemical accuracy at stretched bond lengths. Our results were obtained using MindSpore Quantum, where the codes and the benchmarking toolkit are publicly available at Gitee.

arXiv:2211.12775•Nov 23, 2022•5 citations

Simulation of Potential Energy Curves for H₂ and LiH Molecules Using the Variational Quantum Eigensolver: A Comparative Study of Ideal and Noisy Quantum Hardware Conditions on Qiskit

Rudrapriyo Sengupta

This study investigates the Variational Quantum Eigensolver (VQE), a hybrid quantum-classical algorithm that partitions the computational workload between a quantum processing unit and a classical optimiser to determine the ground-state energies of molecular systems. The Qiskit SDK v1.x framework is employed, utilising the PySCFDriver module within the qiskit-nature package to construct second-quantised molecular electronic Hamiltonians for two representative systems: Hydrogen ( ) and Lithium Hydride ( ). For the complete active space is retained without spatial reduction, mapping the full Hamiltonian onto a 4-qubit register. However for the full STO-3G representation demands 12 qubits, rendering direct classical parameter optimisation computationally intractable. This bottleneck is resolved by applying an ActiveSpaceTransformer (num_electrons=2, num_spatial_orbitals=3) to freeze the chemically inactive lithium core electrons, reducing the active register to 6 qubits. Fermionic operators are subsequently converted to Pauli strings via the Jordan-Wigner transformation ( ) enabling the quantum processor to evaluate the molecular Hamiltonian as a circuit while preserving the fermionic anti-commutation relations. Under ideal, noise-free simulation using the StatevectorEstimator primitive paired with the COBYLA optimiser (maxiter=200), all VQE energy points converge precisely onto the Full Configuration Interaction (FCI) classical baseline across the full range of interatomic separations. This confirms that the hardware-efficient TwoLocal ansatz ( rotation layers and entanglement layers with reps=3) possesses sufficient expressive power to capture the molecular ground-state wavefunction. Introducing gate-level noise through AerSimulator backends calibrated from the FakeManilaV2 and FakeNairobiV2 hardware profiles—with optimisation driven by the SPSA algorithm (maxiter=150)—reveals two critical failure modes. A systematic upward energy bias is observed, attributable to depolarising gate errors and measurement readout faults that prevent the optimiser from reaching the true minimum energy eigenvalue. Additionally, severe stochastic oscillations between 1.0 Å and 1.5 Å on the curve induce premature convergence of the SPSA optimiser to spurious local minima. These results demonstrate that unmitigated hardware noise renders VQE incapable of reliably predicting equilibrium bond lengths on current NISQ devices, motivating the future integration of Zero-Noise Extrapolation (ZNE), readout error mitigation, and Virtual Distillation into the computational pipeline. Keywords—Variational Quantum Eigensolver (VQE); Qiskit 1.x; Potential Energy Curve; Molecular Ground-State Energy; Hardware-Efficient Ansatz; Gate-Level Noise Simulation; ActiveSpaceTransformer; NISQ Devices.

•Jun 22, 2026•0 citations

Graph-VQE: A CUDA-Q Multi-QPU Simulation Framework for Hamiltonian-Aware Protein-Folding VQE

Feng, Yujun, Yuqi Zhang, Jingyi Huang +4 more

The Variational Quantum Eigensolver (VQE) is essential for molecular simulation in drug discovery, but hardware noise and algorithmic limits restrict its precision. While the NVIDIA CUDA-Q platform mitigates some hardware issues via exact simulation, it lacks Qiskit support and restricts parallelization. To solve this, we introduce Graph-VQE, a novel framework that extends CUDA-Q with optimization-level parallelism. Graph-VQE leverages amino acid sequence structures by partitioning Hamiltonian interaction graphs into weakly coupled clusters using Louvain community detection. These clusters undergo restricted updates on the full-Hamiltonian objective, followed by a global refinement stage utilizing Hamiltonian batching. Furthermore, a custom Qiskit-CUDA-Q integration layer enables standard workflows with GPU acceleration. Evaluations on protein folding tasks prove that Graph-VQE outperforms baselines, achieving lower final energies. It delivers competitive RMSD and binding affinity compared to AlphaFold3 and IBM quantum processors while maintaining stable quality across multi-GPU environments, thereby providing a highly practical path toward high-fidelity biomolecular simulations.

arXiv:2607.02749•Jul 2, 2026•0 citations

Accelerating the variational quantum eigensolver using parallelism

Lana Mineh, Ashley Montanaro

Abstract Quantum computers are getting larger and larger, but device fidelities may not be able to keep up with the increase in qubit numbers. One way to make use of a large device that has a limited gate depth is to run many small circuits simultaneously. In this paper we detail our investigations into running circuits in parallel on the Rigetti Aspen-M-1 device. We run two-qubit circuits in parallel to solve a simple instance of the Hubbard model using the variational quantum eigensolver (VQE). We present results for running up to 33 circuits in parallel (66 qubits), showing that with the use of error mitigation techniques it is possible to make use of, and gain a real-time speedup from, parallelisation on current quantum hardware. We obtain a speedup by 18× for exploring the VQE energy landscape, and by more than 8× for running VQE optimisation.

arXiv:2209.03796•Quantum Science and Technology•Apr 27, 2023•24 citations

Use VQE to calculate the ground energy of hydrogen molecules on IBM Quantum

Maomin Qing, Wei Xie

Quantum computing has emerged as a promising technology for solving problems that are intractable for classical computers. In this study, we introduce quantum computing and implement the Variational Quantum Eigensolver (VQE) algorithm using Qiskit on the IBM Quantum platform to calculate the ground state energy of a hydrogen molecule. We provide a theoretical framework of quantum mechanics, qubits, quantum gates, and the VQE algorithm. Our implementation process is described, and we simulate the results. Additionally, experiments are conducted on the IBM Quantum platform, and the results are analyzed. Our fi ndings demonstrate that VQE can effi ciently calculate molecular properties with high accuracy. However, limitations and challenges in scaling the algorithm for larger molecules are also identifi ed. This work contributes to the growing body of research on quantum computing and highlights the potential applications of VQE for real-world problem-solving.

arXiv:2305.06538•May 11, 2023•2 citations
The Variational Quantum Eigensolver (VQE) is a hybrid quantum-classical algorithm for ground-state energies of molecular systems. We compute the potential energy surface of the hydrogen molecule (H2) at 100 bond lengths with PennyLane on the ERAU Vega cluster (AMD EPYC 9654 CPUs, 4 NVIDIA H100 GPUs) and compare a serial baseline, an Optax and Catalyst JIT version, a lightning.gpu version, and an MPI version. Early stopping, a larger learning rate, and warm starts reduce the iteration count from 30,000 to 7,033 and the runtime from 593.95 s to 143.80 s, while the time per iteration stays between 0.0198 s and 0.0204 s. At 4 qubits, lightning.gpu lowers the time per iteration to 0.0145 s. MPI runs with 2 to 32 ranks finish in 8.45 s to 5.04 s; the serial and MPI jobs ran under different core allocations, so we do not report their ratio as a parallel speedup. In a 4 to 26 qubit study with different CPU and GPU software stacks, the CPU/GPU time ratio ranges from 3.5 to 81.5. One H100 runs up to 29 qubits.
Advances in quantum simulator technology are increasingly required because research on quantum algorithms is becoming more sophisticated and complex. State vector simulation utilizes CPU and memory resources in computing nodes exponentially with respect to the number of qubits; furthermore, in a variational quantum algorithm, the large number of repeated runs by classical optimization is also a heavy load. This problem has been addressed by preparing numerous computing nodes or simulation frameworks that operate effectively. This study aimed to accelerate quantum simulation using two newly proposed methods: to efficiently utilize limited computational resources by adjusting the ratio of the MPI and distributed processing parallelism corresponding to the target problem settings and to slim down the Hamiltonian by considering the effect of accuracy on the calculation result. Ground-state energy calculations of a fermionic model were performed using a variational quantum eigensolver (VQE) on an HPC cluster with up to 1024 FUJITSU Processor A64FX connected to each other by InfiniBand; the processor is also used on supercomputer Fugaku. We achieved 200 times higher speed over VQE simulations and demonstrated 32 qubits ground-state energy calculations in acceptable time. This result indicates that > 30 qubit state vector simulations can be realistically utilized for further research on variational quantum algorithms.
Quantum chemistry is one of the most promising applications of quantum computers in the near future. For noisy intermediate-scale quantum devices, the quantum-classical hybrid framework based on the variational quantum eigensolver (VQE) has become the method of choice. In the literature, there are many different variants of VQE, but it is not known which one is optimal for a given molecule. For this purpose, we perform a thorough benchmarking on more than ten different kinds of VQE ansatzes (in systems up to 30 qubits), based on their performance on the energy accuracy, runtime until convergence, and number of parameters. Our results show that the ADAPT ansatz can be used to obtain more accurate energy for small systems (below 14 qubits), but it costs much more computational resources. For larger molecules, UCCSD0 has better performance. However, all the tested ansatzes can hardly reach chemical accuracy at stretched bond lengths. Our results were obtained using MindSpore Quantum, where the codes and the benchmarking toolkit are publicly available at Gitee.
This study investigates the Variational Quantum Eigensolver (VQE), a hybrid quantum-classical algorithm that partitions the computational workload between a quantum processing unit and a classical optimiser to determine the ground-state energies of molecular systems. The Qiskit SDK v1.x framework is employed, utilising the PySCFDriver module within the qiskit-nature package to construct second-quantised molecular electronic Hamiltonians for two representative systems: Hydrogen ( ) and Lithium Hydride ( ). For the complete active space is retained without spatial reduction, mapping the full Hamiltonian onto a 4-qubit register. However for the full STO-3G representation demands 12 qubits, rendering direct classical parameter optimisation computationally intractable. This bottleneck is resolved by applying an ActiveSpaceTransformer (num_electrons=2, num_spatial_orbitals=3) to freeze the chemically inactive lithium core electrons, reducing the active register to 6 qubits. Fermionic operators are subsequently converted to Pauli strings via the Jordan-Wigner transformation ( ) enabling the quantum processor to evaluate the molecular Hamiltonian as a circuit while preserving the fermionic anti-commutation relations. Under ideal, noise-free simulation using the StatevectorEstimator primitive paired with the COBYLA optimiser (maxiter=200), all VQE energy points converge precisely onto the Full Configuration Interaction (FCI) classical baseline across the full range of interatomic separations. This confirms that the hardware-efficient TwoLocal ansatz ( rotation layers and entanglement layers with reps=3) possesses sufficient expressive power to capture the molecular ground-state wavefunction. Introducing gate-level noise through AerSimulator backends calibrated from the FakeManilaV2 and FakeNairobiV2 hardware profiles—with optimisation driven by the SPSA algorithm (maxiter=150)—reveals two critical failure modes. A systematic upward energy bias is observed, attributable to depolarising gate errors and measurement readout faults that prevent the optimiser from reaching the true minimum energy eigenvalue. Additionally, severe stochastic oscillations between 1.0 Å and 1.5 Å on the curve induce premature convergence of the SPSA optimiser to spurious local minima. These results demonstrate that unmitigated hardware noise renders VQE incapable of reliably predicting equilibrium bond lengths on current NISQ devices, motivating the future integration of Zero-Noise Extrapolation (ZNE), readout error mitigation, and Virtual Distillation into the computational pipeline. Keywords—Variational Quantum Eigensolver (VQE); Qiskit 1.x; Potential Energy Curve; Molecular Ground-State Energy; Hardware-Efficient Ansatz; Gate-Level Noise Simulation; ActiveSpaceTransformer; NISQ Devices.
The Variational Quantum Eigensolver (VQE) is essential for molecular simulation in drug discovery, but hardware noise and algorithmic limits restrict its precision. While the NVIDIA CUDA-Q platform mitigates some hardware issues via exact simulation, it lacks Qiskit support and restricts parallelization. To solve this, we introduce Graph-VQE, a novel framework that extends CUDA-Q with optimization-level parallelism. Graph-VQE leverages amino acid sequence structures by partitioning Hamiltonian interaction graphs into weakly coupled clusters using Louvain community detection. These clusters undergo restricted updates on the full-Hamiltonian objective, followed by a global refinement stage utilizing Hamiltonian batching. Furthermore, a custom Qiskit-CUDA-Q integration layer enables standard workflows with GPU acceleration. Evaluations on protein folding tasks prove that Graph-VQE outperforms baselines, achieving lower final energies. It delivers competitive RMSD and binding affinity compared to AlphaFold3 and IBM quantum processors while maintaining stable quality across multi-GPU environments, thereby providing a highly practical path toward high-fidelity biomolecular simulations.
Abstract Quantum computers are getting larger and larger, but device fidelities may not be able to keep up with the increase in qubit numbers. One way to make use of a large device that has a limited gate depth is to run many small circuits simultaneously. In this paper we detail our investigations into running circuits in parallel on the Rigetti Aspen-M-1 device. We run two-qubit circuits in parallel to solve a simple instance of the Hubbard model using the variational quantum eigensolver (VQE). We present results for running up to 33 circuits in parallel (66 qubits), showing that with the use of error mitigation techniques it is possible to make use of, and gain a real-time speedup from, parallelisation on current quantum hardware. We obtain a speedup by 18× for exploring the VQE energy landscape, and by more than 8× for running VQE optimisation.
Quantum computing has emerged as a promising technology for solving problems that are intractable for classical computers. In this study, we introduce quantum computing and implement the Variational Quantum Eigensolver (VQE) algorithm using Qiskit on the IBM Quantum platform to calculate the ground state energy of a hydrogen molecule. We provide a theoretical framework of quantum mechanics, qubits, quantum gates, and the VQE algorithm. Our implementation process is described, and we simulate the results. Additionally, experiments are conducted on the IBM Quantum platform, and the results are analyzed. Our fi ndings demonstrate that VQE can effi ciently calculate molecular properties with high accuracy. However, limitations and challenges in scaling the algorithm for larger molecules are also identifi ed. This work contributes to the growing body of research on quantum computing and highlights the potential applications of VQE for real-world problem-solving.