Related papers: Quantum Algorithms for Ground-State Preparation an…
Hamiltonian simulation is a domain where quantum computers have the potential to outperform their classical counterparts. One of the main challenges of such quantum algorithms is increasing the system size, which is necessary to achieve…
A state-preserving quantum counting algorithm is used to obtain coefficients of a Lanczos recursion from a single ground state wavefunction on the quantum computer. This is used to compute the continued fraction representation of an…
Computation of the Green's function is crucial to study the properties of quantum many-body systems such as strongly correlated systems. Although the high-precision calculation of the Green's function is a notoriously challenging task on…
An end-to-end strategy for hybrid quantum-classical computations of Green's functions in many-body systems is presented and applied to the pairing model. The scheme makes explicit use of the spectral representation of the Green's function,…
A fundamental step of any quantum algorithm is the preparation of qubit registers in a suitable initial state. Often qubit registers represent a discretization of continuous variables and the initial state is defined by a multivariate…
Approximating ground and a fixed number of excited state energies, or equivalently low order Hamiltonian eigenvalues, is an important but computationally hard problem. Typically, the cost of classical deterministic algorithms grows…
We study the problems of state preparation, ground state preparation and quantum state preparation. We propose an analytic approach to a stochastic quantum algorithm which prepares the ground state for $n$-qubit Hamiltonian that is…
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…
In quantum algorithms discovered so far for simulating scattering processes in quantum field theories, state preparation is the slowest step. We present a new algorithm for preparing particle states to use in simulation of Fermionic Quantum…
We propose a scheme for the construction of one-particle Green's function (GF) of an interacting electronic system via statistical sampling on a quantum computer. Although the non-unitarity of creation and annihilation operators for the…
We present two techniques that can greatly reduce the number of gates required to realize an energy measurement, with application to ground state preparation in quantum simulations. The first technique realizes that to prepare the ground…
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…
We present and benchmark quantum computing approaches for calculating real-time single-particle Green's functions and nonlinear susceptibilities of Hamiltonian systems. The approaches leverage adaptive variational quantum algorithms for…
Quantum Phase Estimation (QPE), the quantum algorithm for estimating eigenvalues of a given Hermitian matrix and preparing its eigenvectors, is considered the most promising approach to finding the ground states and their energies of…
Solving for quantum ground states is important for understanding the properties of quantum many-body systems, and quantum computers are potentially well-suited for solving for quantum ground states. Recent work has presented a nearly…
Preparing the ground states of a many-body system is essential for evaluating physical quantities and determining the properties of materials. This work provides a quantum ground state preparation scheme with shallow variational warm-start…
Ground state counting plays an important role in several applications in science and engineering, from estimating residual entropy in physical systems, to bounding engineering reliability and solving combinatorial counting problems. While…
We describe a quantum algorithm for preparing states that encode solutions of non-homogeneous linear partial differential equations. The algorithm is a continuous-variable version of matrix inversion: it efficiently inverts differential…
We devise a quasilinear quantum algorithm for generating an approximation for the ground state of a quantum field theory (QFT). Our quantum algorithm delivers a super-quadratic speedup over the state-of-the-art quantum algorithm for…
Accurate computation of the Green's function is crucial for connecting experimental observations to the underlying quantum states. A major challenge in evaluating the Green's function in the time domain lies in the efficient simulation of…