Abstract Variational quantum algorithms (VQAs) have emerged in recent years as a promise to obtain quantum advantage. These task-oriented algorithms work in a hybrid loop combining a quantum processor and classical optimization. Using a specific class of VQA named variational quantum eigensolvers (VQEs), we choose some parameterized quantum circuits to benchmark them at entanglement witnessing and entangled ground state detection for many-body systems described by Heisenberg Hamiltonian, varying the number of qubits and shots. Quantum circuits whose structure is inspired by the Hamiltonian interactions presented better results on cost function estimation than problem-agnostic circuits.
Abstract Variational quantum algorithms (VQAs) have emerged in recent years as a promise to obtain quantum advantage. These task-oriented algorithms work in a hybrid loop combining a quantum processor and classical optimization. Using a specific class of VQA named variational quantum eigensolvers (VQEs), we choose some parameterized quantum circuits to benchmark them at entanglement witnessing and entangled ground state detection for many-body systems described by Heisenberg Hamiltonian, varying the number of qubits and shots. Quantum circuits whose structure is inspired by the Hamiltonian interactions presented better results on cost function estimation than problem-agnostic circuits.
Variational quantum algorithms (VQAs) have emerged in recent years as a promise to obtain quantum advantage. These task-oriented algorithms work in a hybrid loop combining a quantum processor and classical optimization. Using a specific class of VQA named variational quantum eigensolvers (VQEs), we choose some parameterized quantum circuits to benchmark them at entanglement witnessing and entangled ground state detection for many-body systems described by Heisenberg Hamiltonian, varying the number of qubits and shots. Quantum circuits whose structure is inspired by the Hamiltonian interactions presented better results on cost function estimation than problem-agnostic circuits.
Variational quantum algorithms (VQAs) have emerged in recent years as a promise to obtain quantum advantage. These task-oriented algorithms work in a hybrid loop combining a quantum processor and classical optimization. Using a specific class of VQA named variational quantum eigensolvers, we choose some parameterized quantum circuits to benchmark them at entanglement witnessing and entangled ground state detection for many-body systems described by Heisenberg Hamiltonian, varying the number of qubits and shots. Quantum circuits whose structure is inspired by the Hamiltonian interactions presented better results on cost function estimation than problem-agnostic circuits.
Variational quantum algorithms (VQAs) are a modern family of quantum algorithms designed to solve optimization problems using a quantum computer. Typically VQAs rely on a feedback loop between the quantum device and a classical optimization algorithm. The appeal of VQAs lies in their versatility, resistance to noise, and ability to demonstrate some results even with circuits of small depth. We primarily focus on the algorithm called variational quantum eigensolver (VQE), which takes a qubit Hamiltonian and returns its approximate ground state. We first present our numerical findings regarding VQE applied to two spin models and a variant of the Hubbard model. Next, we briefly touch the topic of quantum machine learning by developing a quantum classifier to partition quantum data. We further study the phenomenon of vanishing derivatives in VQAs, also known as barren plateaus phenomenon. We derive a new lower bound on variance of the derivatives, which depends on the causal structure of the ansatz circuit and the individual terms entering the Pauli decomposition of the problem Hamiltonian. In the final chapter of the thesis, we present our results on bounding the fidelity of experimentally prepared Clifford states using their parent Hamiltonians.
In recent years, Variational Quantum Algorithms (VQAs) have emerged as a promising approach for solving optimization problems on quantum computers in the NISQ era. However, one limitation of VQAs is their reliance on fixed-structure circuits, which may not be taylored for specific problems or hardware configurations. A leading strategy to address this issue are Adaptative VQAs, which dynamically modify the circuit structure by adding and removing gates, and optimize their parameters during the training. Several Adaptative VQAs, based on heuristics such as circuit shallowness, entanglement capability and hardware compatibility, have already been proposed in the literature, but there is still lack of a systematic comparison between the different methods. In this paper, we aim to fill this gap by analyzing three Adaptative VQAs: Evolutionary Variational Quantum Eigensolver (EVQE), Variable Ansatz (VAns), already proposed in the literature, and Random Adapt-VQE (RA-VQE), a random approach we introduce as a baseline. In order to compare these algorithms to traditional VQAs, we also include the Quantum Approximate Optimization Algorithm (QAOA) in our analysis. We apply these algorithms to QUBO problems and study their performance by examining the quality of the solutions found and the computational times required. Additionally, we investigate how the choice of the hyperparameters can impact the overall performance of the algorithms, highlighting the importance of selecting an appropriate methodology for hyperparameter tuning. Our analysis sets benchmarks for Adaptative VQAs designed for near-term quantum devices and provides valuable insights to guide future research in this area.
Variational Quantum Algorithms (VQAs) are a class of hybrid quantum-classical algorithms that leverage on classical optimization tools to find the optimal parameters for a parameterized quantum circuit. One relevant application of VQAs is the Variational Quantum Eigensolver (VQE), which aims at steering the output of the quantum circuit to the ground state of a certain Hamiltonian. Recent works have provided global convergence guarantees for VQEs under suitable local surjectivity and smoothness hypotheses, but little has been done in characterizing convergence of these algorithms when the underlying quantum circuit is affected by noise. In this work, we derive an upper bound on the error on the optimal parameters of a VQE under the effect of different coherent and incoherent noise processes. We then procced to show robust convergence guarantees of the algorithm to the perturbed optimal parameters. Our work provides novel theoretical insight into the behavior of VQAs subject to noise. Furthermore, we accompany our results with numerical simulations implemented via Pennylane.
The variational quantum eigensolver (VQE) is a hybrid quantum-classical algorithm designed for noisy intermediate-scale quantum (NISQ) hardware to estimate eigenvalues of many-body Hamiltonians. Unlike fully quantum approaches such as quantum phase estimation (QPE), VQE trades deep coherent circuits for repeated state preparation, measurement, and classical optimization, making it more compatible with limited qubit counts and finite coherence times. Recent developments have focused on reducing quantum resource requirements while retaining chemically meaningful wavefunction structure. In this paper, we examine recent progress in VQE methods for molecular electronic structure with an emphasis on three themes: (i) strategies for circuit and ansatz complexity reduction, including adaptive and selectively screened approaches, (ii) chemically motivated workflows that combine VQE with orbital optimization, fragmentation, and localized active-space ideas to better address strong correlation, and (iii) extensions of VQE to excited-state calculations. Throughout, we emphasize the tradeoffs among parameter count, gate depth, symmetry preservation, measurement overhead, and classical preprocessing, and discuss where these approaches may become most useful for chemically challenging active spaces. We also highlight benchmarking considerations for assessing both accuracy and resource requirements, and conclude with a perspective on regimes in which VQE may offer the greatest long-term value, particularly multireference active spaces and low-lying excited-state manifolds.