Related papers: Improved variational quantum eigensolver via quasi…
Ground-state estimation lies at the heart of a broad range of quantum simulations. Most near-term approaches are cast as variational energy minimization and thus inherit the challenges of problem-specific energy landscapes. We develop the…
The Variational Quantum Algorithms (VQAs) are hybrid quantum-classical algorithms and they can be used in the Nosiy Intermadiate Scale Quantum (NISQ) devises. The Variational Quantum Eigensolver (VQE) was suggested as a first VQA. VQE is…
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…
Variational Quantum Algorithms (VQAs) are a class of hybrid quantum-classical algorithms that leverage on classical optimization tools to find the optimal parameters for a parameterized quantum circuit. One relevant application of VQAs is…
The variational quantum eigensolver (VQE) is generally regarded as a promising quantum algorithm for near-term noisy quantum computers. However, when implemented with the deep circuits that are in principle required for achieving a…
In this work we integrate the variational quantum eigensolver (VQE) with the adiabatic connection (AC) method for efficient simulations of chemical problems on near-term quantum computers. Orbital optimized VQE methods are employed to…
Quantum computing technology has the potential to revolutionize the simulation of materials and molecules in the near future. A primary challenge in achieving near-term quantum advantage is effectively mitigating the noise effects inherent…
We propose a variational approach to explore quasiparticle excitations in interacting quantum many-body systems, motivated by the potential in leveraging near-term noisy intermediate scale quantum devices for quantum state preparation. By…
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 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…
Combinatorial optimization on near-term quantum devices is a promising path to demonstrating quantum advantage. However, the capabilities of these devices are constrained by high noise or error rates. In this paper, we propose an iterative…
We propose a qubit efficient scheme to study ground state properties of quantum many-body systems on near-term noisy intermediate scale quantum computers. One can obtain a tensor network representation of the ground state using a number of…
Advances in quantum simulator technology is increasingly required because research on quantum algorithms is becoming more sophisticated and complex. State vector simulation utilizes CPU and memory resources in computing nodes exponentially…
Applications such as simulating complicated quantum systems or solving large-scale linear algebra problems are very challenging for classical computers due to the extremely high computational cost. Quantum computers promise a solution,…
This work investigates a case study of using physical-based sonification of Quadratic Unconstrained Binary Optimization (QUBO) problems, optimized by the Variational Quantum Eigensolver (VQE) algorithm. The VQE approximates the solution of…
Variational quantum eigensolvers (VQEs) are successful algorithms for studying physical systems on quantum computers. Recently, they were extended to the measurement-based model of quantum computing, bringing resource graph states and their…
The Variational Quantum Eigensolver (VQE) is a key algorithm for near-term quantum computers, yet its performance is often limited by the classical optimization of circuit parameters. We propose using the velocity Verlet algorithm, inspired…
The variational quantum eigensolver (VQE) algorithm, designed to calculate the energy of molecular ground states on near-term quantum computers, requires specification of symmetries that describe the system, e.g. spin state and number of…
Variational-Quantum-Eigensolver(VQE) method on a quantum computer is a well-known hybrid algorithm to solve the eigenstates and eigenvalues that uses both quantum and classical computers. This method has the potential to solve quantum…
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…