Related papers: Parent Hamiltonian as a benchmark problem for vari…
Variational quantum algorithms involve training parameterized quantum circuits using a classical co-processor. An important variational algorithm, designed for combinatorial optimization, is the quantum approximate optimization algorithm.…
Quantum simulations are bound to be one of the main applications of near-term quantum computers. Quantum chemistry and condensed matter physics are expected to benefit from these technological developments. Several quantum simulation…
Variational quantum eigensolvers are touted as a near-term algorithm capable of impacting many applications. However, the potential has not yet been realized, with few claims of quantum advantage and high resource estimates, especially due…
Solving the electronic structure problem using the Variational Quantum Eigensolver (VQE) technique involves measurement of the Hamiltonian expectation value. Current hardware can perform only projective single-qubit measurements, and thus,…
The energy extraction from quantum sources is a key task to develop new quantum devices such as quantum batteries (QB). In this context, one of the main figures of merit is the ergotropy, which measures the maximal amount of energy (as…
The realization of quantum advantage with noisy-intermediate-scale quantum (NISQ) machines has become one of the major challenges in computational sciences. Maintaining coherence of a physical system with more than ten qubits is a critical…
By exploiting the invariance of the molecular Hamiltonian by a unitary transformation of the orbitals it is possible to significantly shorter the depth of the variational circuit in the Variational Quantum Eigensolver (VQE) algorithm by…
We propose a divide-and-conquer method for the quantum-classical hybrid algorithm to solve larger problems with small-scale quantum computers. Specifically, we concatenate a variational quantum eigensolver (VQE) with a reduction in the…
The variational quantum eigen solver (VQE), has been widely used to find the ground state energy of different Hamiltonians with no analytical solutions and are classically difficult to compute. In our work, we have used VQE to identify the…
Most literature in the Variational Quantum Eigensolver (VQE) algorithm focuses on finding the ground state of a physical system, by minimizing a quantum-computed cost-function. When excited states are required, the cost-function is usually…
We present a variational quantum eigensolver (VQE) approach for solving the Anderson Impurity Model (AIM) arising in Dynamical Mean-Field Theory (DMFT). Recognizing that the minimal two-site approximation often fails to resolve essential…
Variational quantum eigensolver (VQE) is promising to show quantum advantage on near-term noisy-intermediate-scale quantum (NISQ) computers. One central problem of VQE is the effect of noise, especially the physical noise on realistic…
Hybrid quantum-classical algorithms have been proposed to circumvent noise limitations in quantum computers. Such algorithms delegate only a calculation of the expectation value to the quantum computer. Among them, the Variational Quantum…
In the emergent realm of quantum computing, the Variational Quantum Eigensolver (VQE) stands out as a promising algorithm for solving complex quantum problems, especially in the noisy intermediate-scale quantum (NISQ) era. However, the…
Highly excited states of quantum many-body systems are central objects in the study of quantum dynamics and thermalization that challenge classical computational methods due to their volume-law entanglement content. In this work, we explore…
Variational quantum Eigensolver (VQE) is a leading candidate for harnessing quantum computers to advance quantum chemistry and materials simulations, yet its training efficiency deteriorates rapidly for large Hamiltonians. Two issues…
In this study, we propose a new method for constrained combinatorial optimization using variational quantum circuits. Quantum computers are considered to have the potential to solve large combinatorial optimization problems faster than…
Development of resource-friendly quantum algorithms remains highly desirable for noisy intermediate-scale quantum computing. Based on the variational quantum eigensolver (VQE) with unitary coupled cluster ansatz, we demonstrate that…
Variational quantum algorithms aim at harnessing the power of noisy intermediate-scale quantum computers, by using a classical optimizer to train a parameterized quantum circuit to solve tractable quantum problems. The variational quantum…
The rapid progress in quantum computing has opened up new possibilities for tackling complex scientific problems. Variational quantum eigensolver (VQE) holds the potential to solve quantum chemistry problems and achieve quantum advantages.…