Related papers: Efficient ground state preparation in variational …
Finding and probing the ground states of spin lattices, such as the antiferromagnetic Heisenberg model on the kagome lattice (KAFH), is a very challenging problem on classical computers and only possible for relatively small systems. We…
Variational quantum eigensolvers (VQEs) are one of the most important and effective applications of quantum computing, especially in the current noisy intermediate-scale quantum (NISQ) era. There are mainly two ways for VQEs:…
The state-of-the-art quantum computing hardware has entered the noisy intermediate-scale quantum (NISQ) era. Having been constrained by the limited number of qubits and shallow circuit depth, NISQ devices have nevertheless demonstrated the…
Estimating the ground-state energy of a quantum system is one of the most promising applications for quantum algorithms. Here we propose a variational quantum eigensolver (VQE) \emph{Ansatz} for finding ground state configuration…
Determining the ground state of a many-body Hamiltonian is a central problem across physics, chemistry, and combinatorial optimization, yet it is often classically intractable due to the exponential growth of Hilbert space with system size.…
The Variational Quantum Eigensolver (VQE) is a promising tool for simulating ground states of quantum many-body systems on noisy quantum computers. Its effectiveness relies heavily on the ansatz, which must be both hardware-efficient for…
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…
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…
Quantum systems have historically been formidable to simulate using classical computational methods, particularly as the system size grows. In recent years, advancements in quantum computing technology have offered new opportunities for…
One promising application of near-term quantum devices is to prepare trial wavefunctions using short circuits for solving different problems via variational algorithms. For this purpose, we introduce a new circuit design that combines…
Variational quantum eigensolvers (VQEs) are a promising class of quantum algorithms for preparing approximate ground states in near-term quantum devices. Minimizing the error in such an approximation requires designing ansatzes using…
We propose an efficient circuit structure of variational quantum circuit \textit{Ans\"{a}tze} used for the variational quantum eigensolver (VQE) algorithm in calculating gapped topological phases on the currently feasible noisy…
The Variational Quantum Eigensolver (VQE) is a promising hybrid algorithm, utilizing both quantum and classical computers to obtain the ground state energy of molecules. In this context, this study applies VQE to investigate the ground…
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…
This work studies the variational quantum eigensolver algorithm, designed to determine the ground state of a quantum mechanical system by combining classical and quantum hardware. Methods of reducing the number of required qubit…
Solving interacting multi-particle systems is a central challenge in quantum chemistry and condensed matter physics. In this work, we investigate the computation of ground states and ground-state energies for the He-H+ and H2O molecules…
We present and benchmark a type of variational quantum eigensolver (VQE), which we denote $\sigma$-VQE. It is designed to target mid-spectrum eigenstates and prepare quantum many-body scar states. The approach leverages the fact that noisy…
The variational quantum eigensolver (VQE) is currently the flagship algorithm for solving electronic structure problems on near-term quantum computers. This hybrid quantum/classical algorithm involves implementing a sequence of…
Recent research has shown that wavefunction evolution in real- and imaginary-time can generate quantum subspaces with significant utility for obtaining accurate ground state energies. Inspired by these methods, we propose combining quantum…
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…