Variational Quantum Algorithms

Overview

Variational quantum algorithms combine parameterized quantum circuits with classical optimizers to tackle tasks such as molecular ground-state estimation, combinatorial optimization, and quantum machine learning. Common approaches include VQE and QAOA, with work on circuit ansätze, gradient and measurement strategies, and automated architecture search to reduce circuit and hardware costs. Researchers test these methods on problems such as molecular Hamiltonians, spin systems, Max-Cut, and classification, using both simulations and quantum devices. A central challenge is balancing expressive circuits with trainability and noise robustness, while establishing practical benefits through fair comparisons with classical methods.

Latest papers

32 papers4 papers in the last four weeks, level with the four weeks before. 0.0% of all new papers.

Mar 20, 2025

Reducing QPU Calls in Variational Quantum Algorithms via Classical Offloading of Gradient Computation

Variational quantum algorithms (VQAs) are a promising approach for leveraging near-term quantum computers, but trainability and quantum-resource costs remain major challenges. Here we address these challenges with the Hardware Efficient and dynamical LIe algebra supported Ansatz (HELIA) and two training methods combining the classical-enhanced \g method with the quantum-based Parameter-Shift Rule (PSR). This distributes gradient estimation and training across classical and quantum hardware. We evaluate ground-state estimation of 6- to 18-qubit Hamiltonians using the Variational Quantum Eigensolver (VQE) and quantum phase classification for Hamiltonians up to 12 qubits. For VQE, our methods improve accuracy and success rates, with a mean reduction in estimated logical quantum evaluations of up to 60%60\% relative to Full-PSR training of the same ansatz. For classification, the largest improvement in mean peak test accuracy relative to Full-PSR is 2.82.8 percentage points. We also use these methods as a warm-start pretraining strategy for Hamiltonians with exponential-dimensional dynamical Lie algebras. Gradient diagnostics for the studied Hamiltonian configurations show slower gradient-variance decay than the selected deep hardware-efficient reference over the simulated system sizes, potentially paving the way for training large-qubit quantum models.
Mar 17, 2025

Quantum State Preparation with the QNN-based SRBB Algorithm

In this work, a novel algorithm structured on Lie algebras for the approximate quantum state preparation problem is proposed, addressing a challenge of fundamental importance in many areas of quantum computing. The algorithm uses a variational quantum circuit designed on the Standard Recursive Block Basis (SRBB), a hierarchical construction for the matrix algebra of the SU(2n)SU(2^n) group, which is capable of linking the variational parameters with the topology of the Lie group. Compared to the full algebra, using only diagonal components reduces the number of CNOTs by an exponential factor, as well as the circuit depth, in full agreement with the relaxation principle inherent to the approximation methodology of minimizing resources while achieving high accuracy. The desired quantum state is then approximated by a novel quantum neural network, which is designed based on the diagonal SRBB sub-algebra. This approach provides a new scheme for approximate quantum state preparation in a variational framework and a specific use case for the SRBB hierarchy. The performance of the algorithm is assessed with different loss functions, such as fidelity, trace distance, and Frobenius norm, in relation to two optimizers: Adam and Nelder-Mead. The results highlight the potential of SRBB in close connection with the geometry of unitary groups, achieving high accuracy of up to 4 qubits in simulation, but also its current limitations with an increasing number of qubits. Additionally, the approximate SRBB-based QSP algorithm has been tested on real quantum devices to assess its performance with a small number of qubits.