ﻻ يوجد ملخص باللغة العربية
Variational quantum eigensolver (VQE) optimizes parameterized eigenstates of a Hamiltonian on a quantum processor by updating parameters with a classical computer. Such a hybrid quantum-classical optimization serves as a practical way to leverage up classical algorithms to exploit the power of near-term quantum computing. Here, we develop a hybrid algorithm for VQE, emphasizing the classical side, that can solve a group of related Hamiltonians simultaneously. The algorithm incorporates a snake algorithm into many VQE tasks to collectively optimize variational parameters of different Hamiltonians. Such so-called collective VQEs~(cVQEs) is applied for solving molecules with varied bond length, which is a standard problem in quantum chemistry. Numeral simulations show that cVQE is not only more efficient in convergence, but also trends to avoid single VQE task to be trapped in local minimums. The collective optimization utilizes intrinsic relations between related tasks and may inspire advanced hybrid quantum-classical algorithms for solving practical problems.
By design, the variational quantum eigensolver (VQE) strives to recover the lowest-energy eigenvalue of a given Hamiltonian by preparing quantum states guided by the variational principle. In practice, the prepared quantum state is indirectly assesse
Variational quantum eigensolver(VQE) typically minimizes energy with hybrid quantum-classical optimization, which aims to find the ground state. Here, we propose a VQE by minimizing energy variance, which is called as variance-VQE(VVQE). The VVQE can
Quantum spin systems may offer the first opportunities for beyond-classical quantum computations of scientific interest. While general quantum simulation algorithms likely require error-corrected qubits, there may be applications of scientific intere
Quantum-enhanced computing methods are promising candidates to solve currently intractable problems. We consider here a variational quantum eigensolver (VQE), that delegates costly state preparations and measurements to quantum hardware, while classi
Quantum simulation of strongly correlated systems is potentially the most feasible useful application of near-term quantum computers. Minimizing quantum computational resources is crucial to achieving this goal. A promising class of algorithms for th