Related papers: Quasiparticle Random Phase Approximation with an o…
An exactly solvable model is introduced, which is equivalent to the exact shell-model treatment of protons and neutrons in a single j-shell for Fermi-type excitations. Exact energies, quasiparticle numbers and double beta decay Fermi…
The self-consistent Relativistic Quasiparticle Random Phase Approximation (RQRPA) is extended by the quasiparticle-phonon coupling (QPC) model using the Quasiparticle Time Blocking Approximation (QTBA). The method is formulated in terms of…
Quantum ground-state problems are computationally hard problems; for general many-body Hamiltonians, there is no classical or quantum algorithm known to be able to solve them efficiently. Nevertheless, if a trial wavefunction approximating…
We present an analytic proof demonstrating the equivalence between the Random Phase Approximation (RPA) to the ground state correlation energy and a ring-diagram simplification of the Coupled Cluster Doubles (CCD) equations. In the CCD…
Variational algorithms for strongly correlated chemical and materials systems are one of the most promising applications of near-term quantum computers. We present an extension to the variational quantum eigensolver that approximates the…
An application of a self-consistent version of RPA to quantum field theory with broken symmetry is presented. Although our approach can be applied to any bosonic field theory, we specifically study the $\phi^4$ theory in 1+1 dimensions. We…
The matrix equations of the random-phase approximation (RPA) are derived for the point-coupling Lagrangian of the relativistic mean-field (RMF) model. Fully consistent RMF plus (quasiparticle) RPA illustrative calculations of the isoscalar…
We consider the task of approximating the ground state energy of two-local quantum Hamiltonians on bounded-degree graphs. Most existing algorithms optimize the energy over the set of product states. Here we describe a family of shallow…
We present a calculation of the properties of vibrational states in deformed, axially--symmetric even--even nuclei, within the framework of a fully self--consistent Quasparticle Random Phase Approximation (QRPA). The same Skyrme energy…
The effect of interactions on a system of fermions that are in a non-equilibrium steady state due to a quantum quench is studied employing the random-phase-approximation (RPA). As a result of the quench, the distribution function of the…
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…
By application of a straightforward variational procedure we derive a simple, analytic upper bound on the ground-state energy eigenvalue of a semirelativistic Hamiltonian for (one or two) spinless particles which experience some…
We present a quantum eigenstate filtering algorithm based on quantum signal processing (QSP) and minimax polynomials. The algorithm allows us to efficiently prepare a target eigenstate of a given Hamiltonian, if we have access to an initial…
We propose a variational framework for solving ground-state problems of open quantum systems governed by quantum stochastic differential equations (QSDEs). This formulation naturally accommodates bosonic operators, as commonly encountered…
One of the most promising applications for near term quantum computers is the simulation of physical quantum systems, particularly many-electron systems in chemistry and condensed matter physics. In solid state physics, finding the correct…
Under suitable assumptions, the quantum phase estimation (QPE) algorithm is able to achieve Heisenberg-limited precision scaling in estimating the ground state energy. However, QPE requires a large number of ancilla qubits and large circuit…
We present a quantum-classical hybrid random power method that approximates a ground state of a Hamiltonian. The quantum part of our method computes a fixed number of elements of a Hamiltonian-matrix polynomial via quantum polynomial…
The problem of finding the ground state energy of a Hamiltonian using a quantum computer is currently solved using either the quantum phase estimation (QPE) or variational quantum eigensolver (VQE) algorithms. For precision $\epsilon$, QPE…
We propose a hybrid quantum-classical algorithm for approximating the ground state and ground state energy of a Hamiltonian. Once the Ansatz has been decided, the quantum part of the algorithm involves the calculation of two overlap…
We propose a heuristic method to obtain the approximate groundstate for a Hamiltonian in the qubit form, based on the stabilizer formalism. These states may serve as proper initial states for further refined computation. It would be…