Related papers: Penalty methods for variational quantum eigensolve…
Ab initio electronic excited state calculations are necessary for the quantitative study of photochemical reactions, but their accurate computation on classical computers is plagued by prohibitive scaling. The Variational Quantum Deflation…
The hardware requirements of useful quantum algorithms remain unmet by the quantum computers available today. Because it was designed to soften these requirements, the Variational Quantum Eigensolver (VQE) has gained popularity as a…
Hybrid algorithms that combine quantum and classical resources have become commonplace in quantum computing. The variational quantum eigensolver (VQE) is routinely used to solve prototype problems. Currently, hybrid algorithms use no more…
Variational Quantum Eigensolver (VQE) is widely used in near-term hardware. However, their performances remain limited by the poor trainability and are dependent on random parameter initialization. In this work, we propose a warm start…
We consider the feasibility of studying the anisotropic Heisenberg quantum spin chain with the Variational Quantum Eigensolver (VQE) algorithm, by treating Bethe states as variational states, and Bethe roots as variational parameters. For…
Variational quantum eigensolver (VQE), which attracts attention as a promising application of noisy intermediate-scale quantum devices, finds a ground state of a given Hamiltonian by variationally optimizing the parameters of quantum…
In this work, we propose a novel variational quantum approach for solving a class of nonlinear optimal control problems. Our approach integrates Dirac's canonical quantization of dynamical systems with the solution of the ground state of…
We present a hybrid classical-quantum algorithm to solve optimization problems in current quantum computers, whose basic idea is to assist variational quantum eigensolvers (VQE) with adiabatic change of the Hamiltonian. The rational for…
Quantum Computing is believed to be the ultimate solution for quantum chemistry problems. Before the advent of large-scale, fully fault-tolerant quantum computers, the variational quantum eigensolver~(VQE) is a promising heuristic quantum…
The ground state search problem is central to quantum computing, with applications spanning quantum chemistry, condensed matter physics, and optimization. The Variational Quantum Eigensolver (VQE) has shown promise for small systems but…
The Variational Quantum Eigensolver (VQE) is a quantum algorithm used to find the ground state energy of a given Hamiltonian. The key component of VQE is the ansatz, which is a trial wavefunction that the algorithm uses to approximate the…
When does a variational quantum algorithm converge to a globally optimal solution? Despite the large literature around variational approaches to quantum computing, the answer is largely unknown. We address this open question by developing a…
We investigate the potential of near-term quantum algorithms for solving partial differential equations (PDEs), focusing on a linear one-dimensional advection-diffusion equation as a test case. This study benchmarks a ground-state…
The variational quantum eigensolver is one of the most promising algorithms for near-term quantum computers. It has the potential to solve quantum chemistry problems involving strongly correlated electrons, which are otherwise difficult to…
Current gate-based quantum computers have the potential to provide a computational advantage if algorithms use quantum hardware efficiently. To make combinatorial optimization more efficient, we introduce the Filtering Variational Quantum…
Variational Quantum Algorithms (VQAs), such as the Variational Quantum Eigensolver (VQE) and the Quantum Approximate Optimization Algorithm (QAOA), are widely studied as candidates for near-term quantum advantage. Recent work has shown that…
Variational approaches, such as variational Monte Carlo (VMC) or the variational quantum eigensolver (VQE), are powerful techniques to tackle the ground-state many-electron problem. Often, the family of variational states is not invariant…
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…
Quantum computers can be used to calculate the electronic structure and estimate the ground state energy of many-electron molecular systems. In the present study, we implement the Variational Quantum Eigensolver (VQE) algorithm, as a hybrid…
Quantum simulation, one of the most promising applications of a quantum computer, is currently being explored intensely using the variational quantum eigensolver. The feasibility and performance of this algorithm depend critically on the…