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:2405.15166 · Physical Review Applied

Parametrization and optimizability of pulse-level variational quantum eigensolvers

Kyle Sherbert, Hisham Amer, Sophia E. Economou, Edwin Barnes, Nicholas J. Mayhall

Published Feb 14, 2025• 11 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physrevapplied.23.024036

Related papers

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

PANSATZ: pulse-based ansatz for variational quantum algorithms

Dekel Meirom, Steven H. Frankel

Quantum computers promise a great computational advantage over classical computers, which might help solve various computational challenges such as the simulation of complicated quantum systems, finding optimum in large optimization problems, and solving large-scale linear algebra problems. Current available quantum devices have only a limited amount of qubits and a high level of noise, limiting the size of problems that can be solved accurately with those devices. Variational quantum algorithms (VQAs) have emerged as a leading strategy to address these limitations by optimizing cost function based on measurement results of shallow depth circuits. Recently, various pulse engineering methods were suggested in order to improve VQA results, including optimizing pulse parameters instead of gate angles as part of the VQA optimization process. In this paper, we suggest a novel pulse-based ansatz, which is parameterized mainly by pulses’ duration of pre-defined pulse structures. This ansatz structure provides relatively low amounts of optimization parameters while maintaining high expressibility, allowing fast convergence. In addition, the ansatz has structured adaptivity to the entanglement level required by the problem, allowing low noise and accurate results. We tested this ansatz against quantum chemistry problems. Specifically, finding the ground-state energy associated with the electron configuration problem, using the variational quantum eigensolver (VQE) algorithm for several different molecules. We manage to achieve chemical accuracy both in simulation for several molecules and on one of IBM’s NISQ devices for the H2 molecule in the STO-3G basis, without the need for extensive error mitigation. Our results are compared to a common gate-based ansatz and show better accuracy and significant latency reduction—up to 7× shorter ansatz schedules.

arXiv:2212.12911•Frontiers in Quantum Science and Technology•Oct 9, 2023•30 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

Pulse variational quantum eigensolver on cross-resonance-based hardware

Daniel J. Egger, Chiara Capecci, Bibek Pokharel +4 more

State-of-the-art noisy digital quantum computers can only execute short-depth quantum circuits. Variational algorithms are a promising route to unlock the potential of noisy quantum computers since the depth of the corresponding circuits can be kept well below hardware-imposed limits. Typically, the variational parameters correspond to virtual ${R}_{Z}$ gate angles, implemented by phase changes of calibrated pulses. By encoding the variational parameters directly as hardware pulse amplitudes and durations, we succeed in further shortening the pulse schedule and overall circuit duration. This decreases the impact of qubit decoherence and gate noise. As a demonstration, we apply our pulse-based variational algorithm to the calculation of the ground state of different hydrogen-based systems (${\mathrm{H}}_{2}, {\mathrm{H}}_{3}$, and ${\mathrm{H}}_{4}$) using IBM cross-resonance-based hardware. We observe a reduction in schedule duration of up to $5\ifmmode\times\else\texttimes\fi{}$ compared to cnot-based Ans\"atze, while also reducing the measured energy. In particular, we observe a sizable improvement of the minimal energy configuration of ${\mathrm{H}}_{3}$ compared to a cnot-based variational form. Finally, we discuss possible future developments including error-mitigation schemes and schedule optimizations, which will enable further improvements of our approach, paving the way towards the simulation of larger systems on noisy quantum devices.

arXiv:2303.02410•Physical Review Research•Sep 5, 2023•40 citations

Pulse based Variational Quantum Optimal Control for hybrid quantum computing

Robert de Keijzer, Oliver T.C. Tse, S. J. J. M. F. Kokkelmans

This work studies pulse based variational quantum algorithms (VQAs), which are designed to determine the ground state of a quantum mechanical system by combining classical and quantum hardware. In contrast to more standard gate based methods, pulse based methods aim to directly optimize the laser pulses interacting with the qubits, instead of using some parametrized gate based circuit. Using the mathematical formalism of optimal control, these laser pulses are optimized. This method has been used in quantum computing to optimize pulses for quantum gate implementations, but has only recently been proposed for full optimization in VQAs. Pulse based methods have several advantages over gate based methods such as faster state preparation, simpler implementation and more freedom in moving through the state space. Based on these ideas, we present the development of a novel adjoint based variational method. This method can be tailored towards and applied in neutral atom quantum computers. This method of pulse based variational quantum optimal control is able to approximate molecular ground states of simple molecules up to chemical accuracy and is able to compete with the gate based variational quantum eigensolver in terms of total number of quantum evaluations. The total evolution time T and the form of the control Hamiltonian Hc are important factors in the convergence behavior to the ground state energy, both having influence on the quantum speed limit and the controllability of the system.

arXiv:2202.08908•Quantum•Jan 26, 2023•38 citations

NAPA: Intermediate-Level Variational Native-Pulse Ansatz for Variational Quantum Algorithms

Zhiding Liang, Jinglei Cheng, Hang Ren +8 more

Variational quantum algorithms (VQAs) have demonstrated great potentials in the Noisy Intermediate Scale Quantum (NISQ) era. In the workflow of VQA, the parameters of ansatz are iteratively updated to approximate the desired quantum states. We have seen various efforts to draft better ansatz with less gates. Some works consider the physical meaning of the underlying circuits, while others adopt the ideas of neural architecture search (NAS) for ansatz generator. However, these designs do not exploit the full advantages of VQAs. Because most techniques target gate ansatz, and the parameters are usually rotation angles of the gates. In quantum computers, the gate ansatz will eventually be transformed into control signals such as microwave pulses on superconducting qubits. These control pulses need elaborate calibrations to minimize the errors such as over-rotation and under-rotation. In the case of VQAs, this procedure will introduce redundancy, but the variational properties of VQAs can naturally handle problems of over-rotation and under-rotation by updating the amplitude and frequency parameters. Therefore, we propose NAPA, a native-pulse ansatz generator framework for VQAs. We generate native-pulse ansatz with trainable parameters for amplitudes and frequencies. In our proposed NAPA, we are tuning parametric pulses, which are natively supported on NISQ computers. Given the limited availability of gradient-based optimizers for pulse-level quantum programs, we choose to deploy non-gradient optimizers in our framework. To constrain the number of parameters sent to the optimizer, we adopt a progressive way to generate our nativepulse ansatz. Experiments are conducted on both simulators and quantum devices for Variational Quantum Eigensolver (VQE) tasks to envaluate our methods. When adopted on NISQ machines, NAPA obtained improved the performance with decreased latency by an average of 86%. NAPA is able to achieve 96.482% and 99.336% accuracy for VQE tasks on H2 and HeH+ respectively. An average accuracy of 97.27% is achieved for medium-size quantum chemistry tasks on CO2, H2O, and NaH. NAPA also demonstrates advantages on quantum optimization tasks even with considerable noises in NISQ machines.

arXiv:2208.01215•IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems•Jan 17, 2024•58 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.
Quantum computers promise a great computational advantage over classical computers, which might help solve various computational challenges such as the simulation of complicated quantum systems, finding optimum in large optimization problems, and solving large-scale linear algebra problems. Current available quantum devices have only a limited amount of qubits and a high level of noise, limiting the size of problems that can be solved accurately with those devices. Variational quantum algorithms (VQAs) have emerged as a leading strategy to address these limitations by optimizing cost function based on measurement results of shallow depth circuits. Recently, various pulse engineering methods were suggested in order to improve VQA results, including optimizing pulse parameters instead of gate angles as part of the VQA optimization process. In this paper, we suggest a novel pulse-based ansatz, which is parameterized mainly by pulses’ duration of pre-defined pulse structures. This ansatz structure provides relatively low amounts of optimization parameters while maintaining high expressibility, allowing fast convergence. In addition, the ansatz has structured adaptivity to the entanglement level required by the problem, allowing low noise and accurate results. We tested this ansatz against quantum chemistry problems. Specifically, finding the ground-state energy associated with the electron configuration problem, using the variational quantum eigensolver (VQE) algorithm for several different molecules. We manage to achieve chemical accuracy both in simulation for several molecules and on one of IBM’s NISQ devices for the H2 molecule in the STO-3G basis, without the need for extensive error mitigation. Our results are compared to a common gate-based ansatz and show better accuracy and significant latency reduction—up to 7× shorter ansatz schedules.
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.
State-of-the-art noisy digital quantum computers can only execute short-depth quantum circuits. Variational algorithms are a promising route to unlock the potential of noisy quantum computers since the depth of the corresponding circuits can be kept well below hardware-imposed limits. Typically, the variational parameters correspond to virtual RZ{R}_{Z}RZ​ gate angles, implemented by phase changes of calibrated pulses. By encoding the variational parameters directly as hardware pulse amplitudes and durations, we succeed in further shortening the pulse schedule and overall circuit duration. This decreases the impact of qubit decoherence and gate noise. As a demonstration, we apply our pulse-based variational algorithm to the calculation of the ground state of different hydrogen-based systems (H2,H3{\mathrm{H}}_{2}, {\mathrm{H}}_{3}H2​,H3​, and H4{\mathrm{H}}_{4}H4​) using IBM cross-resonance-based hardware. We observe a reduction in schedule duration of up to $5\ifmmode\times\else\texttimes\fi{}$ compared to cnot-based Ans\"atze, while also reducing the measured energy. In particular, we observe a sizable improvement of the minimal energy configuration of H3{\mathrm{H}}_{3}H3​ compared to a cnot-based variational form. Finally, we discuss possible future developments including error-mitigation schemes and schedule optimizations, which will enable further improvements of our approach, paving the way towards the simulation of larger systems on noisy quantum devices.
This work studies pulse based variational quantum algorithms (VQAs), which are designed to determine the ground state of a quantum mechanical system by combining classical and quantum hardware. In contrast to more standard gate based methods, pulse based methods aim to directly optimize the laser pulses interacting with the qubits, instead of using some parametrized gate based circuit. Using the mathematical formalism of optimal control, these laser pulses are optimized. This method has been used in quantum computing to optimize pulses for quantum gate implementations, but has only recently been proposed for full optimization in VQAs. Pulse based methods have several advantages over gate based methods such as faster state preparation, simpler implementation and more freedom in moving through the state space. Based on these ideas, we present the development of a novel adjoint based variational method. This method can be tailored towards and applied in neutral atom quantum computers. This method of pulse based variational quantum optimal control is able to approximate molecular ground states of simple molecules up to chemical accuracy and is able to compete with the gate based variational quantum eigensolver in terms of total number of quantum evaluations. The total evolution time T and the form of the control Hamiltonian Hc are important factors in the convergence behavior to the ground state energy, both having influence on the quantum speed limit and the controllability of the system.
Variational quantum algorithms (VQAs) have demonstrated great potentials in the Noisy Intermediate Scale Quantum (NISQ) era. In the workflow of VQA, the parameters of ansatz are iteratively updated to approximate the desired quantum states. We have seen various efforts to draft better ansatz with less gates. Some works consider the physical meaning of the underlying circuits, while others adopt the ideas of neural architecture search (NAS) for ansatz generator. However, these designs do not exploit the full advantages of VQAs. Because most techniques target gate ansatz, and the parameters are usually rotation angles of the gates. In quantum computers, the gate ansatz will eventually be transformed into control signals such as microwave pulses on superconducting qubits. These control pulses need elaborate calibrations to minimize the errors such as over-rotation and under-rotation. In the case of VQAs, this procedure will introduce redundancy, but the variational properties of VQAs can naturally handle problems of over-rotation and under-rotation by updating the amplitude and frequency parameters. Therefore, we propose NAPA, a native-pulse ansatz generator framework for VQAs. We generate native-pulse ansatz with trainable parameters for amplitudes and frequencies. In our proposed NAPA, we are tuning parametric pulses, which are natively supported on NISQ computers. Given the limited availability of gradient-based optimizers for pulse-level quantum programs, we choose to deploy non-gradient optimizers in our framework. To constrain the number of parameters sent to the optimizer, we adopt a progressive way to generate our nativepulse ansatz. Experiments are conducted on both simulators and quantum devices for Variational Quantum Eigensolver (VQE) tasks to envaluate our methods. When adopted on NISQ machines, NAPA obtained improved the performance with decreased latency by an average of 86%. NAPA is able to achieve 96.482% and 99.336% accuracy for VQE tasks on H2 and HeH+ respectively. An average accuracy of 97.27% is achieved for medium-size quantum chemistry tasks on CO2, H2O, and NaH. NAPA also demonstrates advantages on quantum optimization tasks even with considerable noises in NISQ machines.