相关论文: Landscape Analysis of Excited States Calculation o…
When does a variational quantum algorithm converge to a globally optimal solution? Despite the large literature around variational approaches to quantum computing, the answer is largely unknown. We address this open question by developing a…
We introduce a novel hybrid quantum-classical algorithm for the near-term computation of expectation values in quantum systems at finite temperatures. This is based on two stages: on the first one, a mixed state approximating a fiducial…
Variational quantum eigensolver (VQE) is a hybrid quantum-classical algorithm designed for noisy intermediate-scale quantum (NISQ) computers. It is promising for quantum chemical calculations (QCC) because it can calculate the ground-state…
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…
The Variational Quantum Eigensolver (VQE) is a promising quantum algorithm for applications in chemistry within the Noisy Intermediate-Scale Quantum (NISQ) era. The ability for a quantum computer to simulate electronic structures with high…
In the Noisy Intermediate-Scale Quantum (NISQ) era, solving the electronic structure problem from chemistry is considered as the "killer application" for near-term quantum devices. In spite of the success of variational hybrid…
Recent advances in quantum computing devices have brought attention to hybrid quantum-classical algorithms like the Variational Quantum Eigensolver (VQE) as a potential route to practical quantum advantage in chemistry. However, it is not…
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…
We find the ground-state energy of the Ising model using the Cascaded Variational Quantum Eigensolver (CVQE) algorithm with the Guided-Sampling Ansatz (GSA) using up to 63 qubits on a quantum computer. We study a heavy-hex lattice to match…
The cascaded variational quantum eigensolver (CVQE) circumvents the need for iterative communication between the quantum and classical processing units that is necessary in the conventional VQE algorithm. While CVQE offers complete freedom…
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…
Establishing the nature of the ground state of the Heisenberg antiferromagnet (HAFM) on the kagome lattice is well known to be a prohibitively difficult problem for classical computers. Here, we give a detailed proposal for a Variational…
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…
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…
The variational quantum eigensolver (VQE) is a promising algorithm for demonstrating quantum advantage in the noisy intermediate-scale quantum (NISQ) era. However, optimizing VQE from random initial starting parameters is challenging due to…
Accurate determination of ground-state energies for molecules remains a challenge in quantum chemistry and a cornerstone for progress in fields such as drug discovery and materials design. The Variational Quantum Eigensolver (VQE)…
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…
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…
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…
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…