Related papers: Hamiltonian-reconstruction distance as a success m…
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…
In this work we present a detailed analysis of variational quantum phase estimation (VQPE), a method based on real-time evolution for ground and excited state estimation on near-term hardware. We derive the theoretical ground on which the…
The ground state properties of the two-dimensional $J_1-J_2$-model are very challenging to analyze via classical numerical methods due to the high level of frustration. This makes the model a promising candidate where quantum computers…
Quantum computing is an advanced area of computing that leverages the principles of quantum mechanics. Quantum computing holds the potential to revolutionize various fields by handling problems that are currently intractable for classical…
Quantum computers are expected to be highly beneficial for chemistry simulations, promising significant improvements in accuracy and speed. The most prominent algorithm for chemistry simulations on NISQ devices is the Variational Quantum…
The Variational Quantum Eigensolver (VQE) algorithm, as applied to finding the ground state of a Hamiltonian, is particularly well-suited for deployment on noisy intermediate-scale quantum (NISQ) devices. Here we utilize the VQE algorithm…
To obtain estimates of electronic energies, the Variational Quantum Eigensolver (VQE) technique performs separate measurements for multiple parts of the system Hamiltonian. Current quantum hardware is restricted to projective single-qubit…
Quantum computers have the potential to transform the ways in which we tackle some important problems. The efforts by companies like Google, IBM and Microsoft to construct quantum computers have been making headlines for years. Equally…
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…
Spectral graph theory is a branch of mathematics that studies the relationships between the eigenvectors and eigenvalues of Laplacian and adjacency matrices and their associated graphs. The Variational Quantum Eigensolver (VQE) algorithm…
The Variational Quantum Eigensolver (VQE) is a quantum algorithm used to find the ground state energy of a given Hamiltonian. The key component of VQE is the ansatz, which is a trial wavefunction that the algorithm uses to approximate the…
Mapping out phase diagrams of quantum systems using classical simulations can be challenging or intractable due to the computational resources required to simulate even small quantum systems far away from the thermodynamic limit. We…
In the lead up to fault tolerance, the utility of quantum computing will be determined by how adequately the effects of noise can be circumvented in quantum algorithms. Hybrid quantum-classical algorithms such as the variational quantum…
The Variational Quantum Eigensolver (VQE) is a Variational Quantum Algorithm (VQA) to determine the ground state of quantum-mechanical systems. As a VQA, it makes use of a classical computer to optimize parameter values for its quantum…
We compare the performance of different methodologies for finding the ground state of the molecule BeH2. We implement adaptive, tetris-adaptive variational quantum eigensolver (VQE), and entanglement forging to reduce computational resource…
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…
We propose an extended version of the symmetry-adapted variational-quantum-eigensolver (VQE) and apply it to a two-component Fermi-Hubbard model on a bipartite lattice. In the extended symmetry-adapted VQE method, the Rayleigh quotient for…
Quantum Computing is believed to be the ultimate solution for quantum chemistry problems. Before the advent of large-scale, fully fault-tolerant quantum computers, the variational quantum eigensolver~(VQE) is a promising heuristic quantum…
Even a minor boost in solving combinatorial optimization problems can greatly benefit multiple industries. Quantum computers, with their unique information processing capabilities, hold promise for delivering such enhancements. 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…