Variational Quantum Eigensolver (VQE) is a promising algorithm for near-term quantum machines. It can be used to estimate the ground state energy of a molecule by performing separate measurements of $O(N^4)$ terms. Several recent papers observed that this scaling may be reducible to $O(N^3)$ by partitioning the terms into linear-sized commuting families that can be measured simultaneously. We confirm these empirical observations by studying the MIN-COMMUTING-PARTITION problem at the level of the fermionic Hamiltonian and its encoding into qubits. Moreover, we provide a fast, pre-computable procedure for creating linearly-sized commuting partitions by solving a round-robin scheduling problem via flow networks.
The variational quantum eigensolver is a prominent hybrid quantum-classical algorithm expected to impact near-term quantum devices. They are usually based on a circuit ansatz consisting of parameterized single-qubit gates and fixed two-qubit gates. We study the effect of parameterized two-qubit gates in the variational quantum eigensolver. We simulate a variational quantum eigensolver algorithm using fixed and parameterized two-qubit gates in the circuit ansatz and show that the parameterized versions outperform the fixed versions, both when it comes to best energy and reducing outliers, for a…
The variational quantum eigensolver is a hybrid algorithm composed of quantum state driving and classical parameter optimization, for finding the ground state of a given Hamiltonian. The natural gradient method is an optimization method taking into account the geometric structure of the parameter space. Very recently, Stokes et al. developed the general method for employing the natural gradient for the variational quantum eigensolver. This paper gives some simple case-studies of this optimization method, to see in detail how the natural gradient optimizer makes use of the geometric property to…
Subspace-Search Variational Quantum Eigen solver (SSVQE) is a searching method of multiple states and relies on the unitarity of transformations to ensure the orthogonality of output states for multiple states. Therefore, this method is thought to be a promising method for quantum chemistry because ordinary Variational Quantum Eigen solver (VQE) can only calculate the excited states step by step from the ground state based on Variational Quantum deflation (VQD). We compare the advantage of VQE, SSVQE with/without the constraint term and/or Tabu search term, which is added by the Lagrange multi…
The development of Fault-Tolerant Quantum Computer (FTQC) gradually raises a possibility to implement the Quantum Phase Estimation (QPE) algorithm. However, QPE works only for normalized systems. This requires the minimum and maximum of eigenvalues of a Hamiltonian. Variational Quantum Eigensolver (VQE) well developed in the Noisy Intermediate Scale Quantum (NISQ) era is necessary for preparing the initial eigenvectors that close to the exact states. In this paper, we propose a method to derive all of the states with high accuracy by using the Variational Quantum State Eigensolver (VQSE) and S…
Contextuality is an indicator of non-classicality, and a resource for various quantum procedures. In this paper, we use contextuality to evaluate the variational quantum eigensolver (VQE), one of the most promising tools for near-term quantum simulation. We present an efficiently computable test to determine whether or not the objective function for a VQE procedure is contextual. We apply this test to evaluate the contextuality of experimental implementations of VQE, and determine that several, but not all, fail this test of quantumness.
We develop an extension of the variational quantum eigensolver (VQE) algorithm - multistate, contracted VQE (MC-VQE) - that allows for the efficient computation of the transition energies between the ground state and several low-lying excited states of a molecule, as well as the oscillator strengths associated with these transitions. We numerically simulate MC-VQE by computing the absorption spectrum of an ab initio exciton model of an 18-chromophore light-harvesting complex from purple photosynthetic bacteria.
A non-adiabatic nuclear wavepacket dynamics simulation of the H$_2$O$^+$ de-excitation process is performed based on electronic structure calculations using the variational quantum eigensolver. The adiabatic potential energy surfaces and non-adiabatic coupling vectors are computed with algorithms for noisy intermediate-scale quantum devices, and time propagation is simulated with conventional methods for classical computers. The results of non-adiabatic transition dynamics from the $\tilde{B}$ state to $\tilde{A}$ state reproduce the trend reported in previous studies, which suggests that this…
For the variational quantum eigensolver we propose to generate trial wavefunctions from a small amount of selected Pauli terms of the problem Hamiltonian. Two different approaches, one inspired by the quantum approximate optimization algorithm and the other by imaginary-time evolution, are proposed and studied in detail. Using numerical calculations, we study the efficiency of these trial wavefunctions for finding the ground-state energy of three molecules: H2, LiH and H2O. We find that only a small number of Pauli terms are needed to reach chemical accuracy, leading to short-depth quantum cir…
The Fermi-Hubbard model is a plausible target to be solved by a quantum computer using the variational quantum eigensolver algorithm. However, problem sizes beyond the reach of classical exact diagonalisation are also beyond the reach of current quantum computing hardware. Here we use a simple method which compresses the first nontrivial subcase of the Hubbard model -- with one spin-up and one spin-down fermion -- enabling larger instances to be addressed using current quantum computing hardware. We implement this method on a superconducting quantum hardware platform for the case of the $2 \ti…
Variational quantum algorithms have been one of the most intensively studied applications for near-term quantum computing applications. The noisy intermediate-scale quantum (NISQ) regime, where small enough algorithms can be run successfully on noisy quantum computers expected during the next 5 years, is driving both a large amount of research work and a significant amount of private sector funding. Therefore, it is important to understand whether variational algorithms are effective at successfully converging to the correct answer in presence of noise. We perform a comprehensive study of the …
Extracting eigenvalues and eigenvectors of exponentially large matrices will be an important application of near-term quantum computers. The Variational Quantum Eigensolver (VQE) treats the case when the matrix is a Hamiltonian. Here, we address the case when the matrix is a density matrix $ρ$. We introduce the Variational Quantum State Eigensolver (VQSE), which is analogous to VQE in that it variationally learns the largest eigenvalues of $ρ$ as well as a gate sequence $V$ that prepares the corresponding eigenvectors. VQSE exploits the connection between diagonalization and majorization to de…
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 be viewed as an self-verifying eigensolver for arbitrary eigenstate by designing, since an eigenstate for a Hamiltonian should have zero energy variance. We demonstrate properties and advantages of VVQE for solving a set of excited states with quantum chemistry problems. Remarkably, we show that optimization of a combination of energy and variance…
The variational quantum eigensolver (VQE) and its variants, which is a method for finding eigenstates and eigenenergies of a given Hamiltonian, are appealing applications of near-term quantum computers. Although the eigenenergies are certainly important quantities which determines properties of a given system, their derivatives with respect to parameters of the system, such as positions of nuclei if we target a quantum chemistry problem, are also crucial to analyze the system. Here, we describe methods to evaluate analytical derivatives of the eigenenergy of a given Hamiltonian, including the …
One of the most promising applications of noisy intermediate-scale quantum computers is the simulation of molecular Hamiltonians using the variational quantum eigensolver. We show that encoding symmetries of the simulated Hamiltonian in the VQE ansatz reduces both classical and quantum resources compared to other, widely available ansatze. Through simulations of the H$_2$ molecule, we verify that these improvements persist in the presence of noise. This simulation is performed with IBM software using noise models from real devices. We also demonstrate how these techniques can be used to find m…
The problem of finding the ground state energy of a Hamiltonian using a quantum computer is currently solved using either the quantum phase estimation (QPE) or variational quantum eigensolver (VQE) algorithms. For precision $ε$, QPE requires $O(1)$ repetitions of circuits with depth $O(1/ε)$, whereas each expectation estimation subroutine within VQE requires $O(1/ε^{2})$ samples from circuits with depth $O(1)$. We propose a generalised VQE algorithm that interpolates between these two regimes via a free parameter $α\in[0,1]$ which can exploit quantum coherence over a circuit depth of $O(1/ε^α)…
We report the experimental resource-efficient implementation of the variational quantum eigensolver (VQE) using four-dimensional photonic quantum states of single-photons. The four-dimensional quantum states are implemented by utilizing polarization and path degrees of freedom of a single-photon. Our photonic VQE is equipped with the quantum error mitigation (QEM) protocol that efficiently reduces the effects of Pauli noise in the quantum processing unit. We apply our photonic VQE to estimate the ground state energy of He--H$^{+}$ cation. The simulation and experimental results demonstrate tha…
Solving for molecular excited states remains one of the key challenges of modern quantum chemistry. Traditional methods are constrained by existing computational capabilities, limiting the complexity of the molecules that can be studied or the accuracy of the results that can be obtained. Several quantum computing methods have been suggested to address this limitation. However, these typically have hardware requirements which may not be achieved in the near term. We propose a variational quantum machine learning based method to determine molecular excited states aiming at being as resilient as…
The Variational Quantum Eigensolver (VQE) is a promising algorithm for Noisy Intermediate Scale Quantum (NISQ) computation. Verification and validation of NISQ algorithms' performance on NISQ devices is an important task. We consider the exactly-diagonalizable Lipkin-Meshkov-Glick (LMG) model as a candidate for benchmarking NISQ computers. We use the Bethe ansatz to construct eigenstates of the trigonometric LMG model using quantum circuits inspired by the LMG's underlying algebraic structure. We construct circuits with depth $\mathcal{O}(N)$ and $\mathcal{O}(\log_2N)$ that can prepare any tri…
Variational quantum eigensolver (VQE) for electronic structure calculations is believed to be one major potential application of near term quantum computing. Among all proposed VQE algorithms, the unitary coupled cluster singles and doubles excitations (UCCSD) VQE ansatz has achieved high accuracy and received a lot of research interest. However, the UCCSD VQE based on fermionic excitations needs extra terms for the parity when using Jordan-Wigner transformation. Here we introduce a new VQE ansatz based on the particle preserving exchange gate to achieve qubit excitations. The proposed VQE ans…
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 contender for a chance at quantum advantage with near-term quantum computers. The ansatz, a parameterized circuit that prepares trial states, can dictate the success (or lack thereof) of a VQE. Too deep ansätze can hinder near-term viability, or lead to trainability issues that render the algorithm inefficient. The purpose of this thesis was to analyse different an…
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 Hamiltonia…
We describe the contextual subspace variational quantum eigensolver (CS-VQE), a hybrid quantum-classical algorithm for approximating the ground state energy of a Hamiltonian. The approximation to the ground state energy is obtained as the sum of two contributions. The first contribution comes from a noncontextual approximation to the Hamiltonian, and is computed classically. The second contribution is obtained by using the variational quantum eigensolver (VQE) technique to compute a contextual correction on a quantum processor. In general the VQE computation of the contextual correction uses f…
The ground and excited state calculations at key geometries, such as the Frank-Condon (FC) and the conical intersection (CI) geometries, are essential for understanding photophysical properties. To compute these geometries on noisy intermediate-scale quantum devices, we proposed a strategy that combined a chemistry-inspired spin-restricted ansatz and a new excited state calculation method called the variational quantum eigensolver under automatically-adjusted constraints (VQE/AC). Unlike the conventional excited state calculation method, called the variational quantum deflation, the VQE/AC doe…
The Variational Quantum Eigensolver (VQE) is one the most perspective algorithms for simulation of quantum many body physics that have recently attached a lot of attention and believed would be practical for implementation on the near term quantum devices. However, its feasibility and accuracy critically depend on the ansatz structure, which can be defined in different ways and appropriate choosing the structure presents a bottleneck of the protocol. In our work we present the optimization approach allowing shallow circuit solution. The major achievement of our Hot-Start method is the requirin…
A rigorous hybridization of variational quantum eigensolver with classical neural network
Seoul National University（首尔大学）；NextQuantum, Seoul National University（NextQuantum，首尔大学）；Automation and Systems Research Institute, Seoul National University（自动化与系统研究所，首尔大学）；Institute for Convergence Research and Education in Advanced Technology, Yonsei University（先进技术研究融合教育与研究所，延世大学）；Department of Quantum Information, Yonsei University（量子信息系，延世大学）
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 circuits called ansatz. Since the difficulty of the optimization depends on the complexity of the problem Hamiltonian and the structure of the ansatz, it has been difficult to analyze the performance of optimizers for the VQE systematically. To resolve this problem, we propose a technique to construct a benchmark problem whose ground state is guaranteed to be achi…
We use the Variational Quantum Eigensolver (VQE) as implemented in the Qiskit software package to compute the ground state energy of small molecules derived from water, H$_2$O, and hydrogen cyanide, HCN. The work aims to benchmark algorithms for calculating the electronic structure and energy surfaces of molecules of relevance to prebiotic chemistry, beginning with water and hydrogen cyanide, and to run them on the available simulated and physical quantum hardware. The numerical calculations of the algorithms for small quantum processors allow us to design more efficient protocols to be run in…
The variational quantum eigensolver (VQE) is a hybrid quantum-classical algorithm for finding the minimum eigenvalue of a Hamiltonian that involves the optimization of a parameterized quantum circuit. Since the resulting optimization problem is in general nonconvex, the method can converge to suboptimal parameter values which do not yield the minimum eigenvalue. In this work, we address this shortcoming by adopting the concept of variational adiabatic quantum computing (VAQC) as a procedure to improve VQE. In VAQC, the ground state of a continuously parameterized Hamiltonian is approximated vi…
We perform a systematic investigation of variational forms (wave function Ansätze), to determine the ground state energies and properties of two-dimensional model fermionic systems on triangular lattices (with and without periodic boundary conditions), using the Variational Quantum Eigensolver (VQE) algorithm. In particular, we focus on the nature of the entangler blocks which provide the most efficient convergence to the system ground state inasmuch as they use the minimal number of gate operations, which is key for the implementation of this algorithm in NISQ computers. Using the concurrence…
How an Equi-ensemble Description Systematically Outperforms the Weighted-ensemble Variational Quantum Eigensolver
ICGM, Université de Montpellier, CNRS, ENSCM（蒙彼利埃大学，法国国家科学研究中心，国立高等化学学校）；Dipartimento di Ingegneria e Scienze dell’Informazione e Matematica, Università dell’Aquila（阿奎拉大学）
The variational quantum-classical algorithms are the most promising approach for achieving quantum advantage on near-term quantum simulators. Among these methods, the variational quantum eigensolver has attracted a lot of attention in recent years. While it is very effective for simulating the ground state of many-body systems, its generalization to excited states becomes very resource demanding. Here, we show that this issue can significantly be improved by exploiting the symmetries of the Hamiltonian. The improvement is even more effective for higher energy eigenstates. We introduce two meth…
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 quantum computers. We study systematically the effect of noise for the VQE algorithm, by performing numerical simulations with various local noise models, including the amplitude damping, dephasing, and depolarizing noise. We show that the ground state energy will deviate from the exact value as the noise probability increase and normally noise will accumulate as…
We present and analyze large-scale simulation results of a hybrid quantum-classical variational method to calculate the ground state energy of the anti-ferromagnetic Heisenberg model. Using a massively parallel universal quantum computer simulator, we observe that a low-depth-circuit ansatz advantageously exploits the efficiently preparable Néel initial state, avoids potential barren plateaus, and works for both one- and two-dimensional lattices. The analysis reflects the decisive ingredients required for a simulation by comparing different ansätze, initial parameters, and gradient-based versu…
