Related papers: A non-Hermitian Ground State Searching Algorithm E…
Preparing the ground state of a Hamiltonian is a problem of great significance in physics with deep implications in the field of combinatorial optimization. The adiabatic algorithm is known to return the ground state for sufficiently long…
Finding the ground state of a Hamiltonian system is of great significance in many-body quantum physics and quantum chemistry. We propose an improved iterative quantum algorithm to prepare the ground state of a Hamiltonian. The crucial point…
We propose a novel non-Hermitian adiabatic quantum optimization algorithm. One of the new ideas is to use a non-Hermitian auxiliary "initial'' Hamiltonian that provides an effective level repulsion for the main Hamiltonian. This effect…
Quantum algorithms for probing ground-state properties of quantum systems require good initial states. Projection-based methods such as eigenvalue filtering rely on inputs that have a significant overlap with the low-energy subspace, which…
Calculating the energy spectrum of a quantum system is an important task, for example to analyse reaction rates in drug discovery and catalysis. There has been significant progress in developing algorithms to calculate the ground state…
Solving non-Hermitian quantum many-body systems on a quantum computer by minimizing the variational energy is challenging as the energy can be complex. Here, based on energy variance, we propose a variational method for solving the…
We propose a quantum algorithm, inspired by ADAPT-VQE, to variationally prepare the ground state of a quantum Hamiltonian, with the desirable property that if it fails to find the ground state, it still yields a physically meaningful…
One of the key applications for the emerging quantum simulators is to emulate the ground state of many-body systems, as it is of great interest in various fields from condensed matter physics to material science. Traditionally, in an analog…
We use matrix product techniques to investigate the performance of two algorithms for obtaining the ground state of a quantum many-body Hamiltonian $H = H_A + H_B$ in infinite systems. The first algorithm is a generalization of the quantum…
A key goal of digital quantum computing is the simulation of fermionic systems such as molecules or the Hubbard model. Unfortunately, for present and near-future quantum computers the use of quantum error correction schemes is still out of…
Non-Hermitian quantum systems have recently attracted considerable attention due to their exotic properties. Though many experimental realizations of non-Hermitian systems have been reported, the non-Hermiticity usually resorts to the…
Determining Hamiltonian ground states and energies is a challenging task with many possible approaches on quantum computers. While variational quantum eigensolvers are popular approaches for near term hardware, adiabatic state preparation…
We propose a general-purpose quantum algorithm for preparing ground states of quantum Hamiltonians from a given trial state. The algorithm is based on techniques recently developed in the context of solving the quantum linear systems…
We explore a non-variational quantum state preparation approach combined with the ADAPT operator selection strategy in the application of preparing the ground state of a desired target Hamiltonian. In this algorithm, energy gradient…
The motivation for studying non-Hermitian systems and the role of $\mathcal{PT}$-symmetry is discussed. We investigate the use of a quantum algorithm to find the eigenvalues and eigenvectors of non-Hermitian Hamiltonians, with applications…
We propose a non-Hermitian quantum annealing algorithm which can be useful for solving complex optimization problems. We demonstrate our approach on Grover's problem of finding a marked item inside of unsorted database. We show that the…
The variational preparation of complex quantum states using the quantum approximate optimization algorithm (QAOA) is of fundamental interest, and becomes a promising application of quantum computers. Here, we systematically study the…
The ground state properties of quantum many-body systems are a subject of interest across chemistry, materials science, and physics. Thus, algorithms for finding ground states can have broad impacts. Variational quantum algorithms are one…
We propose a variational quantum algorithm to study the real time dynamics of quantum systems as a ground-state problem. The method is based on the original proposal of Feynman and Kitaev to encode time into a register of auxiliary qubits.…
Reliable preparation of many-body ground states is an essential task in quantum computing, with applications spanning areas from chemistry and materials modeling to quantum optimization and benchmarking. A variety of approaches have been…