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

Bulletin of the American Physical Society

ctrl-VQE: Fast variational quantum eigensolver with gate-free state preparation

Oinam Romesh Meitei, Bryan Gard, George S. Barron, David P. Pappas, Sophia E. Economou, Edwin Barnes, Nicholas J. Mayhall

Published Mar 18, 2021• 0 citations
OpenAlex

Related papers

Variational Quantum Eigensolver and Its Applications

Atsushi Matsuo

Lecture notes in computer science•Jan 1, 2021•1 citation

Parametrization and optimizability of pulse-level variational quantum eigensolvers

Kyle Sherbert, Hisham Amer, Sophia E. Economou +2 more

In conventional variational quantum eigensolvers (VQEs), trial states are prepared by applying series of parametrized gates to a reference state, with the gate parameters being varied to minimize the energy of the target system. Recognizing that the gates are intermediates, which are ultimately compiled into a set of control pulses to be applied to each qubit in the lab, the recently proposed ctrl-VQE algorithm takes the amplitudes, frequencies, and phases of the pulse as the variational parameters used to minimize the molecular energy. In this work, we explore how all 3 degrees of freedom interrelate with one another. To this end, we consider several distinct strategies to parametrize the control pulses, assessing each one through numerical simulations of a transmonlike device. For each parametrization, we contrast the pulse duration required to prepare a good ansatz, and the difficulty to optimize that ansatz from a well-defined initial state. We deduce several guiding heuristics to implement practical ctrl-VQE in hardware, which we anticipate will generalize for generic device architectures.

arXiv:2405.15166•Physical Review Applied•Feb 14, 2025•11 citations

Efficient Symmetry-Preserving State Preparation Circuits for the Variational Quantum Eigensolver Algorithm

Linghua Zhu, Bryan Gard, George S. Barron +3 more

Bulletin of the American Physical Society•Mar 3, 2020•0 citations

Gate-free state preparation for fast variational quantum eigensolver simulations

Oinam Romesh Meitei, Bryan Gard, George S. Barron +4 more

Abstract The variational quantum eigensolver is currently the flagship algorithm for solving electronic structure problems on near-term quantum computers. The algorithm involves implementing a sequence of parameterized gates on quantum hardware to generate a target quantum state, and then measuring the molecular energy. Due to finite coherence times and gate errors, the number of gates that can be implemented remains limited. In this work, we propose an alternative algorithm where device-level pulse shapes are variationally optimized for the state preparation rather than using an abstract-level quantum circuit. In doing so, the coherence time required for the state preparation is drastically reduced. We numerically demonstrate this by directly optimizing pulse shapes which accurately model the dissociation of H2 and HeH+, and we compute the ground state energy for LiH with four transmons where we see reductions in state preparation times of roughly three orders of magnitude compared to gate-based strategies.

arXiv:2008.04302•npj Quantum Information•Oct 27, 2021•92 citations

Adaptive AI for Pulse-Level Quantum Control

Sanjeev Shapkota, Yayu Mo, Sanjaya Lohani

The Control Variational Quantum Eigensolver (ctrl-VQE) directly optimizes microwave pulses to enable faster and lower-error quantum-state preparation, but its continuous control landscape re- quires efficient search strategies. We demonstrate that a reinforcement-learning agent based on a deep Q learning network can autonomously discover high-performance pulse sequences using only system parameters and a reward function. The approach is fully general for superconducting qubit platforms, requires no ansatz, and operates at nanosecond resolution compatible with hardware con- straints. As a proof of concept, we apply the method to ground-state preparation of the Hydrogen molecule on a simulated superconducting device. The agent consistently identifies optimized control sequences that achieve high fidelity and outperform random-search baselines. These results highlight adaptive learning as a promising hardware-ready framework for pulse-level quantum control.

quant-pharXiv:2609.08727•Sep 9, 2026•0 citations

MoG-VQE: Multiobjective genetic variational quantum eigensolver

Чивилихин Даниил Сергеевич, Samarin, A., Ульянцев Владимир Игоревич +3 more

Variational quantum eigensolver (VQE) emerged as a first practical algorithm for near-term quantum computers. Its success largely relies on the chosen variational ansatz, corresponding to a quantum circuit that prepares an approximate ground state of a Hamiltonian. Typically, it either aims to achieve high representation accuracy (at the expense of circuit depth), or uses a shallow circuit sacrificing the convergence to the exact ground state energy. Here, we propose the approach which can combine both low depth and improved precision, capitalizing on a genetically-improved ansatz for hardware-efficient VQE. Our solution, the multiobjective genetic variational quantum eigensolver (MoG-VQE), relies on multiobjective Pareto optimization, where topology of the variational ansatz is optimized using the non-dominated sorting genetic algorithm (NSGA-II). For each circuit topology, we optimize angles of single-qubit rotations using covariance matrix adaptation evolution strategy (CMA-ES) -- a derivative-free approach known to perform well for noisy black-box optimization. Our protocol allows preparing circuits that simultaneously offer high performance in terms of obtained energy precision and the number of two-qubit gates, thus trying to reach Pareto-optimal solutions. Tested for various molecules (H$_2$, H$_4$, H$_6$, BeH$_2$, LiH), we observe nearly ten-fold reduction in the two-qubit gate counts as compared to the standard hardware-efficient ansatz. For 12-qubit LiH Hamiltonian this allows reaching chemical precision already at 12 CNOTs. Consequently, the algorithm shall lead to significant growth of the ground state fidelity for near-term devices.

arXiv:2007.04424•Jul 8, 2020•123 citations
In conventional variational quantum eigensolvers (VQEs), trial states are prepared by applying series of parametrized gates to a reference state, with the gate parameters being varied to minimize the energy of the target system. Recognizing that the gates are intermediates, which are ultimately compiled into a set of control pulses to be applied to each qubit in the lab, the recently proposed ctrl-VQE algorithm takes the amplitudes, frequencies, and phases of the pulse as the variational parameters used to minimize the molecular energy. In this work, we explore how all 3 degrees of freedom interrelate with one another. To this end, we consider several distinct strategies to parametrize the control pulses, assessing each one through numerical simulations of a transmonlike device. For each parametrization, we contrast the pulse duration required to prepare a good ansatz, and the difficulty to optimize that ansatz from a well-defined initial state. We deduce several guiding heuristics to implement practical ctrl-VQE in hardware, which we anticipate will generalize for generic device architectures.
Abstract The variational quantum eigensolver is currently the flagship algorithm for solving electronic structure problems on near-term quantum computers. The algorithm involves implementing a sequence of parameterized gates on quantum hardware to generate a target quantum state, and then measuring the molecular energy. Due to finite coherence times and gate errors, the number of gates that can be implemented remains limited. In this work, we propose an alternative algorithm where device-level pulse shapes are variationally optimized for the state preparation rather than using an abstract-level quantum circuit. In doing so, the coherence time required for the state preparation is drastically reduced. We numerically demonstrate this by directly optimizing pulse shapes which accurately model the dissociation of H2 and HeH+, and we compute the ground state energy for LiH with four transmons where we see reductions in state preparation times of roughly three orders of magnitude compared to gate-based strategies.
The Control Variational Quantum Eigensolver (ctrl-VQE) directly optimizes microwave pulses to enable faster and lower-error quantum-state preparation, but its continuous control landscape re- quires efficient search strategies. We demonstrate that a reinforcement-learning agent based on a deep Q learning network can autonomously discover high-performance pulse sequences using only system parameters and a reward function. The approach is fully general for superconducting qubit platforms, requires no ansatz, and operates at nanosecond resolution compatible with hardware con- straints. As a proof of concept, we apply the method to ground-state preparation of the Hydrogen molecule on a simulated superconducting device. The agent consistently identifies optimized control sequences that achieve high fidelity and outperform random-search baselines. These results highlight adaptive learning as a promising hardware-ready framework for pulse-level quantum control.
Variational quantum eigensolver (VQE) emerged as a first practical algorithm for near-term quantum computers. Its success largely relies on the chosen variational ansatz, corresponding to a quantum circuit that prepares an approximate ground state of a Hamiltonian. Typically, it either aims to achieve high representation accuracy (at the expense of circuit depth), or uses a shallow circuit sacrificing the convergence to the exact ground state energy. Here, we propose the approach which can combine both low depth and improved precision, capitalizing on a genetically-improved ansatz for hardware-efficient VQE. Our solution, the multiobjective genetic variational quantum eigensolver (MoG-VQE), relies on multiobjective Pareto optimization, where topology of the variational ansatz is optimized using the non-dominated sorting genetic algorithm (NSGA-II). For each circuit topology, we optimize angles of single-qubit rotations using covariance matrix adaptation evolution strategy (CMA-ES) -- a derivative-free approach known to perform well for noisy black-box optimization. Our protocol allows preparing circuits that simultaneously offer high performance in terms of obtained energy precision and the number of two-qubit gates, thus trying to reach Pareto-optimal solutions. Tested for various molecules (H2_22​, H4_44​, H6_66​, BeH2_22​, LiH), we observe nearly ten-fold reduction in the two-qubit gate counts as compared to the standard hardware-efficient ansatz. For 12-qubit LiH Hamiltonian this allows reaching chemical precision already at 12 CNOTs. Consequently, the algorithm shall lead to significant growth of the ground state fidelity for near-term devices.